java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-ff8eab6 [2018-09-26 08:19:54,027 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-09-26 08:19:54,029 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-09-26 08:19:54,041 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-09-26 08:19:54,042 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-09-26 08:19:54,043 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-09-26 08:19:54,044 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-09-26 08:19:54,046 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-09-26 08:19:54,048 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-09-26 08:19:54,050 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-09-26 08:19:54,051 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-09-26 08:19:54,054 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-09-26 08:19:54,055 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-09-26 08:19:54,056 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-09-26 08:19:54,059 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-09-26 08:19:54,060 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-09-26 08:19:54,061 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-09-26 08:19:54,063 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-09-26 08:19:54,072 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-09-26 08:19:54,076 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-09-26 08:19:54,081 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-09-26 08:19:54,082 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-09-26 08:19:54,087 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-09-26 08:19:54,087 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-09-26 08:19:54,087 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-09-26 08:19:54,088 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-09-26 08:19:54,090 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-09-26 08:19:54,090 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-09-26 08:19:54,091 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-09-26 08:19:54,092 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-09-26 08:19:54,092 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-09-26 08:19:54,094 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-09-26 08:19:54,095 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-09-26 08:19:54,095 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-09-26 08:19:54,096 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-09-26 08:19:54,096 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-09-26 08:19:54,097 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:19:54,105 INFO L110 SettingsManager]: Loading preferences was successful [2018-09-26 08:19:54,105 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-09-26 08:19:54,106 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-09-26 08:19:54,106 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-09-26 08:19:54,107 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-09-26 08:19:54,107 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-09-26 08:19:54,107 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-09-26 08:19:54,107 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-09-26 08:19:54,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-09-26 08:19:54,185 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-09-26 08:19:54,188 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-09-26 08:19:54,190 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-09-26 08:19:54,190 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-09-26 08:19:54,191 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl [2018-09-26 08:19:54,191 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/simple4.i_3.bpl' [2018-09-26 08:19:54,237 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-09-26 08:19:54,240 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-09-26 08:19:54,241 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:54,241 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-09-26 08:19:54,241 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-09-26 08:19:54,262 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,275 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,283 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-09-26 08:19:54,284 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-09-26 08:19:54,284 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-09-26 08:19:54,284 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-09-26 08:19:54,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,296 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,296 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,297 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,300 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,302 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,304 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,306 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-09-26 08:19:54,306 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-09-26 08:19:54,307 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-09-26 08:19:54,307 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-09-26 08:19:54,311 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/1) ... [2018-09-26 08:19:54,406 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-09-26 08:19:54,406 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-09-26 08:19:54,596 INFO L346 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-09-26 08:19:54,597 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:54 BoogieIcfgContainer [2018-09-26 08:19:54,598 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-09-26 08:19:54,599 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-09-26 08:19:54,599 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-09-26 08:19:54,603 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-09-26 08:19:54,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 26.09 08:19:54" (1/2) ... [2018-09-26 08:19:54,605 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c769c2b and model type simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.09 08:19:54, skipping insertion in model container [2018-09-26 08:19:54,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.09 08:19:54" (2/2) ... [2018-09-26 08:19:54,609 INFO L112 eAbstractionObserver]: Analyzing ICFG simple4.i_3.bpl [2018-09-26 08:19:54,619 INFO L137 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-09-26 08:19:54,630 INFO L149 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-09-26 08:19:54,674 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-09-26 08:19:54,676 INFO L381 AbstractCegarLoop]: Interprodecural is true [2018-09-26 08:19:54,676 INFO L382 AbstractCegarLoop]: Hoare is true [2018-09-26 08:19:54,676 INFO L383 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-09-26 08:19:54,676 INFO L384 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-09-26 08:19:54,677 INFO L385 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-09-26 08:19:54,677 INFO L386 AbstractCegarLoop]: Difference is false [2018-09-26 08:19:54,677 INFO L387 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-09-26 08:19:54,677 INFO L392 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-09-26 08:19:54,693 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-09-26 08:19:54,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-09-26 08:19:54,706 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,708 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-09-26 08:19:54,709 INFO L423 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,718 INFO L82 PathProgramCache]: Analyzing trace with hash 925639, now seen corresponding path program 1 times [2018-09-26 08:19:54,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:54,816 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:19:54,819 INFO L313 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-09-26 08:19:54,819 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-09-26 08:19:54,824 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-09-26 08:19:54,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-09-26 08:19:54,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-09-26 08:19:54,840 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-09-26 08:19:54,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:54,874 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-09-26 08:19:54,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-09-26 08:19:54,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-09-26 08:19:54,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:54,893 INFO L225 Difference]: With dead ends: 10 [2018-09-26 08:19:54,893 INFO L226 Difference]: Without dead ends: 7 [2018-09-26 08:19:54,900 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:19:54,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-09-26 08:19:54,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-09-26 08:19:54,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-09-26 08:19:54,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-09-26 08:19:54,941 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-09-26 08:19:54,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:54,942 INFO L480 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-09-26 08:19:54,942 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-09-26 08:19:54,942 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-09-26 08:19:54,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-09-26 08:19:54,943 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:54,943 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-09-26 08:19:54,944 INFO L423 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:54,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:54,944 INFO L82 PathProgramCache]: Analyzing trace with hash 889591169, now seen corresponding path program 1 times [2018-09-26 08:19:54,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:54,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,007 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,008 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,009 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-09-26 08:19:55,011 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-09-26 08:19:55,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-09-26 08:19:55,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:55,013 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-09-26 08:19:55,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,040 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-09-26 08:19:55,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-09-26 08:19:55,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-09-26 08:19:55,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,047 INFO L225 Difference]: With dead ends: 11 [2018-09-26 08:19:55,047 INFO L226 Difference]: Without dead ends: 9 [2018-09-26 08:19:55,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-09-26 08:19:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-09-26 08:19:55,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-09-26 08:19:55,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-09-26 08:19:55,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-09-26 08:19:55,053 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-09-26 08:19:55,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,053 INFO L480 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-09-26 08:19:55,053 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-09-26 08:19:55,054 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-09-26 08:19:55,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-09-26 08:19:55,054 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,054 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-09-26 08:19:55,055 INFO L423 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,055 INFO L82 PathProgramCache]: Analyzing trace with hash 198673595, now seen corresponding path program 2 times [2018-09-26 08:19:55,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,126 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:19:55,126 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,127 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-09-26 08:19:55,127 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-09-26 08:19:55,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-09-26 08:19:55,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:55,131 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-09-26 08:19:55,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,171 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-09-26 08:19:55,172 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-09-26 08:19:55,172 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-09-26 08:19:55,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,173 INFO L225 Difference]: With dead ends: 13 [2018-09-26 08:19:55,173 INFO L226 Difference]: Without dead ends: 11 [2018-09-26 08:19:55,174 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-09-26 08:19:55,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-09-26 08:19:55,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-09-26 08:19:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-09-26 08:19:55,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-09-26 08:19:55,179 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-09-26 08:19:55,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,180 INFO L480 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-09-26 08:19:55,180 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-09-26 08:19:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-09-26 08:19:55,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-09-26 08:19:55,181 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,181 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-09-26 08:19:55,182 INFO L423 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1946815861, now seen corresponding path program 3 times [2018-09-26 08:19:55,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,248 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,248 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,249 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-09-26 08:19:55,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-09-26 08:19:55,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-09-26 08:19:55,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:55,252 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-09-26 08:19:55,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,335 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-09-26 08:19:55,335 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-09-26 08:19:55,336 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-09-26 08:19:55,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,339 INFO L225 Difference]: With dead ends: 15 [2018-09-26 08:19:55,339 INFO L226 Difference]: Without dead ends: 13 [2018-09-26 08:19:55,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-09-26 08:19:55,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-09-26 08:19:55,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-09-26 08:19:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-09-26 08:19:55,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-09-26 08:19:55,349 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-09-26 08:19:55,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,349 INFO L480 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-09-26 08:19:55,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-09-26 08:19:55,351 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-09-26 08:19:55,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-09-26 08:19:55,352 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,352 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-09-26 08:19:55,352 INFO L423 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1715646545, now seen corresponding path program 4 times [2018-09-26 08:19:55,353 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,425 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,426 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,426 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-09-26 08:19:55,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-09-26 08:19:55,427 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-09-26 08:19:55,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:55,428 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-09-26 08:19:55,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,485 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-09-26 08:19:55,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-09-26 08:19:55,486 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-09-26 08:19:55,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,487 INFO L225 Difference]: With dead ends: 17 [2018-09-26 08:19:55,487 INFO L226 Difference]: Without dead ends: 15 [2018-09-26 08:19:55,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-09-26 08:19:55,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-09-26 08:19:55,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-09-26 08:19:55,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-09-26 08:19:55,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-09-26 08:19:55,494 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-09-26 08:19:55,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,494 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-09-26 08:19:55,494 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-09-26 08:19:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-09-26 08:19:55,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-09-26 08:19:55,495 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,495 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-09-26 08:19:55,496 INFO L423 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,496 INFO L82 PathProgramCache]: Analyzing trace with hash 531164009, now seen corresponding path program 5 times [2018-09-26 08:19:55,496 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,595 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,596 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,596 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-09-26 08:19:55,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-09-26 08:19:55,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-09-26 08:19:55,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:19:55,597 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-09-26 08:19:55,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,638 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-09-26 08:19:55,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-09-26 08:19:55,639 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-09-26 08:19:55,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,643 INFO L225 Difference]: With dead ends: 19 [2018-09-26 08:19:55,644 INFO L226 Difference]: Without dead ends: 17 [2018-09-26 08:19:55,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-09-26 08:19:55,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-09-26 08:19:55,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-09-26 08:19:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-09-26 08:19:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-09-26 08:19:55,655 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-09-26 08:19:55,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,655 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-09-26 08:19:55,655 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-09-26 08:19:55,658 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-09-26 08:19:55,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-09-26 08:19:55,659 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,659 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-09-26 08:19:55,660 INFO L423 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,660 INFO L82 PathProgramCache]: Analyzing trace with hash -652443485, now seen corresponding path program 6 times [2018-09-26 08:19:55,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,764 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-09-26 08:19:55,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-09-26 08:19:55,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-09-26 08:19:55,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:19:55,766 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-09-26 08:19:55,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,805 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-09-26 08:19:55,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-09-26 08:19:55,806 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-09-26 08:19:55,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,807 INFO L225 Difference]: With dead ends: 21 [2018-09-26 08:19:55,807 INFO L226 Difference]: Without dead ends: 19 [2018-09-26 08:19:55,808 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-09-26 08:19:55,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-09-26 08:19:55,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-09-26 08:19:55,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-09-26 08:19:55,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-09-26 08:19:55,814 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-09-26 08:19:55,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,814 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-09-26 08:19:55,815 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-09-26 08:19:55,815 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-09-26 08:19:55,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-09-26 08:19:55,816 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:55,816 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-09-26 08:19:55,816 INFO L423 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:55,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:55,817 INFO L82 PathProgramCache]: Analyzing trace with hash 67088221, now seen corresponding path program 7 times [2018-09-26 08:19:55,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:55,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:55,890 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:55,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:55,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-09-26 08:19:55,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-09-26 08:19:55,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-09-26 08:19:55,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:19:55,894 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-09-26 08:19:55,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:55,978 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-09-26 08:19:55,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-09-26 08:19:55,979 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-09-26 08:19:55,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:55,982 INFO L225 Difference]: With dead ends: 23 [2018-09-26 08:19:55,982 INFO L226 Difference]: Without dead ends: 21 [2018-09-26 08:19:55,984 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-09-26 08:19:55,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-09-26 08:19:55,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-09-26 08:19:55,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-09-26 08:19:55,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-09-26 08:19:55,995 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-09-26 08:19:55,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:55,995 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-09-26 08:19:55,996 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-09-26 08:19:55,996 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-09-26 08:19:56,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-09-26 08:19:56,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,000 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-09-26 08:19:56,001 INFO L423 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,002 INFO L82 PathProgramCache]: Analyzing trace with hash 47323031, now seen corresponding path program 8 times [2018-09-26 08:19:56,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,088 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,090 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,091 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-09-26 08:19:56,091 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-09-26 08:19:56,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-09-26 08:19:56,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:19:56,093 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-09-26 08:19:56,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,156 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-09-26 08:19:56,156 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-09-26 08:19:56,158 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-09-26 08:19:56,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,159 INFO L225 Difference]: With dead ends: 25 [2018-09-26 08:19:56,159 INFO L226 Difference]: Without dead ends: 23 [2018-09-26 08:19:56,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-09-26 08:19:56,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-09-26 08:19:56,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-09-26 08:19:56,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-09-26 08:19:56,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-09-26 08:19:56,171 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-09-26 08:19:56,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,173 INFO L480 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-09-26 08:19:56,174 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-09-26 08:19:56,174 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-09-26 08:19:56,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-09-26 08:19:56,175 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,175 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-09-26 08:19:56,175 INFO L423 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,180 INFO L82 PathProgramCache]: Analyzing trace with hash -1767155375, now seen corresponding path program 9 times [2018-09-26 08:19:56,180 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,261 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,262 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,262 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-09-26 08:19:56,263 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-09-26 08:19:56,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-09-26 08:19:56,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:19:56,264 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-09-26 08:19:56,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,316 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-09-26 08:19:56,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-09-26 08:19:56,316 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-09-26 08:19:56,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,317 INFO L225 Difference]: With dead ends: 27 [2018-09-26 08:19:56,318 INFO L226 Difference]: Without dead ends: 25 [2018-09-26 08:19:56,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-09-26 08:19:56,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-09-26 08:19:56,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-09-26 08:19:56,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-09-26 08:19:56,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-09-26 08:19:56,327 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-09-26 08:19:56,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,327 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-09-26 08:19:56,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-09-26 08:19:56,328 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-09-26 08:19:56,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-09-26 08:19:56,329 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,329 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-09-26 08:19:56,329 INFO L423 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,330 INFO L82 PathProgramCache]: Analyzing trace with hash -1724181365, now seen corresponding path program 10 times [2018-09-26 08:19:56,330 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,421 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,422 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,422 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-09-26 08:19:56,422 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-09-26 08:19:56,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-09-26 08:19:56,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:19:56,424 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-09-26 08:19:56,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,475 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-09-26 08:19:56,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-09-26 08:19:56,476 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-09-26 08:19:56,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,477 INFO L225 Difference]: With dead ends: 29 [2018-09-26 08:19:56,477 INFO L226 Difference]: Without dead ends: 27 [2018-09-26 08:19:56,478 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-09-26 08:19:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-09-26 08:19:56,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-09-26 08:19:56,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-09-26 08:19:56,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-09-26 08:19:56,484 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-09-26 08:19:56,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,484 INFO L480 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-09-26 08:19:56,484 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-09-26 08:19:56,484 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-09-26 08:19:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-09-26 08:19:56,485 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,486 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-09-26 08:19:56,486 INFO L423 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 919136581, now seen corresponding path program 11 times [2018-09-26 08:19:56,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,564 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,564 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,565 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-09-26 08:19:56,565 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-09-26 08:19:56,565 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-09-26 08:19:56,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:19:56,568 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-09-26 08:19:56,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,625 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-09-26 08:19:56,625 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-09-26 08:19:56,625 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-09-26 08:19:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,626 INFO L225 Difference]: With dead ends: 31 [2018-09-26 08:19:56,627 INFO L226 Difference]: Without dead ends: 29 [2018-09-26 08:19:56,627 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-09-26 08:19:56,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-09-26 08:19:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-09-26 08:19:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-09-26 08:19:56,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-09-26 08:19:56,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-09-26 08:19:56,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,634 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-09-26 08:19:56,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-09-26 08:19:56,634 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-09-26 08:19:56,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-09-26 08:19:56,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,636 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-09-26 08:19:56,636 INFO L423 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,637 INFO L82 PathProgramCache]: Analyzing trace with hash -1472956545, now seen corresponding path program 12 times [2018-09-26 08:19:56,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,711 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,711 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,711 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-09-26 08:19:56,712 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-09-26 08:19:56,712 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-09-26 08:19:56,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:19:56,713 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-09-26 08:19:56,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,776 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-09-26 08:19:56,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-09-26 08:19:56,777 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-09-26 08:19:56,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,778 INFO L225 Difference]: With dead ends: 33 [2018-09-26 08:19:56,778 INFO L226 Difference]: Without dead ends: 31 [2018-09-26 08:19:56,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-09-26 08:19:56,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-09-26 08:19:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-09-26 08:19:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-09-26 08:19:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-09-26 08:19:56,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-09-26 08:19:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,786 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-09-26 08:19:56,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-09-26 08:19:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-09-26 08:19:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-09-26 08:19:56,787 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,787 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-09-26 08:19:56,788 INFO L423 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,788 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1828020025, now seen corresponding path program 13 times [2018-09-26 08:19:56,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:56,878 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:56,878 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:56,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-09-26 08:19:56,879 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-09-26 08:19:56,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-09-26 08:19:56,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:19:56,880 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-09-26 08:19:56,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:56,964 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-09-26 08:19:56,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-09-26 08:19:56,965 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-09-26 08:19:56,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:56,969 INFO L225 Difference]: With dead ends: 35 [2018-09-26 08:19:56,969 INFO L226 Difference]: Without dead ends: 33 [2018-09-26 08:19:56,970 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-09-26 08:19:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-09-26 08:19:56,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-09-26 08:19:56,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-09-26 08:19:56,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-09-26 08:19:56,982 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-09-26 08:19:56,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:56,982 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-09-26 08:19:56,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-09-26 08:19:56,982 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-09-26 08:19:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-09-26 08:19:56,983 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:56,984 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-09-26 08:19:56,984 INFO L423 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:56,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:56,986 INFO L82 PathProgramCache]: Analyzing trace with hash 85672051, now seen corresponding path program 14 times [2018-09-26 08:19:56,986 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:57,115 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:19:57,116 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:57,116 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-09-26 08:19:57,117 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-09-26 08:19:57,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-09-26 08:19:57,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:19:57,118 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-09-26 08:19:57,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:57,215 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-09-26 08:19:57,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-09-26 08:19:57,215 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-09-26 08:19:57,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:57,217 INFO L225 Difference]: With dead ends: 37 [2018-09-26 08:19:57,217 INFO L226 Difference]: Without dead ends: 35 [2018-09-26 08:19:57,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-09-26 08:19:57,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-09-26 08:19:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-09-26 08:19:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-09-26 08:19:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-09-26 08:19:57,232 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-09-26 08:19:57,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:57,233 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-09-26 08:19:57,233 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-09-26 08:19:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-09-26 08:19:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-09-26 08:19:57,237 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,237 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-09-26 08:19:57,237 INFO L423 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,238 INFO L82 PathProgramCache]: Analyzing trace with hash 726514477, now seen corresponding path program 15 times [2018-09-26 08:19:57,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:57,369 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:57,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:57,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-09-26 08:19:57,370 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-09-26 08:19:57,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-09-26 08:19:57,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:19:57,371 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-09-26 08:19:57,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:57,465 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-09-26 08:19:57,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-09-26 08:19:57,465 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-09-26 08:19:57,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:57,466 INFO L225 Difference]: With dead ends: 39 [2018-09-26 08:19:57,466 INFO L226 Difference]: Without dead ends: 37 [2018-09-26 08:19:57,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-09-26 08:19:57,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-09-26 08:19:57,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-09-26 08:19:57,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-09-26 08:19:57,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-09-26 08:19:57,474 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-09-26 08:19:57,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:57,475 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-09-26 08:19:57,475 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-09-26 08:19:57,475 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-09-26 08:19:57,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-09-26 08:19:57,476 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,476 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-09-26 08:19:57,477 INFO L423 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,477 INFO L82 PathProgramCache]: Analyzing trace with hash -1899204761, now seen corresponding path program 16 times [2018-09-26 08:19:57,477 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:57,599 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:57,600 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:57,600 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-09-26 08:19:57,601 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-09-26 08:19:57,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-09-26 08:19:57,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:19:57,602 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-09-26 08:19:57,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:57,703 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-09-26 08:19:57,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-09-26 08:19:57,704 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-09-26 08:19:57,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:57,705 INFO L225 Difference]: With dead ends: 41 [2018-09-26 08:19:57,705 INFO L226 Difference]: Without dead ends: 39 [2018-09-26 08:19:57,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-09-26 08:19:57,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-09-26 08:19:57,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-09-26 08:19:57,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-09-26 08:19:57,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-09-26 08:19:57,725 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-09-26 08:19:57,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:57,725 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-09-26 08:19:57,726 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-09-26 08:19:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-09-26 08:19:57,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-09-26 08:19:57,732 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,732 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-09-26 08:19:57,733 INFO L423 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,733 INFO L82 PathProgramCache]: Analyzing trace with hash 225377569, now seen corresponding path program 17 times [2018-09-26 08:19:57,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:57,855 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:57,856 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:57,856 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-09-26 08:19:57,857 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-09-26 08:19:57,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-09-26 08:19:57,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:19:57,858 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-09-26 08:19:57,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:57,965 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-09-26 08:19:57,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-09-26 08:19:57,965 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-09-26 08:19:57,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:57,966 INFO L225 Difference]: With dead ends: 43 [2018-09-26 08:19:57,966 INFO L226 Difference]: Without dead ends: 41 [2018-09-26 08:19:57,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-09-26 08:19:57,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-09-26 08:19:57,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-09-26 08:19:57,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-09-26 08:19:57,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-09-26 08:19:57,974 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-09-26 08:19:57,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:57,975 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-09-26 08:19:57,975 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-09-26 08:19:57,975 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-09-26 08:19:57,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-09-26 08:19:57,976 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:57,976 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-09-26 08:19:57,977 INFO L423 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:57,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:57,977 INFO L82 PathProgramCache]: Analyzing trace with hash 1839531099, now seen corresponding path program 18 times [2018-09-26 08:19:57,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,118 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:58,119 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,119 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-09-26 08:19:58,120 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-09-26 08:19:58,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-09-26 08:19:58,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:19:58,124 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-09-26 08:19:58,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,246 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-09-26 08:19:58,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-09-26 08:19:58,247 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-09-26 08:19:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,248 INFO L225 Difference]: With dead ends: 45 [2018-09-26 08:19:58,248 INFO L226 Difference]: Without dead ends: 43 [2018-09-26 08:19:58,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-09-26 08:19:58,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-09-26 08:19:58,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-09-26 08:19:58,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-09-26 08:19:58,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-09-26 08:19:58,258 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-09-26 08:19:58,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,258 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-09-26 08:19:58,258 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-09-26 08:19:58,259 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-09-26 08:19:58,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-09-26 08:19:58,259 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,259 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-09-26 08:19:58,260 INFO L423 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,260 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1737087723, now seen corresponding path program 19 times [2018-09-26 08:19:58,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,401 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:58,402 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,402 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-09-26 08:19:58,402 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-09-26 08:19:58,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-09-26 08:19:58,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:19:58,404 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-09-26 08:19:58,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,529 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-09-26 08:19:58,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-09-26 08:19:58,529 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-09-26 08:19:58,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,530 INFO L225 Difference]: With dead ends: 47 [2018-09-26 08:19:58,531 INFO L226 Difference]: Without dead ends: 45 [2018-09-26 08:19:58,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-09-26 08:19:58,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-09-26 08:19:58,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-09-26 08:19:58,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-09-26 08:19:58,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-09-26 08:19:58,549 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-09-26 08:19:58,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,549 INFO L480 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-09-26 08:19:58,550 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-09-26 08:19:58,550 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-09-26 08:19:58,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-09-26 08:19:58,554 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,554 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-09-26 08:19:58,555 INFO L423 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1401028431, now seen corresponding path program 20 times [2018-09-26 08:19:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:58,716 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:58,716 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:58,716 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-09-26 08:19:58,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-09-26 08:19:58,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-09-26 08:19:58,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:19:58,718 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-09-26 08:19:58,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:58,865 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-09-26 08:19:58,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-09-26 08:19:58,866 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-09-26 08:19:58,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:58,867 INFO L225 Difference]: With dead ends: 49 [2018-09-26 08:19:58,867 INFO L226 Difference]: Without dead ends: 47 [2018-09-26 08:19:58,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-09-26 08:19:58,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-09-26 08:19:58,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-09-26 08:19:58,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-09-26 08:19:58,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-09-26 08:19:58,875 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-09-26 08:19:58,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:58,875 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-09-26 08:19:58,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-09-26 08:19:58,876 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-09-26 08:19:58,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-09-26 08:19:58,876 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:58,877 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-09-26 08:19:58,877 INFO L423 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:58,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:58,878 INFO L82 PathProgramCache]: Analyzing trace with hash 2063610633, now seen corresponding path program 21 times [2018-09-26 08:19:58,878 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:58,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,105 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:59,105 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,105 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-09-26 08:19:59,106 INFO L459 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-09-26 08:19:59,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-09-26 08:19:59,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:19:59,107 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-09-26 08:19:59,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,245 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-09-26 08:19:59,245 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-09-26 08:19:59,246 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-09-26 08:19:59,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,248 INFO L225 Difference]: With dead ends: 51 [2018-09-26 08:19:59,249 INFO L226 Difference]: Without dead ends: 49 [2018-09-26 08:19:59,250 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-09-26 08:19:59,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-09-26 08:19:59,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-09-26 08:19:59,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-09-26 08:19:59,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-09-26 08:19:59,260 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-09-26 08:19:59,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,260 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-09-26 08:19:59,260 INFO L481 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-09-26 08:19:59,260 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-09-26 08:19:59,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-09-26 08:19:59,261 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,261 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-09-26 08:19:59,263 INFO L423 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1145020349, now seen corresponding path program 22 times [2018-09-26 08:19:59,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,440 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:59,441 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,441 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-09-26 08:19:59,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-09-26 08:19:59,442 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-09-26 08:19:59,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:19:59,442 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-09-26 08:19:59,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,589 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-09-26 08:19:59,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-09-26 08:19:59,590 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-09-26 08:19:59,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,590 INFO L225 Difference]: With dead ends: 53 [2018-09-26 08:19:59,591 INFO L226 Difference]: Without dead ends: 51 [2018-09-26 08:19:59,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-09-26 08:19:59,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-09-26 08:19:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-09-26 08:19:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-09-26 08:19:59,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-09-26 08:19:59,606 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-09-26 08:19:59,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,606 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-09-26 08:19:59,606 INFO L481 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-09-26 08:19:59,606 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-09-26 08:19:59,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-09-26 08:19:59,607 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,607 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-09-26 08:19:59,611 INFO L423 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,611 INFO L82 PathProgramCache]: Analyzing trace with hash -852875523, now seen corresponding path program 23 times [2018-09-26 08:19:59,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:19:59,786 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:19:59,786 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:19:59,786 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-09-26 08:19:59,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-09-26 08:19:59,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-09-26 08:19:59,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:19:59,788 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-09-26 08:19:59,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:19:59,944 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-09-26 08:19:59,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-09-26 08:19:59,944 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-09-26 08:19:59,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:19:59,945 INFO L225 Difference]: With dead ends: 55 [2018-09-26 08:19:59,945 INFO L226 Difference]: Without dead ends: 53 [2018-09-26 08:19:59,946 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-09-26 08:19:59,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-09-26 08:19:59,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-09-26 08:19:59,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-09-26 08:19:59,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-09-26 08:19:59,952 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-09-26 08:19:59,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:19:59,952 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-09-26 08:19:59,952 INFO L481 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-09-26 08:19:59,952 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-09-26 08:19:59,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-09-26 08:19:59,953 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:19:59,953 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-09-26 08:19:59,954 INFO L423 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:19:59,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:19:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash 725428023, now seen corresponding path program 24 times [2018-09-26 08:19:59,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:19:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,140 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:00,141 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,141 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-09-26 08:20:00,141 INFO L459 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-09-26 08:20:00,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-09-26 08:20:00,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:00,143 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-09-26 08:20:00,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,318 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-09-26 08:20:00,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-09-26 08:20:00,322 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-09-26 08:20:00,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,323 INFO L225 Difference]: With dead ends: 57 [2018-09-26 08:20:00,323 INFO L226 Difference]: Without dead ends: 55 [2018-09-26 08:20:00,324 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-09-26 08:20:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-09-26 08:20:00,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-09-26 08:20:00,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-09-26 08:20:00,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-09-26 08:20:00,334 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-09-26 08:20:00,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,334 INFO L480 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-09-26 08:20:00,334 INFO L481 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-09-26 08:20:00,334 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-09-26 08:20:00,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-09-26 08:20:00,335 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,335 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-09-26 08:20:00,338 INFO L423 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,338 INFO L82 PathProgramCache]: Analyzing trace with hash 1351680241, now seen corresponding path program 25 times [2018-09-26 08:20:00,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,531 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:00,531 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,531 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-09-26 08:20:00,532 INFO L459 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-09-26 08:20:00,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-09-26 08:20:00,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:00,533 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-09-26 08:20:00,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:00,701 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-09-26 08:20:00,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-09-26 08:20:00,701 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-09-26 08:20:00,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:00,702 INFO L225 Difference]: With dead ends: 59 [2018-09-26 08:20:00,702 INFO L226 Difference]: Without dead ends: 57 [2018-09-26 08:20:00,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-09-26 08:20:00,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-09-26 08:20:00,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-09-26 08:20:00,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-09-26 08:20:00,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-09-26 08:20:00,708 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-09-26 08:20:00,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:00,709 INFO L480 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-09-26 08:20:00,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-09-26 08:20:00,709 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-09-26 08:20:00,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-09-26 08:20:00,710 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:00,710 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-09-26 08:20:00,710 INFO L423 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:00,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:00,710 INFO L82 PathProgramCache]: Analyzing trace with hash 1884640299, now seen corresponding path program 26 times [2018-09-26 08:20:00,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:00,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:00,882 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:00,882 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:00,883 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-09-26 08:20:00,883 INFO L459 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-09-26 08:20:00,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-09-26 08:20:00,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:00,884 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-09-26 08:20:01,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,071 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-09-26 08:20:01,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-09-26 08:20:01,071 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-09-26 08:20:01,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,072 INFO L225 Difference]: With dead ends: 61 [2018-09-26 08:20:01,072 INFO L226 Difference]: Without dead ends: 59 [2018-09-26 08:20:01,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-09-26 08:20:01,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-09-26 08:20:01,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-09-26 08:20:01,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-09-26 08:20:01,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-09-26 08:20:01,079 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-09-26 08:20:01,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,080 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-09-26 08:20:01,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-09-26 08:20:01,080 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-09-26 08:20:01,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-09-26 08:20:01,081 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,081 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-09-26 08:20:01,081 INFO L423 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,082 INFO L82 PathProgramCache]: Analyzing trace with hash -1336819483, now seen corresponding path program 27 times [2018-09-26 08:20:01,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,277 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:01,277 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,277 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-09-26 08:20:01,278 INFO L459 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-09-26 08:20:01,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-09-26 08:20:01,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:01,279 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-09-26 08:20:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,464 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-09-26 08:20:01,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-09-26 08:20:01,464 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-09-26 08:20:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,465 INFO L225 Difference]: With dead ends: 63 [2018-09-26 08:20:01,465 INFO L226 Difference]: Without dead ends: 61 [2018-09-26 08:20:01,466 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-09-26 08:20:01,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-09-26 08:20:01,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-09-26 08:20:01,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-09-26 08:20:01,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-09-26 08:20:01,471 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-09-26 08:20:01,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,472 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-09-26 08:20:01,472 INFO L481 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-09-26 08:20:01,472 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-09-26 08:20:01,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-09-26 08:20:01,472 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,472 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-09-26 08:20:01,473 INFO L423 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,473 INFO L82 PathProgramCache]: Analyzing trace with hash -488249569, now seen corresponding path program 28 times [2018-09-26 08:20:01,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:01,660 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:01,660 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:01,660 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-09-26 08:20:01,661 INFO L459 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-09-26 08:20:01,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-09-26 08:20:01,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:01,662 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-09-26 08:20:01,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:01,855 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-09-26 08:20:01,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-09-26 08:20:01,856 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-09-26 08:20:01,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:01,860 INFO L225 Difference]: With dead ends: 65 [2018-09-26 08:20:01,860 INFO L226 Difference]: Without dead ends: 63 [2018-09-26 08:20:01,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-09-26 08:20:01,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-09-26 08:20:01,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-09-26 08:20:01,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-09-26 08:20:01,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-09-26 08:20:01,868 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-09-26 08:20:01,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:01,869 INFO L480 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-09-26 08:20:01,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-09-26 08:20:01,869 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-09-26 08:20:01,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-09-26 08:20:01,869 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:01,870 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-09-26 08:20:01,870 INFO L423 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:01,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:01,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1056348455, now seen corresponding path program 29 times [2018-09-26 08:20:01,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:01,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,093 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:02,093 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,094 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-09-26 08:20:02,094 INFO L459 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-09-26 08:20:02,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-09-26 08:20:02,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:02,096 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-09-26 08:20:02,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,341 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-09-26 08:20:02,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-09-26 08:20:02,342 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-09-26 08:20:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,343 INFO L225 Difference]: With dead ends: 67 [2018-09-26 08:20:02,343 INFO L226 Difference]: Without dead ends: 65 [2018-09-26 08:20:02,344 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-09-26 08:20:02,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-09-26 08:20:02,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-09-26 08:20:02,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-09-26 08:20:02,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-09-26 08:20:02,352 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-09-26 08:20:02,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,353 INFO L480 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-09-26 08:20:02,353 INFO L481 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-09-26 08:20:02,353 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-09-26 08:20:02,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-09-26 08:20:02,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,354 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-09-26 08:20:02,354 INFO L423 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,355 INFO L82 PathProgramCache]: Analyzing trace with hash -1538531309, now seen corresponding path program 30 times [2018-09-26 08:20:02,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:02,614 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:02,615 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:02,615 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-09-26 08:20:02,615 INFO L459 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-09-26 08:20:02,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-09-26 08:20:02,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:02,617 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-09-26 08:20:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:02,840 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-09-26 08:20:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-09-26 08:20:02,840 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-09-26 08:20:02,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:02,841 INFO L225 Difference]: With dead ends: 69 [2018-09-26 08:20:02,841 INFO L226 Difference]: Without dead ends: 67 [2018-09-26 08:20:02,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-09-26 08:20:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-09-26 08:20:02,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-09-26 08:20:02,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-09-26 08:20:02,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-09-26 08:20:02,849 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-09-26 08:20:02,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:02,849 INFO L480 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-09-26 08:20:02,849 INFO L481 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-09-26 08:20:02,849 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-09-26 08:20:02,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-09-26 08:20:02,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:02,850 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-09-26 08:20:02,851 INFO L423 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:02,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:02,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1059786035, now seen corresponding path program 31 times [2018-09-26 08:20:02,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:02,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,057 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:03,057 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,058 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-09-26 08:20:03,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-09-26 08:20:03,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-09-26 08:20:03,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:03,059 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-09-26 08:20:03,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,286 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-09-26 08:20:03,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-09-26 08:20:03,287 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-09-26 08:20:03,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,288 INFO L225 Difference]: With dead ends: 71 [2018-09-26 08:20:03,288 INFO L226 Difference]: Without dead ends: 69 [2018-09-26 08:20:03,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-09-26 08:20:03,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-09-26 08:20:03,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-09-26 08:20:03,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-09-26 08:20:03,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-09-26 08:20:03,295 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-09-26 08:20:03,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,295 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-09-26 08:20:03,296 INFO L481 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-09-26 08:20:03,296 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-09-26 08:20:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-09-26 08:20:03,296 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,296 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-09-26 08:20:03,297 INFO L423 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,297 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,297 INFO L82 PathProgramCache]: Analyzing trace with hash -547078393, now seen corresponding path program 32 times [2018-09-26 08:20:03,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:03,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-09-26 08:20:03,517 INFO L459 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-09-26 08:20:03,517 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-09-26 08:20:03,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:03,518 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-09-26 08:20:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:03,751 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-09-26 08:20:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-09-26 08:20:03,751 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-09-26 08:20:03,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:03,752 INFO L225 Difference]: With dead ends: 73 [2018-09-26 08:20:03,752 INFO L226 Difference]: Without dead ends: 71 [2018-09-26 08:20:03,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-09-26 08:20:03,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-09-26 08:20:03,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-09-26 08:20:03,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-09-26 08:20:03,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-09-26 08:20:03,760 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-09-26 08:20:03,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:03,760 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-09-26 08:20:03,760 INFO L481 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-09-26 08:20:03,760 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-09-26 08:20:03,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-09-26 08:20:03,761 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:03,761 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-09-26 08:20:03,761 INFO L423 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:03,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:03,762 INFO L82 PathProgramCache]: Analyzing trace with hash -1756273471, now seen corresponding path program 33 times [2018-09-26 08:20:03,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:03,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:03,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:03,975 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:03,975 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-09-26 08:20:03,976 INFO L459 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-09-26 08:20:03,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-09-26 08:20:03,977 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:03,977 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-09-26 08:20:04,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,230 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-09-26 08:20:04,230 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-09-26 08:20:04,230 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-09-26 08:20:04,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,231 INFO L225 Difference]: With dead ends: 75 [2018-09-26 08:20:04,231 INFO L226 Difference]: Without dead ends: 73 [2018-09-26 08:20:04,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-09-26 08:20:04,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-09-26 08:20:04,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-09-26 08:20:04,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-09-26 08:20:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-09-26 08:20:04,239 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-09-26 08:20:04,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,239 INFO L480 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-09-26 08:20:04,239 INFO L481 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-09-26 08:20:04,239 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-09-26 08:20:04,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-09-26 08:20:04,240 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,240 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-09-26 08:20:04,240 INFO L423 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,241 INFO L82 PathProgramCache]: Analyzing trace with hash 143393787, now seen corresponding path program 34 times [2018-09-26 08:20:04,241 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:04,469 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,469 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-09-26 08:20:04,470 INFO L459 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-09-26 08:20:04,470 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-09-26 08:20:04,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:04,471 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-09-26 08:20:04,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:04,741 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-09-26 08:20:04,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-09-26 08:20:04,741 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-09-26 08:20:04,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:04,742 INFO L225 Difference]: With dead ends: 77 [2018-09-26 08:20:04,742 INFO L226 Difference]: Without dead ends: 75 [2018-09-26 08:20:04,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-09-26 08:20:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-09-26 08:20:04,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-09-26 08:20:04,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-09-26 08:20:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-09-26 08:20:04,750 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-09-26 08:20:04,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:04,750 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-09-26 08:20:04,750 INFO L481 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-09-26 08:20:04,750 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-09-26 08:20:04,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-09-26 08:20:04,751 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:04,751 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-09-26 08:20:04,752 INFO L423 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:04,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:04,752 INFO L82 PathProgramCache]: Analyzing trace with hash 362527925, now seen corresponding path program 35 times [2018-09-26 08:20:04,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:04,982 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:04,983 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:04,983 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-09-26 08:20:04,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-09-26 08:20:04,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-09-26 08:20:04,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:04,985 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-09-26 08:20:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,263 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-09-26 08:20:05,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-09-26 08:20:05,263 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-09-26 08:20:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,264 INFO L225 Difference]: With dead ends: 79 [2018-09-26 08:20:05,264 INFO L226 Difference]: Without dead ends: 77 [2018-09-26 08:20:05,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-09-26 08:20:05,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-09-26 08:20:05,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-09-26 08:20:05,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-09-26 08:20:05,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-09-26 08:20:05,272 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-09-26 08:20:05,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,272 INFO L480 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-09-26 08:20:05,272 INFO L481 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-09-26 08:20:05,272 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-09-26 08:20:05,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-09-26 08:20:05,273 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,273 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-09-26 08:20:05,274 INFO L423 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,274 INFO L82 PathProgramCache]: Analyzing trace with hash 497037039, now seen corresponding path program 36 times [2018-09-26 08:20:05,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:05,559 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:05,560 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:05,560 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-09-26 08:20:05,560 INFO L459 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-09-26 08:20:05,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-09-26 08:20:05,562 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:05,562 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-09-26 08:20:05,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:05,888 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-09-26 08:20:05,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-09-26 08:20:05,888 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-09-26 08:20:05,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:05,889 INFO L225 Difference]: With dead ends: 81 [2018-09-26 08:20:05,889 INFO L226 Difference]: Without dead ends: 79 [2018-09-26 08:20:05,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-09-26 08:20:05,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-09-26 08:20:05,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-09-26 08:20:05,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-09-26 08:20:05,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-09-26 08:20:05,899 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-09-26 08:20:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:05,899 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-09-26 08:20:05,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-09-26 08:20:05,899 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-09-26 08:20:05,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-09-26 08:20:05,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:05,901 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-09-26 08:20:05,901 INFO L423 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:05,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:05,901 INFO L82 PathProgramCache]: Analyzing trace with hash 911276713, now seen corresponding path program 37 times [2018-09-26 08:20:05,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:05,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,208 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:06,208 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,208 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-09-26 08:20:06,209 INFO L459 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-09-26 08:20:06,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-09-26 08:20:06,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:06,210 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-09-26 08:20:06,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:06,505 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-09-26 08:20:06,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-09-26 08:20:06,505 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-09-26 08:20:06,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:06,506 INFO L225 Difference]: With dead ends: 83 [2018-09-26 08:20:06,506 INFO L226 Difference]: Without dead ends: 81 [2018-09-26 08:20:06,508 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-09-26 08:20:06,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-09-26 08:20:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-09-26 08:20:06,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-09-26 08:20:06,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-09-26 08:20:06,517 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-09-26 08:20:06,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:06,518 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-09-26 08:20:06,518 INFO L481 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-09-26 08:20:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-09-26 08:20:06,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-09-26 08:20:06,519 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:06,519 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-09-26 08:20:06,519 INFO L423 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:06,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:06,520 INFO L82 PathProgramCache]: Analyzing trace with hash -436355101, now seen corresponding path program 38 times [2018-09-26 08:20:06,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:06,763 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:06,764 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:06,764 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-09-26 08:20:06,764 INFO L459 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-09-26 08:20:06,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-09-26 08:20:06,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:06,766 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-09-26 08:20:07,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,057 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-09-26 08:20:07,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-09-26 08:20:07,058 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-09-26 08:20:07,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,058 INFO L225 Difference]: With dead ends: 85 [2018-09-26 08:20:07,059 INFO L226 Difference]: Without dead ends: 83 [2018-09-26 08:20:07,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-09-26 08:20:07,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-09-26 08:20:07,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-09-26 08:20:07,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-09-26 08:20:07,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-09-26 08:20:07,067 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-09-26 08:20:07,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,067 INFO L480 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-09-26 08:20:07,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-09-26 08:20:07,067 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-09-26 08:20:07,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-09-26 08:20:07,068 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,068 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-09-26 08:20:07,069 INFO L423 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,069 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,069 INFO L82 PathProgramCache]: Analyzing trace with hash 1569595037, now seen corresponding path program 39 times [2018-09-26 08:20:07,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,320 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:07,320 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,320 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-09-26 08:20:07,321 INFO L459 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-09-26 08:20:07,321 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-09-26 08:20:07,322 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:07,322 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-09-26 08:20:07,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:07,611 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-09-26 08:20:07,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-09-26 08:20:07,612 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-09-26 08:20:07,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:07,612 INFO L225 Difference]: With dead ends: 87 [2018-09-26 08:20:07,613 INFO L226 Difference]: Without dead ends: 85 [2018-09-26 08:20:07,614 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-09-26 08:20:07,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-09-26 08:20:07,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-09-26 08:20:07,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-09-26 08:20:07,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-09-26 08:20:07,621 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-09-26 08:20:07,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:07,622 INFO L480 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-09-26 08:20:07,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-09-26 08:20:07,622 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-09-26 08:20:07,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-09-26 08:20:07,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:07,623 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-09-26 08:20:07,623 INFO L423 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:07,623 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:07,624 INFO L82 PathProgramCache]: Analyzing trace with hash 847361751, now seen corresponding path program 40 times [2018-09-26 08:20:07,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:07,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:07,892 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:07,892 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:07,893 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-09-26 08:20:07,893 INFO L459 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-09-26 08:20:07,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-09-26 08:20:07,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:07,895 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-09-26 08:20:08,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,206 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-09-26 08:20:08,206 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-09-26 08:20:08,206 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-09-26 08:20:08,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,207 INFO L225 Difference]: With dead ends: 89 [2018-09-26 08:20:08,207 INFO L226 Difference]: Without dead ends: 87 [2018-09-26 08:20:08,209 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-09-26 08:20:08,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-09-26 08:20:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-09-26 08:20:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-09-26 08:20:08,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-09-26 08:20:08,217 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-09-26 08:20:08,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,217 INFO L480 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-09-26 08:20:08,217 INFO L481 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-09-26 08:20:08,217 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-09-26 08:20:08,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-09-26 08:20:08,218 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,218 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-09-26 08:20:08,219 INFO L423 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1729091439, now seen corresponding path program 41 times [2018-09-26 08:20:08,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:08,508 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:08,508 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-09-26 08:20:08,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-09-26 08:20:08,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-09-26 08:20:08,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:08,510 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-09-26 08:20:08,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:08,825 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-09-26 08:20:08,826 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-09-26 08:20:08,826 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-09-26 08:20:08,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:08,827 INFO L225 Difference]: With dead ends: 91 [2018-09-26 08:20:08,827 INFO L226 Difference]: Without dead ends: 89 [2018-09-26 08:20:08,828 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-09-26 08:20:08,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-09-26 08:20:08,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-09-26 08:20:08,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-09-26 08:20:08,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-09-26 08:20:08,835 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-09-26 08:20:08,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:08,836 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-09-26 08:20:08,836 INFO L481 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-09-26 08:20:08,836 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-09-26 08:20:08,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-09-26 08:20:08,837 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:08,837 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-09-26 08:20:08,837 INFO L423 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:08,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:08,838 INFO L82 PathProgramCache]: Analyzing trace with hash 495522763, now seen corresponding path program 42 times [2018-09-26 08:20:08,838 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:08,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:09,124 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:09,124 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:09,125 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-09-26 08:20:09,125 INFO L459 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-09-26 08:20:09,125 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-09-26 08:20:09,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:09,127 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-09-26 08:20:09,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:09,483 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-09-26 08:20:09,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-09-26 08:20:09,483 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-09-26 08:20:09,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:09,484 INFO L225 Difference]: With dead ends: 93 [2018-09-26 08:20:09,484 INFO L226 Difference]: Without dead ends: 91 [2018-09-26 08:20:09,488 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-09-26 08:20:09,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-09-26 08:20:09,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-09-26 08:20:09,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-09-26 08:20:09,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-09-26 08:20:09,498 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-09-26 08:20:09,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:09,499 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-09-26 08:20:09,499 INFO L481 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-09-26 08:20:09,499 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-09-26 08:20:09,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-09-26 08:20:09,500 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:09,500 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-09-26 08:20:09,501 INFO L423 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:09,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:09,501 INFO L82 PathProgramCache]: Analyzing trace with hash -543942523, now seen corresponding path program 43 times [2018-09-26 08:20:09,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:09,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:09,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:09,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:09,845 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-09-26 08:20:09,845 INFO L459 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-09-26 08:20:09,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-09-26 08:20:09,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:09,847 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-09-26 08:20:10,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:10,212 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-09-26 08:20:10,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-09-26 08:20:10,212 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-09-26 08:20:10,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:10,213 INFO L225 Difference]: With dead ends: 95 [2018-09-26 08:20:10,213 INFO L226 Difference]: Without dead ends: 93 [2018-09-26 08:20:10,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-09-26 08:20:10,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-09-26 08:20:10,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-09-26 08:20:10,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-09-26 08:20:10,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-09-26 08:20:10,223 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-09-26 08:20:10,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,223 INFO L480 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-09-26 08:20:10,223 INFO L481 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-09-26 08:20:10,224 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-09-26 08:20:10,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-09-26 08:20:10,224 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,225 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-09-26 08:20:10,225 INFO L423 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1257297599, now seen corresponding path program 44 times [2018-09-26 08:20:10,226 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:10,515 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:10,516 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:10,516 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-09-26 08:20:10,516 INFO L459 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-09-26 08:20:10,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-09-26 08:20:10,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:10,517 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-09-26 08:20:10,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:10,847 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-09-26 08:20:10,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-09-26 08:20:10,847 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-09-26 08:20:10,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:10,848 INFO L225 Difference]: With dead ends: 97 [2018-09-26 08:20:10,848 INFO L226 Difference]: Without dead ends: 95 [2018-09-26 08:20:10,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-09-26 08:20:10,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-09-26 08:20:10,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-09-26 08:20:10,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-09-26 08:20:10,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-09-26 08:20:10,856 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-09-26 08:20:10,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:10,857 INFO L480 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-09-26 08:20:10,857 INFO L481 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-09-26 08:20:10,857 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-09-26 08:20:10,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-09-26 08:20:10,858 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:10,858 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-09-26 08:20:10,858 INFO L423 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:10,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:10,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1377234553, now seen corresponding path program 45 times [2018-09-26 08:20:10,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:10,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:11,128 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,128 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-09-26 08:20:11,129 INFO L459 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-09-26 08:20:11,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-09-26 08:20:11,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:11,130 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-09-26 08:20:11,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:11,462 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-09-26 08:20:11,462 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-09-26 08:20:11,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-09-26 08:20:11,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:11,466 INFO L225 Difference]: With dead ends: 99 [2018-09-26 08:20:11,466 INFO L226 Difference]: Without dead ends: 97 [2018-09-26 08:20:11,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-09-26 08:20:11,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-09-26 08:20:11,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-09-26 08:20:11,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-09-26 08:20:11,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-09-26 08:20:11,476 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-09-26 08:20:11,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:11,476 INFO L480 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-09-26 08:20:11,476 INFO L481 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-09-26 08:20:11,476 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-09-26 08:20:11,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-09-26 08:20:11,478 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:11,478 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-09-26 08:20:11,478 INFO L423 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:11,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:11,479 INFO L82 PathProgramCache]: Analyzing trace with hash 672530355, now seen corresponding path program 46 times [2018-09-26 08:20:11,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:11,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:11,784 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:11,785 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:11,785 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-09-26 08:20:11,785 INFO L459 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-09-26 08:20:11,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-09-26 08:20:11,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:11,787 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-09-26 08:20:12,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:12,140 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-09-26 08:20:12,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-09-26 08:20:12,141 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-09-26 08:20:12,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:12,142 INFO L225 Difference]: With dead ends: 101 [2018-09-26 08:20:12,142 INFO L226 Difference]: Without dead ends: 99 [2018-09-26 08:20:12,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-09-26 08:20:12,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-09-26 08:20:12,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-09-26 08:20:12,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-09-26 08:20:12,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-09-26 08:20:12,154 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-09-26 08:20:12,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:12,154 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-09-26 08:20:12,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-09-26 08:20:12,155 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-09-26 08:20:12,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-09-26 08:20:12,156 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:12,156 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-09-26 08:20:12,156 INFO L423 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:12,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:12,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2056628845, now seen corresponding path program 47 times [2018-09-26 08:20:12,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:12,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:12,456 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:12,456 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-09-26 08:20:12,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-09-26 08:20:12,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-09-26 08:20:12,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:12,458 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-09-26 08:20:12,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:12,815 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-09-26 08:20:12,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-09-26 08:20:12,815 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-09-26 08:20:12,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:12,816 INFO L225 Difference]: With dead ends: 103 [2018-09-26 08:20:12,816 INFO L226 Difference]: Without dead ends: 101 [2018-09-26 08:20:12,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-09-26 08:20:12,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-09-26 08:20:12,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-09-26 08:20:12,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-09-26 08:20:12,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-09-26 08:20:12,826 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-09-26 08:20:12,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:12,827 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-09-26 08:20:12,827 INFO L481 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-09-26 08:20:12,827 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-09-26 08:20:12,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-09-26 08:20:12,828 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:12,828 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-09-26 08:20:12,828 INFO L423 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:12,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:12,829 INFO L82 PathProgramCache]: Analyzing trace with hash 735415975, now seen corresponding path program 48 times [2018-09-26 08:20:12,829 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:12,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:13,132 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:13,133 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:13,133 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-09-26 08:20:13,133 INFO L459 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-09-26 08:20:13,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-09-26 08:20:13,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:13,134 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-09-26 08:20:13,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:13,525 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-09-26 08:20:13,525 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-09-26 08:20:13,526 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-09-26 08:20:13,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:13,527 INFO L225 Difference]: With dead ends: 105 [2018-09-26 08:20:13,527 INFO L226 Difference]: Without dead ends: 103 [2018-09-26 08:20:13,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-09-26 08:20:13,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-09-26 08:20:13,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-09-26 08:20:13,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-09-26 08:20:13,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-09-26 08:20:13,537 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-09-26 08:20:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:13,538 INFO L480 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-09-26 08:20:13,538 INFO L481 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-09-26 08:20:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-09-26 08:20:13,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-09-26 08:20:13,539 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:13,539 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-09-26 08:20:13,539 INFO L423 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:13,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:13,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1934799775, now seen corresponding path program 49 times [2018-09-26 08:20:13,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:13,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:13,867 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:13,867 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:13,867 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-09-26 08:20:13,868 INFO L459 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-09-26 08:20:13,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-09-26 08:20:13,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:13,870 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-09-26 08:20:14,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:14,244 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-09-26 08:20:14,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-09-26 08:20:14,245 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-09-26 08:20:14,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:14,246 INFO L225 Difference]: With dead ends: 107 [2018-09-26 08:20:14,246 INFO L226 Difference]: Without dead ends: 105 [2018-09-26 08:20:14,247 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-09-26 08:20:14,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-09-26 08:20:14,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-09-26 08:20:14,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-09-26 08:20:14,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-09-26 08:20:14,255 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-09-26 08:20:14,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:14,256 INFO L480 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-09-26 08:20:14,256 INFO L481 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-09-26 08:20:14,256 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-09-26 08:20:14,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-09-26 08:20:14,257 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:14,257 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-09-26 08:20:14,257 INFO L423 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:14,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:14,258 INFO L82 PathProgramCache]: Analyzing trace with hash 378307483, now seen corresponding path program 50 times [2018-09-26 08:20:14,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:14,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:14,536 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:14,536 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:14,537 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-09-26 08:20:14,537 INFO L459 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-09-26 08:20:14,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-09-26 08:20:14,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:14,539 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-09-26 08:20:14,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:14,904 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-09-26 08:20:14,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-09-26 08:20:14,904 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-09-26 08:20:14,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:14,906 INFO L225 Difference]: With dead ends: 109 [2018-09-26 08:20:14,906 INFO L226 Difference]: Without dead ends: 107 [2018-09-26 08:20:14,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-09-26 08:20:14,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-09-26 08:20:14,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-09-26 08:20:14,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-09-26 08:20:14,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-09-26 08:20:14,920 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-09-26 08:20:14,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:14,920 INFO L480 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-09-26 08:20:14,920 INFO L481 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-09-26 08:20:14,921 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-09-26 08:20:14,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-09-26 08:20:14,922 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:14,922 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-09-26 08:20:14,922 INFO L423 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:14,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:14,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1518676907, now seen corresponding path program 51 times [2018-09-26 08:20:14,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:14,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:15,228 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,228 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-09-26 08:20:15,229 INFO L459 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-09-26 08:20:15,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-09-26 08:20:15,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:15,230 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-09-26 08:20:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:15,611 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-09-26 08:20:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-09-26 08:20:15,611 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-09-26 08:20:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:15,612 INFO L225 Difference]: With dead ends: 111 [2018-09-26 08:20:15,612 INFO L226 Difference]: Without dead ends: 109 [2018-09-26 08:20:15,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-09-26 08:20:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-09-26 08:20:15,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-09-26 08:20:15,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-09-26 08:20:15,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-09-26 08:20:15,622 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-09-26 08:20:15,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:15,623 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-09-26 08:20:15,623 INFO L481 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-09-26 08:20:15,623 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-09-26 08:20:15,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-09-26 08:20:15,624 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:15,624 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-09-26 08:20:15,624 INFO L423 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:15,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:15,625 INFO L82 PathProgramCache]: Analyzing trace with hash 840425103, now seen corresponding path program 52 times [2018-09-26 08:20:15,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:15,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:15,917 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-09-26 08:20:15,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-09-26 08:20:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-09-26 08:20:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:15,919 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-09-26 08:20:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:16,299 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-09-26 08:20:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-09-26 08:20:16,300 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-09-26 08:20:16,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:16,301 INFO L225 Difference]: With dead ends: 113 [2018-09-26 08:20:16,301 INFO L226 Difference]: Without dead ends: 111 [2018-09-26 08:20:16,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-09-26 08:20:16,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-09-26 08:20:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-09-26 08:20:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-09-26 08:20:16,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-09-26 08:20:16,310 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-09-26 08:20:16,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:16,311 INFO L480 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-09-26 08:20:16,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-09-26 08:20:16,311 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-09-26 08:20:16,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-09-26 08:20:16,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:16,312 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-09-26 08:20:16,312 INFO L423 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:16,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:16,313 INFO L82 PathProgramCache]: Analyzing trace with hash 194724425, now seen corresponding path program 53 times [2018-09-26 08:20:16,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:16,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:16,676 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:16,677 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-09-26 08:20:16,677 INFO L459 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-09-26 08:20:16,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-09-26 08:20:16,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:16,678 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-09-26 08:20:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:17,074 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-09-26 08:20:17,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-09-26 08:20:17,074 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-09-26 08:20:17,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:17,076 INFO L225 Difference]: With dead ends: 115 [2018-09-26 08:20:17,076 INFO L226 Difference]: Without dead ends: 113 [2018-09-26 08:20:17,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-09-26 08:20:17,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-09-26 08:20:17,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-09-26 08:20:17,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-09-26 08:20:17,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-09-26 08:20:17,085 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-09-26 08:20:17,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:17,085 INFO L480 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-09-26 08:20:17,085 INFO L481 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-09-26 08:20:17,085 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-09-26 08:20:17,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-09-26 08:20:17,086 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:17,086 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-09-26 08:20:17,087 INFO L423 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:17,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:17,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1848336509, now seen corresponding path program 54 times [2018-09-26 08:20:17,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:17,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:17,361 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:17,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:17,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-09-26 08:20:17,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-09-26 08:20:17,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-09-26 08:20:17,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:17,363 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-09-26 08:20:17,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:17,731 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-09-26 08:20:17,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-09-26 08:20:17,731 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-09-26 08:20:17,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:17,732 INFO L225 Difference]: With dead ends: 117 [2018-09-26 08:20:17,733 INFO L226 Difference]: Without dead ends: 115 [2018-09-26 08:20:17,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-09-26 08:20:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-09-26 08:20:17,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-09-26 08:20:17,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-09-26 08:20:17,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-09-26 08:20:17,743 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-09-26 08:20:17,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:17,743 INFO L480 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-09-26 08:20:17,743 INFO L481 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-09-26 08:20:17,743 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-09-26 08:20:17,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-09-26 08:20:17,744 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:17,744 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-09-26 08:20:17,745 INFO L423 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:17,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:17,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1865127485, now seen corresponding path program 55 times [2018-09-26 08:20:17,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:18,050 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,050 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-09-26 08:20:18,051 INFO L459 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-09-26 08:20:18,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-09-26 08:20:18,051 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:18,052 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-09-26 08:20:18,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:18,428 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-09-26 08:20:18,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-09-26 08:20:18,428 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-09-26 08:20:18,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:18,429 INFO L225 Difference]: With dead ends: 119 [2018-09-26 08:20:18,430 INFO L226 Difference]: Without dead ends: 117 [2018-09-26 08:20:18,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-09-26 08:20:18,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-09-26 08:20:18,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-09-26 08:20:18,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-09-26 08:20:18,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-09-26 08:20:18,438 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-09-26 08:20:18,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:18,439 INFO L480 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-09-26 08:20:18,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-09-26 08:20:18,439 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-09-26 08:20:18,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-09-26 08:20:18,440 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:18,440 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-09-26 08:20:18,440 INFO L423 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:18,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:18,441 INFO L82 PathProgramCache]: Analyzing trace with hash 1386202743, now seen corresponding path program 56 times [2018-09-26 08:20:18,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:18,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:18,740 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:18,743 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:18,743 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-09-26 08:20:18,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-09-26 08:20:18,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-09-26 08:20:18,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:18,745 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-09-26 08:20:19,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,119 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-09-26 08:20:19,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-09-26 08:20:19,120 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-09-26 08:20:19,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,121 INFO L225 Difference]: With dead ends: 121 [2018-09-26 08:20:19,121 INFO L226 Difference]: Without dead ends: 119 [2018-09-26 08:20:19,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-09-26 08:20:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-09-26 08:20:19,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-09-26 08:20:19,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-09-26 08:20:19,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-09-26 08:20:19,129 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-09-26 08:20:19,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,130 INFO L480 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-09-26 08:20:19,130 INFO L481 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-09-26 08:20:19,130 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-09-26 08:20:19,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-09-26 08:20:19,131 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,131 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-09-26 08:20:19,131 INFO L423 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,132 INFO L82 PathProgramCache]: Analyzing trace with hash 701026353, now seen corresponding path program 57 times [2018-09-26 08:20:19,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:19,451 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:19,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:19,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-09-26 08:20:19,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-09-26 08:20:19,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-09-26 08:20:19,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:19,453 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-09-26 08:20:19,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:19,852 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-09-26 08:20:19,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-09-26 08:20:19,852 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-09-26 08:20:19,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:19,853 INFO L225 Difference]: With dead ends: 123 [2018-09-26 08:20:19,854 INFO L226 Difference]: Without dead ends: 121 [2018-09-26 08:20:19,854 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-09-26 08:20:19,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-09-26 08:20:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-09-26 08:20:19,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-09-26 08:20:19,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-09-26 08:20:19,863 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-09-26 08:20:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:19,864 INFO L480 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-09-26 08:20:19,864 INFO L481 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-09-26 08:20:19,864 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-09-26 08:20:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-09-26 08:20:19,865 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:19,865 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-09-26 08:20:19,866 INFO L423 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:19,866 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:19,866 INFO L82 PathProgramCache]: Analyzing trace with hash -623488149, now seen corresponding path program 58 times [2018-09-26 08:20:19,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:19,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,163 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:20,163 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,163 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-09-26 08:20:20,164 INFO L459 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-09-26 08:20:20,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-09-26 08:20:20,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:20,165 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-09-26 08:20:20,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:20,550 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-09-26 08:20:20,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-09-26 08:20:20,550 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-09-26 08:20:20,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:20,551 INFO L225 Difference]: With dead ends: 125 [2018-09-26 08:20:20,551 INFO L226 Difference]: Without dead ends: 123 [2018-09-26 08:20:20,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-09-26 08:20:20,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-09-26 08:20:20,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-09-26 08:20:20,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-09-26 08:20:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-09-26 08:20:20,560 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-09-26 08:20:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:20,560 INFO L480 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-09-26 08:20:20,560 INFO L481 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-09-26 08:20:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-09-26 08:20:20,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-09-26 08:20:20,562 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:20,562 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-09-26 08:20:20,562 INFO L423 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:20,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:20,562 INFO L82 PathProgramCache]: Analyzing trace with hash 2123362341, now seen corresponding path program 59 times [2018-09-26 08:20:20,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:20,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:20,891 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:20,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:20,892 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-09-26 08:20:20,892 INFO L459 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-09-26 08:20:20,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-09-26 08:20:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:20,893 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-09-26 08:20:21,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:21,326 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-09-26 08:20:21,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-09-26 08:20:21,327 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-09-26 08:20:21,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:21,328 INFO L225 Difference]: With dead ends: 127 [2018-09-26 08:20:21,328 INFO L226 Difference]: Without dead ends: 125 [2018-09-26 08:20:21,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-09-26 08:20:21,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-09-26 08:20:21,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-09-26 08:20:21,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-09-26 08:20:21,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-09-26 08:20:21,337 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-09-26 08:20:21,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:21,338 INFO L480 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-09-26 08:20:21,338 INFO L481 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-09-26 08:20:21,338 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-09-26 08:20:21,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-09-26 08:20:21,339 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:21,339 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-09-26 08:20:21,340 INFO L423 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:21,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:21,340 INFO L82 PathProgramCache]: Analyzing trace with hash 441796191, now seen corresponding path program 60 times [2018-09-26 08:20:21,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:21,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:21,701 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:21,702 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:21,702 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-09-26 08:20:21,702 INFO L459 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-09-26 08:20:21,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-09-26 08:20:21,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:21,704 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-09-26 08:20:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:22,137 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-09-26 08:20:22,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-09-26 08:20:22,137 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-09-26 08:20:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:22,138 INFO L225 Difference]: With dead ends: 129 [2018-09-26 08:20:22,138 INFO L226 Difference]: Without dead ends: 127 [2018-09-26 08:20:22,139 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-09-26 08:20:22,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-09-26 08:20:22,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-09-26 08:20:22,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-09-26 08:20:22,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-09-26 08:20:22,146 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-09-26 08:20:22,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:22,146 INFO L480 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-09-26 08:20:22,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-09-26 08:20:22,147 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-09-26 08:20:22,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-09-26 08:20:22,148 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:22,148 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-09-26 08:20:22,148 INFO L423 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:22,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:22,149 INFO L82 PathProgramCache]: Analyzing trace with hash -635570663, now seen corresponding path program 61 times [2018-09-26 08:20:22,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:22,439 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:22,440 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:22,440 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-09-26 08:20:22,440 INFO L459 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-09-26 08:20:22,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-09-26 08:20:22,442 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:22,443 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-09-26 08:20:22,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:22,857 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-09-26 08:20:22,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-09-26 08:20:22,857 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-09-26 08:20:22,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:22,859 INFO L225 Difference]: With dead ends: 131 [2018-09-26 08:20:22,859 INFO L226 Difference]: Without dead ends: 129 [2018-09-26 08:20:22,860 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-09-26 08:20:22,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-09-26 08:20:22,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-09-26 08:20:22,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-09-26 08:20:22,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-09-26 08:20:22,869 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-09-26 08:20:22,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:22,870 INFO L480 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-09-26 08:20:22,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-09-26 08:20:22,870 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-09-26 08:20:22,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-09-26 08:20:22,871 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:22,872 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-09-26 08:20:22,872 INFO L423 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:22,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:22,872 INFO L82 PathProgramCache]: Analyzing trace with hash -897999021, now seen corresponding path program 62 times [2018-09-26 08:20:22,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:22,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:23,279 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:23,279 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:23,279 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-09-26 08:20:23,280 INFO L459 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-09-26 08:20:23,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-09-26 08:20:23,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:23,281 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-09-26 08:20:23,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:23,636 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-09-26 08:20:23,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-09-26 08:20:23,636 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-09-26 08:20:23,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:23,637 INFO L225 Difference]: With dead ends: 133 [2018-09-26 08:20:23,637 INFO L226 Difference]: Without dead ends: 131 [2018-09-26 08:20:23,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-09-26 08:20:23,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-09-26 08:20:23,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-09-26 08:20:23,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-09-26 08:20:23,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-09-26 08:20:23,646 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-09-26 08:20:23,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:23,647 INFO L480 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-09-26 08:20:23,647 INFO L481 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-09-26 08:20:23,647 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-09-26 08:20:23,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-09-26 08:20:23,648 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:23,649 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-09-26 08:20:23,651 INFO L423 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:23,651 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:23,651 INFO L82 PathProgramCache]: Analyzing trace with hash 311419405, now seen corresponding path program 63 times [2018-09-26 08:20:23,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:23,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:23,996 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:23,996 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:23,996 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-09-26 08:20:23,997 INFO L459 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-09-26 08:20:23,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-09-26 08:20:23,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:23,998 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-09-26 08:20:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:24,412 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-09-26 08:20:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-09-26 08:20:24,413 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-09-26 08:20:24,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:24,414 INFO L225 Difference]: With dead ends: 135 [2018-09-26 08:20:24,414 INFO L226 Difference]: Without dead ends: 133 [2018-09-26 08:20:24,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-09-26 08:20:24,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-09-26 08:20:24,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-09-26 08:20:24,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-09-26 08:20:24,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-09-26 08:20:24,432 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-09-26 08:20:24,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:24,432 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-09-26 08:20:24,432 INFO L481 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-09-26 08:20:24,433 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-09-26 08:20:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-09-26 08:20:24,434 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:24,434 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-09-26 08:20:24,435 INFO L423 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:24,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1373610425, now seen corresponding path program 64 times [2018-09-26 08:20:24,435 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:24,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:24,739 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:24,740 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:24,740 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-09-26 08:20:24,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-09-26 08:20:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-09-26 08:20:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:24,741 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-09-26 08:20:25,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,068 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-09-26 08:20:25,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-09-26 08:20:25,068 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-09-26 08:20:25,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,069 INFO L225 Difference]: With dead ends: 137 [2018-09-26 08:20:25,069 INFO L226 Difference]: Without dead ends: 135 [2018-09-26 08:20:25,070 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-09-26 08:20:25,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-09-26 08:20:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-09-26 08:20:25,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-09-26 08:20:25,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-09-26 08:20:25,078 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-09-26 08:20:25,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,079 INFO L480 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-09-26 08:20:25,079 INFO L481 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-09-26 08:20:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-09-26 08:20:25,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-09-26 08:20:25,080 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,080 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-09-26 08:20:25,080 INFO L423 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,085 INFO L82 PathProgramCache]: Analyzing trace with hash -1484606463, now seen corresponding path program 65 times [2018-09-26 08:20:25,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:25,457 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:25,457 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:25,457 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-09-26 08:20:25,458 INFO L459 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-09-26 08:20:25,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-09-26 08:20:25,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:25,459 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-09-26 08:20:25,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:25,803 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-09-26 08:20:25,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-09-26 08:20:25,804 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-09-26 08:20:25,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:25,805 INFO L225 Difference]: With dead ends: 139 [2018-09-26 08:20:25,805 INFO L226 Difference]: Without dead ends: 137 [2018-09-26 08:20:25,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-09-26 08:20:25,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-09-26 08:20:25,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-09-26 08:20:25,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-09-26 08:20:25,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-09-26 08:20:25,814 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-09-26 08:20:25,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:25,814 INFO L480 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-09-26 08:20:25,814 INFO L481 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-09-26 08:20:25,814 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-09-26 08:20:25,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-09-26 08:20:25,815 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:25,815 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-09-26 08:20:25,815 INFO L423 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:25,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:25,816 INFO L82 PathProgramCache]: Analyzing trace with hash -777616581, now seen corresponding path program 66 times [2018-09-26 08:20:25,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:25,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,184 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,184 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-09-26 08:20:26,184 INFO L459 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-09-26 08:20:26,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-09-26 08:20:26,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:26,185 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-09-26 08:20:26,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:26,536 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-09-26 08:20:26,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-09-26 08:20:26,536 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-09-26 08:20:26,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:26,538 INFO L225 Difference]: With dead ends: 141 [2018-09-26 08:20:26,538 INFO L226 Difference]: Without dead ends: 139 [2018-09-26 08:20:26,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-09-26 08:20:26,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-09-26 08:20:26,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-09-26 08:20:26,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-09-26 08:20:26,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-09-26 08:20:26,546 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-09-26 08:20:26,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:26,546 INFO L480 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-09-26 08:20:26,546 INFO L481 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-09-26 08:20:26,546 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-09-26 08:20:26,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-09-26 08:20:26,547 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:26,547 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-09-26 08:20:26,548 INFO L423 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:26,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:26,548 INFO L82 PathProgramCache]: Analyzing trace with hash 34827253, now seen corresponding path program 67 times [2018-09-26 08:20:26,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:26,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:26,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:26,933 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:26,933 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-09-26 08:20:26,934 INFO L459 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-09-26 08:20:26,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-09-26 08:20:26,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:26,935 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-09-26 08:20:27,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:27,299 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-09-26 08:20:27,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-09-26 08:20:27,300 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-09-26 08:20:27,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:27,301 INFO L225 Difference]: With dead ends: 143 [2018-09-26 08:20:27,301 INFO L226 Difference]: Without dead ends: 141 [2018-09-26 08:20:27,302 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-09-26 08:20:27,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-09-26 08:20:27,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-09-26 08:20:27,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-09-26 08:20:27,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-09-26 08:20:27,311 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-09-26 08:20:27,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:27,311 INFO L480 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-09-26 08:20:27,311 INFO L481 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-09-26 08:20:27,311 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-09-26 08:20:27,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-09-26 08:20:27,312 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:27,312 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-09-26 08:20:27,312 INFO L423 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:27,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:27,313 INFO L82 PathProgramCache]: Analyzing trace with hash -890696145, now seen corresponding path program 68 times [2018-09-26 08:20:27,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:27,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:27,723 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:27,723 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:27,723 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-09-26 08:20:27,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-09-26 08:20:27,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-09-26 08:20:27,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:27,725 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-09-26 08:20:28,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:28,269 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-09-26 08:20:28,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-09-26 08:20:28,269 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-09-26 08:20:28,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:28,271 INFO L225 Difference]: With dead ends: 145 [2018-09-26 08:20:28,271 INFO L226 Difference]: Without dead ends: 143 [2018-09-26 08:20:28,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-09-26 08:20:28,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-09-26 08:20:28,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-09-26 08:20:28,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-09-26 08:20:28,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-09-26 08:20:28,281 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-09-26 08:20:28,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:28,282 INFO L480 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-09-26 08:20:28,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-09-26 08:20:28,282 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-09-26 08:20:28,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-09-26 08:20:28,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:28,283 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-09-26 08:20:28,283 INFO L423 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:28,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:28,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1260451351, now seen corresponding path program 69 times [2018-09-26 08:20:28,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:28,618 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:28,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:28,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-09-26 08:20:28,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-09-26 08:20:28,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-09-26 08:20:28,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:28,620 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-09-26 08:20:29,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:29,054 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-09-26 08:20:29,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-09-26 08:20:29,055 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-09-26 08:20:29,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:29,056 INFO L225 Difference]: With dead ends: 147 [2018-09-26 08:20:29,056 INFO L226 Difference]: Without dead ends: 145 [2018-09-26 08:20:29,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-09-26 08:20:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-09-26 08:20:29,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-09-26 08:20:29,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-09-26 08:20:29,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-09-26 08:20:29,064 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-09-26 08:20:29,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,064 INFO L480 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-09-26 08:20:29,064 INFO L481 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-09-26 08:20:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-09-26 08:20:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-09-26 08:20:29,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,065 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-09-26 08:20:29,066 INFO L423 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash -112918749, now seen corresponding path program 70 times [2018-09-26 08:20:29,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:29,481 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:29,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:29,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-09-26 08:20:29,482 INFO L459 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-09-26 08:20:29,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-09-26 08:20:29,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:29,483 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-09-26 08:20:29,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:29,877 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-09-26 08:20:29,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-09-26 08:20:29,877 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-09-26 08:20:29,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:29,879 INFO L225 Difference]: With dead ends: 149 [2018-09-26 08:20:29,879 INFO L226 Difference]: Without dead ends: 147 [2018-09-26 08:20:29,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-09-26 08:20:29,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-09-26 08:20:29,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-09-26 08:20:29,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-09-26 08:20:29,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-09-26 08:20:29,887 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-09-26 08:20:29,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:29,888 INFO L480 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-09-26 08:20:29,888 INFO L481 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-09-26 08:20:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-09-26 08:20:29,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-09-26 08:20:29,889 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:29,889 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-09-26 08:20:29,889 INFO L423 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:29,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:29,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1140683299, now seen corresponding path program 71 times [2018-09-26 08:20:29,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:29,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:30,229 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:30,229 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:30,229 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-09-26 08:20:30,230 INFO L459 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-09-26 08:20:30,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-09-26 08:20:30,231 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:30,231 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-09-26 08:20:30,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:30,600 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-09-26 08:20:30,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-09-26 08:20:30,600 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-09-26 08:20:30,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:30,602 INFO L225 Difference]: With dead ends: 151 [2018-09-26 08:20:30,602 INFO L226 Difference]: Without dead ends: 149 [2018-09-26 08:20:30,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-09-26 08:20:30,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-09-26 08:20:30,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-09-26 08:20:30,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-09-26 08:20:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-09-26 08:20:30,609 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-09-26 08:20:30,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:30,610 INFO L480 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-09-26 08:20:30,610 INFO L481 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-09-26 08:20:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-09-26 08:20:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-09-26 08:20:30,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:30,611 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-09-26 08:20:30,611 INFO L423 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:30,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash -979937769, now seen corresponding path program 72 times [2018-09-26 08:20:30,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:30,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:30,916 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:30,916 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-09-26 08:20:30,917 INFO L459 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-09-26 08:20:30,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-09-26 08:20:30,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:20:30,917 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-09-26 08:20:31,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:31,321 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-09-26 08:20:31,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-09-26 08:20:31,322 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-09-26 08:20:31,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:31,323 INFO L225 Difference]: With dead ends: 153 [2018-09-26 08:20:31,323 INFO L226 Difference]: Without dead ends: 151 [2018-09-26 08:20:31,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-09-26 08:20:31,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-09-26 08:20:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-09-26 08:20:31,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-09-26 08:20:31,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-09-26 08:20:31,332 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-09-26 08:20:31,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:31,332 INFO L480 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-09-26 08:20:31,332 INFO L481 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-09-26 08:20:31,332 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-09-26 08:20:31,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-09-26 08:20:31,333 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:31,333 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-09-26 08:20:31,334 INFO L423 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:31,334 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:31,334 INFO L82 PathProgramCache]: Analyzing trace with hash -1122306095, now seen corresponding path program 73 times [2018-09-26 08:20:31,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:31,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:31,753 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:31,753 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:31,753 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-09-26 08:20:31,754 INFO L459 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-09-26 08:20:31,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-09-26 08:20:31,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:20:31,754 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-09-26 08:20:32,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:32,159 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-09-26 08:20:32,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-09-26 08:20:32,159 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-09-26 08:20:32,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:32,161 INFO L225 Difference]: With dead ends: 155 [2018-09-26 08:20:32,161 INFO L226 Difference]: Without dead ends: 153 [2018-09-26 08:20:32,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-09-26 08:20:32,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-09-26 08:20:32,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-09-26 08:20:32,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-09-26 08:20:32,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-09-26 08:20:32,169 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-09-26 08:20:32,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:32,169 INFO L480 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-09-26 08:20:32,169 INFO L481 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-09-26 08:20:32,169 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-09-26 08:20:32,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-09-26 08:20:32,170 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:32,170 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-09-26 08:20:32,171 INFO L423 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:32,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:32,171 INFO L82 PathProgramCache]: Analyzing trace with hash -499313909, now seen corresponding path program 74 times [2018-09-26 08:20:32,171 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:32,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:32,482 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:32,482 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-09-26 08:20:32,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-09-26 08:20:32,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-09-26 08:20:32,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:32,483 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-09-26 08:20:32,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:32,908 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-09-26 08:20:32,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-09-26 08:20:32,908 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-09-26 08:20:32,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:32,910 INFO L225 Difference]: With dead ends: 157 [2018-09-26 08:20:32,910 INFO L226 Difference]: Without dead ends: 155 [2018-09-26 08:20:32,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-09-26 08:20:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-09-26 08:20:32,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-09-26 08:20:32,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-09-26 08:20:32,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-09-26 08:20:32,919 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-09-26 08:20:32,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:32,919 INFO L480 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-09-26 08:20:32,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-09-26 08:20:32,919 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-09-26 08:20:32,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-09-26 08:20:32,920 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:32,920 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-09-26 08:20:32,920 INFO L423 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:32,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:32,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1195722693, now seen corresponding path program 75 times [2018-09-26 08:20:32,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:33,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:33,251 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:33,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-09-26 08:20:33,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-09-26 08:20:33,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-09-26 08:20:33,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:33,252 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-09-26 08:20:33,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:33,659 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-09-26 08:20:33,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-09-26 08:20:33,659 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-09-26 08:20:33,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:33,660 INFO L225 Difference]: With dead ends: 159 [2018-09-26 08:20:33,660 INFO L226 Difference]: Without dead ends: 157 [2018-09-26 08:20:33,661 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-09-26 08:20:33,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-09-26 08:20:33,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-09-26 08:20:33,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-09-26 08:20:33,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-09-26 08:20:33,670 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-09-26 08:20:33,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:33,670 INFO L480 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-09-26 08:20:33,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-09-26 08:20:33,670 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-09-26 08:20:33,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-09-26 08:20:33,671 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:33,671 INFO L375 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-09-26 08:20:33,672 INFO L423 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:33,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:33,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1961675265, now seen corresponding path program 76 times [2018-09-26 08:20:33,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,087 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,087 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,088 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-09-26 08:20:34,088 INFO L459 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-09-26 08:20:34,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-09-26 08:20:34,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:20:34,089 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-09-26 08:20:34,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:34,544 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-09-26 08:20:34,544 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-09-26 08:20:34,545 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-09-26 08:20:34,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:34,546 INFO L225 Difference]: With dead ends: 161 [2018-09-26 08:20:34,546 INFO L226 Difference]: Without dead ends: 159 [2018-09-26 08:20:34,546 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-09-26 08:20:34,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-09-26 08:20:34,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-09-26 08:20:34,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-09-26 08:20:34,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-09-26 08:20:34,554 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-09-26 08:20:34,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:34,555 INFO L480 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-09-26 08:20:34,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-09-26 08:20:34,555 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-09-26 08:20:34,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-09-26 08:20:34,555 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:34,556 INFO L375 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-09-26 08:20:34,556 INFO L423 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:34,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:34,556 INFO L82 PathProgramCache]: Analyzing trace with hash 320765369, now seen corresponding path program 77 times [2018-09-26 08:20:34,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:34,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:34,891 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:34,891 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-09-26 08:20:34,891 INFO L459 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-09-26 08:20:34,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-09-26 08:20:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:34,892 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-09-26 08:20:35,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:35,312 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-09-26 08:20:35,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-09-26 08:20:35,312 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-09-26 08:20:35,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:35,313 INFO L225 Difference]: With dead ends: 163 [2018-09-26 08:20:35,313 INFO L226 Difference]: Without dead ends: 161 [2018-09-26 08:20:35,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-09-26 08:20:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-09-26 08:20:35,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-09-26 08:20:35,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-09-26 08:20:35,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-09-26 08:20:35,323 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-09-26 08:20:35,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:35,324 INFO L480 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-09-26 08:20:35,324 INFO L481 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-09-26 08:20:35,324 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-09-26 08:20:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-09-26 08:20:35,325 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:35,325 INFO L375 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-09-26 08:20:35,325 INFO L423 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:35,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:35,325 INFO L82 PathProgramCache]: Analyzing trace with hash -982073613, now seen corresponding path program 78 times [2018-09-26 08:20:35,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:35,688 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:35,689 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:35,689 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-09-26 08:20:35,689 INFO L459 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-09-26 08:20:35,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-09-26 08:20:35,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:35,690 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-09-26 08:20:36,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,124 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-09-26 08:20:36,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-09-26 08:20:36,125 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-09-26 08:20:36,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,126 INFO L225 Difference]: With dead ends: 165 [2018-09-26 08:20:36,126 INFO L226 Difference]: Without dead ends: 163 [2018-09-26 08:20:36,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-09-26 08:20:36,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-09-26 08:20:36,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-09-26 08:20:36,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-09-26 08:20:36,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-09-26 08:20:36,136 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-09-26 08:20:36,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,136 INFO L480 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-09-26 08:20:36,136 INFO L481 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-09-26 08:20:36,136 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-09-26 08:20:36,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-09-26 08:20:36,137 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,137 INFO L375 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-09-26 08:20:36,138 INFO L423 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,138 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,138 INFO L82 PathProgramCache]: Analyzing trace with hash 1120115117, now seen corresponding path program 79 times [2018-09-26 08:20:36,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:36,500 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:36,500 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:36,501 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-09-26 08:20:36,501 INFO L459 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-09-26 08:20:36,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-09-26 08:20:36,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:20:36,502 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-09-26 08:20:36,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:36,985 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-09-26 08:20:36,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-09-26 08:20:36,985 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-09-26 08:20:36,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:36,986 INFO L225 Difference]: With dead ends: 167 [2018-09-26 08:20:36,987 INFO L226 Difference]: Without dead ends: 165 [2018-09-26 08:20:36,987 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-09-26 08:20:36,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-09-26 08:20:36,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-09-26 08:20:36,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-09-26 08:20:36,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-09-26 08:20:36,996 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-09-26 08:20:36,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:36,996 INFO L480 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-09-26 08:20:36,997 INFO L481 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-09-26 08:20:36,997 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-09-26 08:20:36,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-09-26 08:20:36,998 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:36,998 INFO L375 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-09-26 08:20:36,998 INFO L423 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:36,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:36,998 INFO L82 PathProgramCache]: Analyzing trace with hash -1606111769, now seen corresponding path program 80 times [2018-09-26 08:20:36,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:37,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:37,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:37,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-09-26 08:20:37,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-09-26 08:20:37,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-09-26 08:20:37,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:20:37,371 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-09-26 08:20:37,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:37,823 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-09-26 08:20:37,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-09-26 08:20:37,823 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-09-26 08:20:37,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:37,824 INFO L225 Difference]: With dead ends: 169 [2018-09-26 08:20:37,824 INFO L226 Difference]: Without dead ends: 167 [2018-09-26 08:20:37,825 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-09-26 08:20:37,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-09-26 08:20:37,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-09-26 08:20:37,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-09-26 08:20:37,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-09-26 08:20:37,833 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-09-26 08:20:37,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:37,834 INFO L480 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-09-26 08:20:37,834 INFO L481 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-09-26 08:20:37,834 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-09-26 08:20:37,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-09-26 08:20:37,835 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:37,835 INFO L375 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-09-26 08:20:37,835 INFO L423 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:37,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:37,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1580098655, now seen corresponding path program 81 times [2018-09-26 08:20:37,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:37,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:38,192 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:38,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:38,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-09-26 08:20:38,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-09-26 08:20:38,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-09-26 08:20:38,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:20:38,194 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-09-26 08:20:38,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:38,671 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-09-26 08:20:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-09-26 08:20:38,672 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-09-26 08:20:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:38,673 INFO L225 Difference]: With dead ends: 171 [2018-09-26 08:20:38,673 INFO L226 Difference]: Without dead ends: 169 [2018-09-26 08:20:38,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-09-26 08:20:38,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-09-26 08:20:38,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-09-26 08:20:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-09-26 08:20:38,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-09-26 08:20:38,680 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-09-26 08:20:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:38,681 INFO L480 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-09-26 08:20:38,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-09-26 08:20:38,681 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-09-26 08:20:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-09-26 08:20:38,682 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:38,682 INFO L375 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-09-26 08:20:38,682 INFO L423 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:38,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash 1943667419, now seen corresponding path program 82 times [2018-09-26 08:20:38,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:38,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:39,072 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:39,072 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:39,072 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-09-26 08:20:39,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-09-26 08:20:39,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-09-26 08:20:39,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:20:39,073 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-09-26 08:20:39,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:39,633 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-09-26 08:20:39,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-09-26 08:20:39,634 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-09-26 08:20:39,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:39,635 INFO L225 Difference]: With dead ends: 173 [2018-09-26 08:20:39,635 INFO L226 Difference]: Without dead ends: 171 [2018-09-26 08:20:39,636 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-09-26 08:20:39,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-09-26 08:20:39,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-09-26 08:20:39,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-09-26 08:20:39,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-09-26 08:20:39,645 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-09-26 08:20:39,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:39,646 INFO L480 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-09-26 08:20:39,646 INFO L481 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-09-26 08:20:39,646 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-09-26 08:20:39,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-09-26 08:20:39,647 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:39,647 INFO L375 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-09-26 08:20:39,648 INFO L423 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:39,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:39,648 INFO L82 PathProgramCache]: Analyzing trace with hash -446332011, now seen corresponding path program 83 times [2018-09-26 08:20:39,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:39,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:40,110 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,110 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-09-26 08:20:40,110 INFO L459 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-09-26 08:20:40,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-09-26 08:20:40,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:40,111 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-09-26 08:20:40,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:40,613 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-09-26 08:20:40,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-09-26 08:20:40,614 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-09-26 08:20:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:40,615 INFO L225 Difference]: With dead ends: 175 [2018-09-26 08:20:40,615 INFO L226 Difference]: Without dead ends: 173 [2018-09-26 08:20:40,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-09-26 08:20:40,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-09-26 08:20:40,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-09-26 08:20:40,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-09-26 08:20:40,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-09-26 08:20:40,622 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-09-26 08:20:40,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:40,622 INFO L480 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-09-26 08:20:40,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-09-26 08:20:40,623 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-09-26 08:20:40,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-09-26 08:20:40,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:40,623 INFO L375 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-09-26 08:20:40,624 INFO L423 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash 571719119, now seen corresponding path program 84 times [2018-09-26 08:20:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:40,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:40,991 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:20:40,992 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:40,992 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-09-26 08:20:40,992 INFO L459 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-09-26 08:20:40,992 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-09-26 08:20:40,993 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:40,993 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-09-26 08:20:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:41,668 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-09-26 08:20:41,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-09-26 08:20:41,669 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-09-26 08:20:41,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:41,671 INFO L225 Difference]: With dead ends: 177 [2018-09-26 08:20:41,672 INFO L226 Difference]: Without dead ends: 175 [2018-09-26 08:20:41,673 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-09-26 08:20:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-09-26 08:20:41,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-09-26 08:20:41,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-09-26 08:20:41,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-09-26 08:20:41,684 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-09-26 08:20:41,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:41,685 INFO L480 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-09-26 08:20:41,685 INFO L481 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-09-26 08:20:41,685 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-09-26 08:20:41,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-09-26 08:20:41,686 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:41,686 INFO L375 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-09-26 08:20:41,688 INFO L423 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:41,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:41,688 INFO L82 PathProgramCache]: Analyzing trace with hash -333688439, now seen corresponding path program 85 times [2018-09-26 08:20:41,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:42,194 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:42,194 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:42,194 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-09-26 08:20:42,195 INFO L459 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-09-26 08:20:42,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-09-26 08:20:42,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:42,196 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-09-26 08:20:42,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:42,717 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-09-26 08:20:42,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-09-26 08:20:42,718 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-09-26 08:20:42,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:42,719 INFO L225 Difference]: With dead ends: 179 [2018-09-26 08:20:42,719 INFO L226 Difference]: Without dead ends: 177 [2018-09-26 08:20:42,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-09-26 08:20:42,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-09-26 08:20:42,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-09-26 08:20:42,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-09-26 08:20:42,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-09-26 08:20:42,727 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-09-26 08:20:42,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:42,727 INFO L480 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-09-26 08:20:42,727 INFO L481 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-09-26 08:20:42,727 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-09-26 08:20:42,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-09-26 08:20:42,728 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:42,728 INFO L375 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-09-26 08:20:42,729 INFO L423 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:42,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:42,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1448009411, now seen corresponding path program 86 times [2018-09-26 08:20:42,729 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:43,159 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:43,159 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:43,160 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-09-26 08:20:43,160 INFO L459 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-09-26 08:20:43,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-09-26 08:20:43,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:43,161 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-09-26 08:20:43,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:43,678 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-09-26 08:20:43,679 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-09-26 08:20:43,679 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-09-26 08:20:43,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:43,680 INFO L225 Difference]: With dead ends: 181 [2018-09-26 08:20:43,680 INFO L226 Difference]: Without dead ends: 179 [2018-09-26 08:20:43,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-09-26 08:20:43,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-09-26 08:20:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-09-26 08:20:43,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-09-26 08:20:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-09-26 08:20:43,686 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-09-26 08:20:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:43,687 INFO L480 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-09-26 08:20:43,687 INFO L481 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-09-26 08:20:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-09-26 08:20:43,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-09-26 08:20:43,688 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:43,688 INFO L375 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-09-26 08:20:43,688 INFO L423 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:43,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:43,688 INFO L82 PathProgramCache]: Analyzing trace with hash -32307843, now seen corresponding path program 87 times [2018-09-26 08:20:43,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:44,085 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:44,085 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:44,085 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-09-26 08:20:44,086 INFO L459 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-09-26 08:20:44,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-09-26 08:20:44,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:44,086 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-09-26 08:20:44,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:44,711 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-09-26 08:20:44,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-09-26 08:20:44,711 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-09-26 08:20:44,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:44,712 INFO L225 Difference]: With dead ends: 183 [2018-09-26 08:20:44,712 INFO L226 Difference]: Without dead ends: 181 [2018-09-26 08:20:44,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-09-26 08:20:44,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-09-26 08:20:44,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-09-26 08:20:44,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-09-26 08:20:44,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-09-26 08:20:44,722 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-09-26 08:20:44,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:44,722 INFO L480 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-09-26 08:20:44,723 INFO L481 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-09-26 08:20:44,723 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-09-26 08:20:44,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-09-26 08:20:44,724 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:44,724 INFO L375 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-09-26 08:20:44,724 INFO L423 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:44,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:44,724 INFO L82 PathProgramCache]: Analyzing trace with hash -983013961, now seen corresponding path program 88 times [2018-09-26 08:20:44,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:44,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:45,273 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:45,273 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:45,273 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-09-26 08:20:45,274 INFO L459 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-09-26 08:20:45,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-09-26 08:20:45,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:45,275 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-09-26 08:20:45,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:45,859 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-09-26 08:20:45,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-09-26 08:20:45,860 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-09-26 08:20:45,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:45,861 INFO L225 Difference]: With dead ends: 185 [2018-09-26 08:20:45,861 INFO L226 Difference]: Without dead ends: 183 [2018-09-26 08:20:45,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-09-26 08:20:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-09-26 08:20:45,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-09-26 08:20:45,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-09-26 08:20:45,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-09-26 08:20:45,871 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-09-26 08:20:45,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:45,871 INFO L480 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-09-26 08:20:45,871 INFO L481 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-09-26 08:20:45,871 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-09-26 08:20:45,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-09-26 08:20:45,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:45,873 INFO L375 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-09-26 08:20:45,873 INFO L423 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:45,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:45,873 INFO L82 PathProgramCache]: Analyzing trace with hash 216440689, now seen corresponding path program 89 times [2018-09-26 08:20:45,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:45,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:46,504 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:46,505 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:46,505 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-09-26 08:20:46,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-09-26 08:20:46,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-09-26 08:20:46,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:46,506 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-09-26 08:20:47,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:47,067 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-09-26 08:20:47,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-09-26 08:20:47,067 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-09-26 08:20:47,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:47,068 INFO L225 Difference]: With dead ends: 187 [2018-09-26 08:20:47,068 INFO L226 Difference]: Without dead ends: 185 [2018-09-26 08:20:47,069 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-09-26 08:20:47,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-09-26 08:20:47,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-09-26 08:20:47,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-09-26 08:20:47,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-09-26 08:20:47,078 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-09-26 08:20:47,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:47,078 INFO L480 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-09-26 08:20:47,078 INFO L481 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-09-26 08:20:47,078 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-09-26 08:20:47,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-09-26 08:20:47,079 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:47,080 INFO L375 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-09-26 08:20:47,080 INFO L423 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:47,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:47,080 INFO L82 PathProgramCache]: Analyzing trace with hash 1841124011, now seen corresponding path program 90 times [2018-09-26 08:20:47,080 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:47,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:47,501 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:47,502 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:47,502 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-09-26 08:20:47,502 INFO L459 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-09-26 08:20:47,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-09-26 08:20:47,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:47,503 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-09-26 08:20:48,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:48,075 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-09-26 08:20:48,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-09-26 08:20:48,075 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-09-26 08:20:48,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:48,076 INFO L225 Difference]: With dead ends: 189 [2018-09-26 08:20:48,076 INFO L226 Difference]: Without dead ends: 187 [2018-09-26 08:20:48,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-09-26 08:20:48,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-09-26 08:20:48,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-09-26 08:20:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-09-26 08:20:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-09-26 08:20:48,087 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-09-26 08:20:48,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:48,087 INFO L480 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-09-26 08:20:48,087 INFO L481 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-09-26 08:20:48,087 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-09-26 08:20:48,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-09-26 08:20:48,088 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:48,088 INFO L375 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-09-26 08:20:48,089 INFO L423 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:48,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:48,089 INFO L82 PathProgramCache]: Analyzing trace with hash -206299291, now seen corresponding path program 91 times [2018-09-26 08:20:48,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:48,556 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:48,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:48,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-09-26 08:20:48,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-09-26 08:20:48,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-09-26 08:20:48,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:48,558 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-09-26 08:20:49,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:49,145 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-09-26 08:20:49,145 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-09-26 08:20:49,146 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-09-26 08:20:49,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:49,146 INFO L225 Difference]: With dead ends: 191 [2018-09-26 08:20:49,146 INFO L226 Difference]: Without dead ends: 189 [2018-09-26 08:20:49,147 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-09-26 08:20:49,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-09-26 08:20:49,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-09-26 08:20:49,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-09-26 08:20:49,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-09-26 08:20:49,157 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-09-26 08:20:49,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:49,157 INFO L480 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-09-26 08:20:49,157 INFO L481 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-09-26 08:20:49,157 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-09-26 08:20:49,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-09-26 08:20:49,158 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:49,159 INFO L375 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-09-26 08:20:49,159 INFO L423 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:49,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:49,159 INFO L82 PathProgramCache]: Analyzing trace with hash -685070945, now seen corresponding path program 92 times [2018-09-26 08:20:49,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:49,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:49,776 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:49,777 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:49,777 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-09-26 08:20:49,777 INFO L459 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-09-26 08:20:49,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-09-26 08:20:49,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:49,778 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-09-26 08:20:50,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:50,371 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-09-26 08:20:50,372 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-09-26 08:20:50,372 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-09-26 08:20:50,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:50,373 INFO L225 Difference]: With dead ends: 193 [2018-09-26 08:20:50,373 INFO L226 Difference]: Without dead ends: 191 [2018-09-26 08:20:50,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-09-26 08:20:50,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-09-26 08:20:50,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-09-26 08:20:50,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-09-26 08:20:50,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-09-26 08:20:50,379 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-09-26 08:20:50,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:50,380 INFO L480 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-09-26 08:20:50,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-09-26 08:20:50,380 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-09-26 08:20:50,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-09-26 08:20:50,381 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:50,381 INFO L375 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-09-26 08:20:50,381 INFO L423 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:50,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:50,382 INFO L82 PathProgramCache]: Analyzing trace with hash -1223129767, now seen corresponding path program 93 times [2018-09-26 08:20:50,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:50,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:50,868 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:50,869 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:50,869 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-09-26 08:20:50,869 INFO L459 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-09-26 08:20:50,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-09-26 08:20:50,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:50,870 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-09-26 08:20:51,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:51,494 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-09-26 08:20:51,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-09-26 08:20:51,494 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-09-26 08:20:51,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:51,495 INFO L225 Difference]: With dead ends: 195 [2018-09-26 08:20:51,495 INFO L226 Difference]: Without dead ends: 193 [2018-09-26 08:20:51,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-09-26 08:20:51,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-09-26 08:20:51,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-09-26 08:20:51,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-09-26 08:20:51,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-09-26 08:20:51,506 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-09-26 08:20:51,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:51,506 INFO L480 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-09-26 08:20:51,506 INFO L481 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-09-26 08:20:51,506 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-09-26 08:20:51,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-09-26 08:20:51,507 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:51,507 INFO L375 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-09-26 08:20:51,508 INFO L423 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:51,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:51,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1393385107, now seen corresponding path program 94 times [2018-09-26 08:20:51,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:51,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:51,974 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:51,974 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:51,974 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-09-26 08:20:51,974 INFO L459 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-09-26 08:20:51,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-09-26 08:20:51,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:20:51,976 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-09-26 08:20:52,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:52,616 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-09-26 08:20:52,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-09-26 08:20:52,617 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-09-26 08:20:52,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:52,618 INFO L225 Difference]: With dead ends: 197 [2018-09-26 08:20:52,618 INFO L226 Difference]: Without dead ends: 195 [2018-09-26 08:20:52,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-09-26 08:20:52,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-09-26 08:20:52,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-09-26 08:20:52,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-09-26 08:20:52,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-09-26 08:20:52,628 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-09-26 08:20:52,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:52,628 INFO L480 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-09-26 08:20:52,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-09-26 08:20:52,629 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-09-26 08:20:52,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-09-26 08:20:52,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:52,630 INFO L375 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-09-26 08:20:52,630 INFO L423 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:52,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:52,631 INFO L82 PathProgramCache]: Analyzing trace with hash -986656435, now seen corresponding path program 95 times [2018-09-26 08:20:52,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:52,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:53,222 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:53,223 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:53,223 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-09-26 08:20:53,223 INFO L459 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-09-26 08:20:53,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-09-26 08:20:53,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:20:53,224 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-09-26 08:20:53,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:53,851 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-09-26 08:20:53,852 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-09-26 08:20:53,852 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-09-26 08:20:53,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:53,853 INFO L225 Difference]: With dead ends: 199 [2018-09-26 08:20:53,853 INFO L226 Difference]: Without dead ends: 197 [2018-09-26 08:20:53,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-09-26 08:20:53,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-09-26 08:20:53,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-09-26 08:20:53,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-09-26 08:20:53,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-09-26 08:20:53,862 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-09-26 08:20:53,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:53,862 INFO L480 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-09-26 08:20:53,862 INFO L481 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-09-26 08:20:53,862 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-09-26 08:20:53,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-09-26 08:20:53,863 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:53,863 INFO L375 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-09-26 08:20:53,864 INFO L423 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:53,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:53,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1010990471, now seen corresponding path program 96 times [2018-09-26 08:20:53,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:53,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:54,361 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:54,362 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:54,362 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-09-26 08:20:54,362 INFO L459 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-09-26 08:20:54,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-09-26 08:20:54,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:20:54,363 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-09-26 08:20:55,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:55,005 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-09-26 08:20:55,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-09-26 08:20:55,005 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-09-26 08:20:55,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:55,006 INFO L225 Difference]: With dead ends: 201 [2018-09-26 08:20:55,006 INFO L226 Difference]: Without dead ends: 199 [2018-09-26 08:20:55,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-09-26 08:20:55,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-09-26 08:20:55,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-09-26 08:20:55,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-09-26 08:20:55,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-09-26 08:20:55,013 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-09-26 08:20:55,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:55,013 INFO L480 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-09-26 08:20:55,013 INFO L481 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-09-26 08:20:55,013 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-09-26 08:20:55,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-09-26 08:20:55,014 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:55,014 INFO L375 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-09-26 08:20:55,014 INFO L423 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:55,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:55,015 INFO L82 PathProgramCache]: Analyzing trace with hash 899285825, now seen corresponding path program 97 times [2018-09-26 08:20:55,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:55,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:55,540 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:55,540 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-09-26 08:20:55,541 INFO L459 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-09-26 08:20:55,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-09-26 08:20:55,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:20:55,542 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-09-26 08:20:56,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:56,214 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-09-26 08:20:56,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-09-26 08:20:56,214 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-09-26 08:20:56,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:56,215 INFO L225 Difference]: With dead ends: 203 [2018-09-26 08:20:56,215 INFO L226 Difference]: Without dead ends: 201 [2018-09-26 08:20:56,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-09-26 08:20:56,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-09-26 08:20:56,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-09-26 08:20:56,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-09-26 08:20:56,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-09-26 08:20:56,225 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-09-26 08:20:56,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:56,225 INFO L480 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-09-26 08:20:56,225 INFO L481 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-09-26 08:20:56,225 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-09-26 08:20:56,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-09-26 08:20:56,226 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:56,226 INFO L375 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-09-26 08:20:56,227 INFO L423 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:56,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:56,227 INFO L82 PathProgramCache]: Analyzing trace with hash 925303419, now seen corresponding path program 98 times [2018-09-26 08:20:56,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:56,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:56,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:56,759 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:56,759 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-09-26 08:20:56,760 INFO L459 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-09-26 08:20:56,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-09-26 08:20:56,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:20:56,761 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-09-26 08:20:57,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:57,416 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-09-26 08:20:57,417 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-09-26 08:20:57,417 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-09-26 08:20:57,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:57,418 INFO L225 Difference]: With dead ends: 205 [2018-09-26 08:20:57,418 INFO L226 Difference]: Without dead ends: 203 [2018-09-26 08:20:57,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-09-26 08:20:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-09-26 08:20:57,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-09-26 08:20:57,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-09-26 08:20:57,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-09-26 08:20:57,428 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-09-26 08:20:57,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:57,428 INFO L480 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-09-26 08:20:57,428 INFO L481 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-09-26 08:20:57,428 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-09-26 08:20:57,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-09-26 08:20:57,429 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:57,430 INFO L375 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-09-26 08:20:57,430 INFO L423 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:57,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:57,430 INFO L82 PathProgramCache]: Analyzing trace with hash 158407477, now seen corresponding path program 99 times [2018-09-26 08:20:57,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:57,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:57,945 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:57,945 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:57,946 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-09-26 08:20:57,946 INFO L459 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-09-26 08:20:57,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-09-26 08:20:57,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:20:57,947 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-09-26 08:20:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:58,624 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-09-26 08:20:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-09-26 08:20:58,624 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-09-26 08:20:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:58,625 INFO L225 Difference]: With dead ends: 207 [2018-09-26 08:20:58,625 INFO L226 Difference]: Without dead ends: 205 [2018-09-26 08:20:58,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-09-26 08:20:58,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-09-26 08:20:58,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-09-26 08:20:58,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-09-26 08:20:58,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-09-26 08:20:58,634 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-09-26 08:20:58,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:58,634 INFO L480 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-09-26 08:20:58,634 INFO L481 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-09-26 08:20:58,634 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-09-26 08:20:58,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-09-26 08:20:58,635 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:20:58,635 INFO L375 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-09-26 08:20:58,635 INFO L423 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:20:58,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:20:58,635 INFO L82 PathProgramCache]: Analyzing trace with hash 1905782127, now seen corresponding path program 100 times [2018-09-26 08:20:58,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:20:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:20:59,195 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:20:59,195 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:20:59,195 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-09-26 08:20:59,196 INFO L459 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-09-26 08:20:59,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-09-26 08:20:59,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:20:59,197 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-09-26 08:20:59,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:20:59,962 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-09-26 08:20:59,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-09-26 08:20:59,962 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-09-26 08:20:59,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:20:59,963 INFO L225 Difference]: With dead ends: 209 [2018-09-26 08:20:59,964 INFO L226 Difference]: Without dead ends: 207 [2018-09-26 08:20:59,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-09-26 08:20:59,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-09-26 08:20:59,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-09-26 08:20:59,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-09-26 08:20:59,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-09-26 08:20:59,977 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-09-26 08:20:59,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:20:59,978 INFO L480 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-09-26 08:20:59,978 INFO L481 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-09-26 08:20:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-09-26 08:20:59,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-09-26 08:20:59,997 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:00,000 INFO L375 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-09-26 08:21:00,001 INFO L423 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:00,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:00,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1800608041, now seen corresponding path program 101 times [2018-09-26 08:21:00,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:00,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:00,580 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:00,581 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:00,581 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-09-26 08:21:00,581 INFO L459 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-09-26 08:21:00,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-09-26 08:21:00,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:00,583 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-09-26 08:21:01,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:01,280 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-09-26 08:21:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-09-26 08:21:01,281 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-09-26 08:21:01,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:01,282 INFO L225 Difference]: With dead ends: 211 [2018-09-26 08:21:01,282 INFO L226 Difference]: Without dead ends: 209 [2018-09-26 08:21:01,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-09-26 08:21:01,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-09-26 08:21:01,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-09-26 08:21:01,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-09-26 08:21:01,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-09-26 08:21:01,290 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-09-26 08:21:01,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:01,291 INFO L480 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-09-26 08:21:01,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-09-26 08:21:01,291 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-09-26 08:21:01,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-09-26 08:21:01,292 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:01,292 INFO L375 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-09-26 08:21:01,292 INFO L423 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:01,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:01,293 INFO L82 PathProgramCache]: Analyzing trace with hash -487440797, now seen corresponding path program 102 times [2018-09-26 08:21:01,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:01,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:01,835 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:01,835 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:01,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-09-26 08:21:01,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-09-26 08:21:01,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-09-26 08:21:01,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:21:01,837 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-09-26 08:21:02,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:02,567 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-09-26 08:21:02,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-09-26 08:21:02,567 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-09-26 08:21:02,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:02,568 INFO L225 Difference]: With dead ends: 213 [2018-09-26 08:21:02,568 INFO L226 Difference]: Without dead ends: 211 [2018-09-26 08:21:02,569 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-09-26 08:21:02,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-09-26 08:21:02,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-09-26 08:21:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-09-26 08:21:02,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-09-26 08:21:02,579 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-09-26 08:21:02,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:02,579 INFO L480 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-09-26 08:21:02,579 INFO L481 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-09-26 08:21:02,579 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-09-26 08:21:02,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-09-26 08:21:02,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:02,581 INFO L375 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-09-26 08:21:02,581 INFO L423 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:02,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:02,581 INFO L82 PathProgramCache]: Analyzing trace with hash -279118563, now seen corresponding path program 103 times [2018-09-26 08:21:02,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:03,147 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:03,147 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-09-26 08:21:03,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-09-26 08:21:03,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-09-26 08:21:03,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:21:03,149 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-09-26 08:21:03,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:03,887 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-09-26 08:21:03,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-09-26 08:21:03,887 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-09-26 08:21:03,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:03,888 INFO L225 Difference]: With dead ends: 215 [2018-09-26 08:21:03,888 INFO L226 Difference]: Without dead ends: 213 [2018-09-26 08:21:03,889 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-09-26 08:21:03,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-09-26 08:21:03,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-09-26 08:21:03,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-09-26 08:21:03,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-09-26 08:21:03,898 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-09-26 08:21:03,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:03,899 INFO L480 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-09-26 08:21:03,899 INFO L481 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-09-26 08:21:03,899 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-09-26 08:21:03,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-09-26 08:21:03,900 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:03,900 INFO L375 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-09-26 08:21:03,901 INFO L423 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:03,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:03,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1944914601, now seen corresponding path program 104 times [2018-09-26 08:21:03,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:04,473 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:04,473 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:04,474 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-09-26 08:21:04,474 INFO L459 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-09-26 08:21:04,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-09-26 08:21:04,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:21:04,475 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-09-26 08:21:05,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:05,226 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-09-26 08:21:05,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-09-26 08:21:05,226 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-09-26 08:21:05,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:05,227 INFO L225 Difference]: With dead ends: 217 [2018-09-26 08:21:05,227 INFO L226 Difference]: Without dead ends: 215 [2018-09-26 08:21:05,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-09-26 08:21:05,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-09-26 08:21:05,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-09-26 08:21:05,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-09-26 08:21:05,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-09-26 08:21:05,237 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-09-26 08:21:05,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:05,237 INFO L480 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-09-26 08:21:05,237 INFO L481 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-09-26 08:21:05,237 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-09-26 08:21:05,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-09-26 08:21:05,238 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:05,238 INFO L375 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-09-26 08:21:05,238 INFO L423 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:05,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:05,239 INFO L82 PathProgramCache]: Analyzing trace with hash -752105711, now seen corresponding path program 105 times [2018-09-26 08:21:05,239 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:05,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:05,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:05,859 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:05,859 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-09-26 08:21:05,859 INFO L459 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-09-26 08:21:05,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-09-26 08:21:05,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:21:05,860 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-09-26 08:21:06,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:06,617 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-09-26 08:21:06,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-09-26 08:21:06,618 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-09-26 08:21:06,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:06,618 INFO L225 Difference]: With dead ends: 219 [2018-09-26 08:21:06,618 INFO L226 Difference]: Without dead ends: 217 [2018-09-26 08:21:06,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-09-26 08:21:06,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-09-26 08:21:06,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-09-26 08:21:06,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-09-26 08:21:06,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-09-26 08:21:06,626 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-09-26 08:21:06,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:06,626 INFO L480 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-09-26 08:21:06,627 INFO L481 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-09-26 08:21:06,627 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-09-26 08:21:06,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-09-26 08:21:06,627 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:06,628 INFO L375 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-09-26 08:21:06,628 INFO L423 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:06,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:06,628 INFO L82 PathProgramCache]: Analyzing trace with hash -1219030453, now seen corresponding path program 106 times [2018-09-26 08:21:06,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:07,375 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:07,375 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:07,375 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-09-26 08:21:07,375 INFO L459 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-09-26 08:21:07,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-09-26 08:21:07,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:21:07,376 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-09-26 08:21:08,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:08,057 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-09-26 08:21:08,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-09-26 08:21:08,058 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-09-26 08:21:08,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:08,058 INFO L225 Difference]: With dead ends: 221 [2018-09-26 08:21:08,058 INFO L226 Difference]: Without dead ends: 219 [2018-09-26 08:21:08,059 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-09-26 08:21:08,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-09-26 08:21:08,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-09-26 08:21:08,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-09-26 08:21:08,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-09-26 08:21:08,064 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-09-26 08:21:08,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:08,065 INFO L480 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-09-26 08:21:08,065 INFO L481 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-09-26 08:21:08,065 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-09-26 08:21:08,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-09-26 08:21:08,065 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:08,065 INFO L375 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-09-26 08:21:08,066 INFO L423 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:08,066 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:08,066 INFO L82 PathProgramCache]: Analyzing trace with hash 1037858565, now seen corresponding path program 107 times [2018-09-26 08:21:08,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:08,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:08,612 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:08,612 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:08,612 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-09-26 08:21:08,613 INFO L459 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-09-26 08:21:08,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-09-26 08:21:08,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:21:08,614 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-09-26 08:21:09,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:09,391 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-09-26 08:21:09,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-09-26 08:21:09,392 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-09-26 08:21:09,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:09,392 INFO L225 Difference]: With dead ends: 223 [2018-09-26 08:21:09,392 INFO L226 Difference]: Without dead ends: 221 [2018-09-26 08:21:09,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-09-26 08:21:09,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-09-26 08:21:09,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-09-26 08:21:09,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-09-26 08:21:09,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-09-26 08:21:09,402 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-09-26 08:21:09,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:09,403 INFO L480 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-09-26 08:21:09,403 INFO L481 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-09-26 08:21:09,403 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-09-26 08:21:09,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-09-26 08:21:09,404 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:09,404 INFO L375 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-09-26 08:21:09,404 INFO L423 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:09,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:09,405 INFO L82 PathProgramCache]: Analyzing trace with hash 949720383, now seen corresponding path program 108 times [2018-09-26 08:21:09,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:09,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:10,027 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:10,027 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-09-26 08:21:10,027 INFO L459 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-09-26 08:21:10,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-09-26 08:21:10,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:21:10,029 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-09-26 08:21:10,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:10,860 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-09-26 08:21:10,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-09-26 08:21:10,860 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-09-26 08:21:10,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:10,860 INFO L225 Difference]: With dead ends: 225 [2018-09-26 08:21:10,861 INFO L226 Difference]: Without dead ends: 223 [2018-09-26 08:21:10,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-09-26 08:21:10,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-09-26 08:21:10,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-09-26 08:21:10,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-09-26 08:21:10,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-09-26 08:21:10,870 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-09-26 08:21:10,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:10,870 INFO L480 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-09-26 08:21:10,870 INFO L481 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-09-26 08:21:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-09-26 08:21:10,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-09-26 08:21:10,872 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:10,872 INFO L375 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-09-26 08:21:10,872 INFO L423 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:10,872 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:10,872 INFO L82 PathProgramCache]: Analyzing trace with hash -2146693895, now seen corresponding path program 109 times [2018-09-26 08:21:10,873 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:10,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:11,529 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:11,529 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:11,529 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-09-26 08:21:11,530 INFO L459 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-09-26 08:21:11,530 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-09-26 08:21:11,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:21:11,531 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-09-26 08:21:12,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:12,343 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-09-26 08:21:12,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-09-26 08:21:12,344 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-09-26 08:21:12,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:12,344 INFO L225 Difference]: With dead ends: 227 [2018-09-26 08:21:12,344 INFO L226 Difference]: Without dead ends: 225 [2018-09-26 08:21:12,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-09-26 08:21:12,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-09-26 08:21:12,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-09-26 08:21:12,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-09-26 08:21:12,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-09-26 08:21:12,352 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-09-26 08:21:12,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:12,352 INFO L480 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-09-26 08:21:12,352 INFO L481 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-09-26 08:21:12,353 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-09-26 08:21:12,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-09-26 08:21:12,354 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:12,354 INFO L375 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-09-26 08:21:12,354 INFO L423 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:12,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:12,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1388478925, now seen corresponding path program 110 times [2018-09-26 08:21:12,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:12,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:13,000 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:13,000 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:13,000 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-09-26 08:21:13,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-09-26 08:21:13,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-09-26 08:21:13,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:21:13,002 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-09-26 08:21:13,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:13,855 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-09-26 08:21:13,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-09-26 08:21:13,855 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-09-26 08:21:13,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:13,856 INFO L225 Difference]: With dead ends: 229 [2018-09-26 08:21:13,856 INFO L226 Difference]: Without dead ends: 227 [2018-09-26 08:21:13,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-09-26 08:21:13,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-09-26 08:21:13,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-09-26 08:21:13,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-09-26 08:21:13,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-09-26 08:21:13,866 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-09-26 08:21:13,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:13,866 INFO L480 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-09-26 08:21:13,866 INFO L481 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-09-26 08:21:13,866 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-09-26 08:21:13,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-09-26 08:21:13,867 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:13,867 INFO L375 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-09-26 08:21:13,868 INFO L423 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:13,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:13,868 INFO L82 PathProgramCache]: Analyzing trace with hash 1406634221, now seen corresponding path program 111 times [2018-09-26 08:21:13,868 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:13,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:14,556 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:14,557 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:14,557 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-09-26 08:21:14,557 INFO L459 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-09-26 08:21:14,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-09-26 08:21:14,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:21:14,558 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-09-26 08:21:15,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:15,406 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-09-26 08:21:15,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-09-26 08:21:15,406 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-09-26 08:21:15,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:15,407 INFO L225 Difference]: With dead ends: 231 [2018-09-26 08:21:15,407 INFO L226 Difference]: Without dead ends: 229 [2018-09-26 08:21:15,407 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-09-26 08:21:15,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-09-26 08:21:15,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-09-26 08:21:15,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-09-26 08:21:15,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-09-26 08:21:15,414 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-09-26 08:21:15,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:15,414 INFO L480 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-09-26 08:21:15,414 INFO L481 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-09-26 08:21:15,414 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-09-26 08:21:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-09-26 08:21:15,415 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:15,415 INFO L375 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-09-26 08:21:15,415 INFO L423 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:15,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:15,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1139159769, now seen corresponding path program 112 times [2018-09-26 08:21:15,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:15,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:16,061 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:16,061 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-09-26 08:21:16,061 INFO L459 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-09-26 08:21:16,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-09-26 08:21:16,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:21:16,062 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-09-26 08:21:16,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:16,922 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-09-26 08:21:16,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-09-26 08:21:16,922 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-09-26 08:21:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:16,923 INFO L225 Difference]: With dead ends: 233 [2018-09-26 08:21:16,923 INFO L226 Difference]: Without dead ends: 231 [2018-09-26 08:21:16,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-09-26 08:21:16,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-09-26 08:21:16,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-09-26 08:21:16,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-09-26 08:21:16,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-09-26 08:21:16,933 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-09-26 08:21:16,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:16,933 INFO L480 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-09-26 08:21:16,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-09-26 08:21:16,933 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-09-26 08:21:16,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-09-26 08:21:16,934 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:16,934 INFO L375 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-09-26 08:21:16,935 INFO L423 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:16,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:16,935 INFO L82 PathProgramCache]: Analyzing trace with hash 484174561, now seen corresponding path program 113 times [2018-09-26 08:21:16,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:17,607 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:17,607 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:17,607 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-09-26 08:21:17,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-09-26 08:21:17,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-09-26 08:21:17,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:21:17,609 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-09-26 08:21:18,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:18,496 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-09-26 08:21:18,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-09-26 08:21:18,497 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-09-26 08:21:18,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:18,497 INFO L225 Difference]: With dead ends: 235 [2018-09-26 08:21:18,497 INFO L226 Difference]: Without dead ends: 233 [2018-09-26 08:21:18,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-09-26 08:21:18,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-09-26 08:21:18,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-09-26 08:21:18,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-09-26 08:21:18,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-09-26 08:21:18,509 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-09-26 08:21:18,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:18,509 INFO L480 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-09-26 08:21:18,509 INFO L481 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-09-26 08:21:18,509 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-09-26 08:21:18,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-09-26 08:21:18,510 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:18,511 INFO L375 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-09-26 08:21:18,511 INFO L423 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:18,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:18,511 INFO L82 PathProgramCache]: Analyzing trace with hash 1435337243, now seen corresponding path program 114 times [2018-09-26 08:21:18,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:18,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:19,204 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:19,204 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:19,204 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-09-26 08:21:19,204 INFO L459 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-09-26 08:21:19,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-09-26 08:21:19,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:21:19,205 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-09-26 08:21:20,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:20,083 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-09-26 08:21:20,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-09-26 08:21:20,083 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-09-26 08:21:20,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:20,084 INFO L225 Difference]: With dead ends: 237 [2018-09-26 08:21:20,084 INFO L226 Difference]: Without dead ends: 235 [2018-09-26 08:21:20,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-09-26 08:21:20,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-09-26 08:21:20,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-09-26 08:21:20,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-09-26 08:21:20,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-09-26 08:21:20,091 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-09-26 08:21:20,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:20,092 INFO L480 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-09-26 08:21:20,092 INFO L481 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-09-26 08:21:20,092 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-09-26 08:21:20,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-09-26 08:21:20,092 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:20,092 INFO L375 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-09-26 08:21:20,093 INFO L423 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:20,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:20,093 INFO L82 PathProgramCache]: Analyzing trace with hash 674640597, now seen corresponding path program 115 times [2018-09-26 08:21:20,093 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:20,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:20,770 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:20,770 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-09-26 08:21:20,770 INFO L459 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-09-26 08:21:20,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-09-26 08:21:20,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:21:20,771 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-09-26 08:21:21,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:21,688 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-09-26 08:21:21,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-09-26 08:21:21,688 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-09-26 08:21:21,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:21,689 INFO L225 Difference]: With dead ends: 239 [2018-09-26 08:21:21,689 INFO L226 Difference]: Without dead ends: 237 [2018-09-26 08:21:21,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-09-26 08:21:21,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-09-26 08:21:21,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-09-26 08:21:21,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-09-26 08:21:21,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-09-26 08:21:21,697 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-09-26 08:21:21,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:21,698 INFO L480 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-09-26 08:21:21,698 INFO L481 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-09-26 08:21:21,698 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-09-26 08:21:21,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-09-26 08:21:21,699 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:21,699 INFO L375 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-09-26 08:21:21,699 INFO L423 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:21,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:21,699 INFO L82 PathProgramCache]: Analyzing trace with hash -210395889, now seen corresponding path program 116 times [2018-09-26 08:21:21,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:22,434 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:22,434 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:22,434 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-09-26 08:21:22,435 INFO L459 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-09-26 08:21:22,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-09-26 08:21:22,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:21:22,436 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-09-26 08:21:23,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:23,363 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-09-26 08:21:23,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-09-26 08:21:23,363 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-09-26 08:21:23,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:23,364 INFO L225 Difference]: With dead ends: 241 [2018-09-26 08:21:23,364 INFO L226 Difference]: Without dead ends: 239 [2018-09-26 08:21:23,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-09-26 08:21:23,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-09-26 08:21:23,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-09-26 08:21:23,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-09-26 08:21:23,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-09-26 08:21:23,372 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-09-26 08:21:23,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:23,373 INFO L480 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-09-26 08:21:23,373 INFO L481 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-09-26 08:21:23,373 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-09-26 08:21:23,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-09-26 08:21:23,374 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:23,374 INFO L375 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-09-26 08:21:23,374 INFO L423 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:23,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:23,375 INFO L82 PathProgramCache]: Analyzing trace with hash -326934327, now seen corresponding path program 117 times [2018-09-26 08:21:23,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:23,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:24,066 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:24,067 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:24,067 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-09-26 08:21:24,067 INFO L459 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-09-26 08:21:24,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-09-26 08:21:24,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:21:24,068 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-09-26 08:21:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:25,039 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-09-26 08:21:25,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-09-26 08:21:25,040 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-09-26 08:21:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:25,040 INFO L225 Difference]: With dead ends: 243 [2018-09-26 08:21:25,040 INFO L226 Difference]: Without dead ends: 241 [2018-09-26 08:21:25,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-09-26 08:21:25,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-09-26 08:21:25,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-09-26 08:21:25,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-09-26 08:21:25,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-09-26 08:21:25,051 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-09-26 08:21:25,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:25,051 INFO L480 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-09-26 08:21:25,051 INFO L481 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-09-26 08:21:25,051 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-09-26 08:21:25,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-09-26 08:21:25,052 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:25,052 INFO L375 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-09-26 08:21:25,052 INFO L423 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:25,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:25,053 INFO L82 PathProgramCache]: Analyzing trace with hash -651223549, now seen corresponding path program 118 times [2018-09-26 08:21:25,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:25,789 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:25,789 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:25,789 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-09-26 08:21:25,789 INFO L459 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-09-26 08:21:25,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-09-26 08:21:25,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:21:25,790 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-09-26 08:21:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:26,703 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-09-26 08:21:26,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-09-26 08:21:26,703 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-09-26 08:21:26,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:26,704 INFO L225 Difference]: With dead ends: 245 [2018-09-26 08:21:26,704 INFO L226 Difference]: Without dead ends: 243 [2018-09-26 08:21:26,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-09-26 08:21:26,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-09-26 08:21:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-09-26 08:21:26,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-09-26 08:21:26,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-09-26 08:21:26,711 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-09-26 08:21:26,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:26,711 INFO L480 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-09-26 08:21:26,711 INFO L481 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-09-26 08:21:26,711 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-09-26 08:21:26,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-09-26 08:21:26,712 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:26,712 INFO L375 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-09-26 08:21:26,712 INFO L423 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:26,712 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:26,713 INFO L82 PathProgramCache]: Analyzing trace with hash 1239446717, now seen corresponding path program 119 times [2018-09-26 08:21:26,713 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:26,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:27,411 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:27,412 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:27,412 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-09-26 08:21:27,412 INFO L459 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-09-26 08:21:27,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-09-26 08:21:27,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:21:27,414 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-09-26 08:21:28,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:28,410 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-09-26 08:21:28,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-09-26 08:21:28,410 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-09-26 08:21:28,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:28,411 INFO L225 Difference]: With dead ends: 247 [2018-09-26 08:21:28,411 INFO L226 Difference]: Without dead ends: 245 [2018-09-26 08:21:28,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-09-26 08:21:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-09-26 08:21:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-09-26 08:21:28,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-09-26 08:21:28,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-09-26 08:21:28,419 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-09-26 08:21:28,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:28,419 INFO L480 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-09-26 08:21:28,419 INFO L481 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-09-26 08:21:28,419 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-09-26 08:21:28,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-09-26 08:21:28,420 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:28,420 INFO L375 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-09-26 08:21:28,420 INFO L423 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:28,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:28,420 INFO L82 PathProgramCache]: Analyzing trace with hash 1402406135, now seen corresponding path program 120 times [2018-09-26 08:21:28,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:28,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:29,143 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:29,143 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:29,144 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-09-26 08:21:29,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-09-26 08:21:29,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-09-26 08:21:29,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:21:29,145 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-09-26 08:21:30,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:30,064 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-09-26 08:21:30,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-09-26 08:21:30,064 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-09-26 08:21:30,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:30,065 INFO L225 Difference]: With dead ends: 249 [2018-09-26 08:21:30,065 INFO L226 Difference]: Without dead ends: 247 [2018-09-26 08:21:30,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-09-26 08:21:30,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-09-26 08:21:30,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-09-26 08:21:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-09-26 08:21:30,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-09-26 08:21:30,071 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-09-26 08:21:30,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:30,072 INFO L480 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-09-26 08:21:30,072 INFO L481 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-09-26 08:21:30,072 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-09-26 08:21:30,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-09-26 08:21:30,072 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:30,072 INFO L375 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-09-26 08:21:30,073 INFO L423 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:30,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:30,073 INFO L82 PathProgramCache]: Analyzing trace with hash -907383119, now seen corresponding path program 121 times [2018-09-26 08:21:30,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:30,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:30,845 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:30,845 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:30,846 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-09-26 08:21:30,846 INFO L459 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-09-26 08:21:30,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-09-26 08:21:30,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:21:30,847 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-09-26 08:21:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:31,857 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-09-26 08:21:31,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-09-26 08:21:31,857 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-09-26 08:21:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:31,858 INFO L225 Difference]: With dead ends: 251 [2018-09-26 08:21:31,858 INFO L226 Difference]: Without dead ends: 249 [2018-09-26 08:21:31,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-09-26 08:21:31,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-09-26 08:21:31,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-09-26 08:21:31,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-09-26 08:21:31,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-09-26 08:21:31,868 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-09-26 08:21:31,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:31,869 INFO L480 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-09-26 08:21:31,869 INFO L481 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-09-26 08:21:31,869 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-09-26 08:21:31,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-09-26 08:21:31,870 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:31,870 INFO L375 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-09-26 08:21:31,870 INFO L423 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:31,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:31,870 INFO L82 PathProgramCache]: Analyzing trace with hash -116764181, now seen corresponding path program 122 times [2018-09-26 08:21:31,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:31,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:32,721 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:32,722 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:32,722 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-09-26 08:21:32,722 INFO L459 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-09-26 08:21:32,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-09-26 08:21:32,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:21:32,723 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-09-26 08:21:33,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:33,761 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-09-26 08:21:33,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-09-26 08:21:33,761 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-09-26 08:21:33,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:33,762 INFO L225 Difference]: With dead ends: 253 [2018-09-26 08:21:33,762 INFO L226 Difference]: Without dead ends: 251 [2018-09-26 08:21:33,763 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-09-26 08:21:33,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-09-26 08:21:33,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-09-26 08:21:33,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-09-26 08:21:33,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-09-26 08:21:33,770 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-09-26 08:21:33,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:33,771 INFO L480 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-09-26 08:21:33,771 INFO L481 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-09-26 08:21:33,771 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-09-26 08:21:33,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-09-26 08:21:33,772 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:33,772 INFO L375 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-09-26 08:21:33,772 INFO L423 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:33,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:33,773 INFO L82 PathProgramCache]: Analyzing trace with hash -541176155, now seen corresponding path program 123 times [2018-09-26 08:21:33,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:33,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:34,542 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:34,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:34,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-09-26 08:21:34,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-09-26 08:21:34,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-09-26 08:21:34,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:21:34,544 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-09-26 08:21:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:35,600 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-09-26 08:21:35,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-09-26 08:21:35,600 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-09-26 08:21:35,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:35,601 INFO L225 Difference]: With dead ends: 255 [2018-09-26 08:21:35,601 INFO L226 Difference]: Without dead ends: 253 [2018-09-26 08:21:35,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-09-26 08:21:35,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-09-26 08:21:35,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-09-26 08:21:35,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-09-26 08:21:35,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-09-26 08:21:35,609 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-09-26 08:21:35,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:35,609 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-09-26 08:21:35,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-09-26 08:21:35,610 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-09-26 08:21:35,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-09-26 08:21:35,611 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:35,611 INFO L375 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-09-26 08:21:35,611 INFO L423 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:35,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:35,611 INFO L82 PathProgramCache]: Analyzing trace with hash -379190049, now seen corresponding path program 124 times [2018-09-26 08:21:35,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:36,368 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:36,369 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:36,369 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-09-26 08:21:36,369 INFO L459 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-09-26 08:21:36,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-09-26 08:21:36,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:21:36,370 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-09-26 08:21:37,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:37,430 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-09-26 08:21:37,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-09-26 08:21:37,430 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-09-26 08:21:37,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:37,431 INFO L225 Difference]: With dead ends: 257 [2018-09-26 08:21:37,431 INFO L226 Difference]: Without dead ends: 255 [2018-09-26 08:21:37,432 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-09-26 08:21:37,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-09-26 08:21:37,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-09-26 08:21:37,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-09-26 08:21:37,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-09-26 08:21:37,439 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-09-26 08:21:37,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:37,439 INFO L480 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-09-26 08:21:37,440 INFO L481 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-09-26 08:21:37,440 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-09-26 08:21:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-09-26 08:21:37,441 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:37,441 INFO L375 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-09-26 08:21:37,442 INFO L423 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:37,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:37,442 INFO L82 PathProgramCache]: Analyzing trace with hash 670635161, now seen corresponding path program 125 times [2018-09-26 08:21:37,442 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:38,250 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:38,250 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:38,251 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-09-26 08:21:38,251 INFO L459 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-09-26 08:21:38,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-09-26 08:21:38,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:21:38,252 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-09-26 08:21:39,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:39,353 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-09-26 08:21:39,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-09-26 08:21:39,353 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-09-26 08:21:39,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:39,354 INFO L225 Difference]: With dead ends: 259 [2018-09-26 08:21:39,354 INFO L226 Difference]: Without dead ends: 257 [2018-09-26 08:21:39,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-09-26 08:21:39,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-09-26 08:21:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-09-26 08:21:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-09-26 08:21:39,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-09-26 08:21:39,363 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-09-26 08:21:39,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:39,363 INFO L480 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-09-26 08:21:39,363 INFO L481 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-09-26 08:21:39,363 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-09-26 08:21:39,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-09-26 08:21:39,364 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:39,365 INFO L375 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-09-26 08:21:39,365 INFO L423 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:39,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:39,365 INFO L82 PathProgramCache]: Analyzing trace with hash 235347411, now seen corresponding path program 126 times [2018-09-26 08:21:39,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:39,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:40,192 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:40,192 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:40,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-09-26 08:21:40,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-09-26 08:21:40,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-09-26 08:21:40,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:21:40,194 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-09-26 08:21:41,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:41,285 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-09-26 08:21:41,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-09-26 08:21:41,285 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-09-26 08:21:41,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:41,286 INFO L225 Difference]: With dead ends: 261 [2018-09-26 08:21:41,286 INFO L226 Difference]: Without dead ends: 259 [2018-09-26 08:21:41,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-09-26 08:21:41,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-09-26 08:21:41,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-09-26 08:21:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-09-26 08:21:41,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-09-26 08:21:41,296 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-09-26 08:21:41,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:41,297 INFO L480 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-09-26 08:21:41,297 INFO L481 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-09-26 08:21:41,297 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-09-26 08:21:41,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-09-26 08:21:41,298 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:41,298 INFO L375 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-09-26 08:21:41,298 INFO L423 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:41,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:41,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1464352627, now seen corresponding path program 127 times [2018-09-26 08:21:41,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:41,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:42,393 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:42,393 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:42,393 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-09-26 08:21:42,394 INFO L459 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-09-26 08:21:42,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-09-26 08:21:42,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:21:42,396 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-09-26 08:21:43,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:43,549 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-09-26 08:21:43,549 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-09-26 08:21:43,549 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-09-26 08:21:43,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:43,550 INFO L225 Difference]: With dead ends: 263 [2018-09-26 08:21:43,550 INFO L226 Difference]: Without dead ends: 261 [2018-09-26 08:21:43,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-09-26 08:21:43,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-09-26 08:21:43,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-09-26 08:21:43,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-09-26 08:21:43,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-09-26 08:21:43,562 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-09-26 08:21:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:43,563 INFO L480 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-09-26 08:21:43,563 INFO L481 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-09-26 08:21:43,563 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-09-26 08:21:43,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-09-26 08:21:43,564 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:43,564 INFO L375 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-09-26 08:21:43,564 INFO L423 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:43,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:43,565 INFO L82 PathProgramCache]: Analyzing trace with hash 1506450631, now seen corresponding path program 128 times [2018-09-26 08:21:43,565 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:43,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:44,451 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:44,451 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:44,452 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-09-26 08:21:44,452 INFO L459 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-09-26 08:21:44,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-09-26 08:21:44,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:21:44,453 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-09-26 08:21:45,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:45,570 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-09-26 08:21:45,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-09-26 08:21:45,570 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-09-26 08:21:45,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:45,571 INFO L225 Difference]: With dead ends: 265 [2018-09-26 08:21:45,571 INFO L226 Difference]: Without dead ends: 263 [2018-09-26 08:21:45,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-09-26 08:21:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-09-26 08:21:45,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-09-26 08:21:45,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-09-26 08:21:45,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-09-26 08:21:45,579 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-09-26 08:21:45,579 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:45,579 INFO L480 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-09-26 08:21:45,580 INFO L481 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-09-26 08:21:45,580 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-09-26 08:21:45,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-09-26 08:21:45,580 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:45,580 INFO L375 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-09-26 08:21:45,581 INFO L423 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:45,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:45,581 INFO L82 PathProgramCache]: Analyzing trace with hash 295129729, now seen corresponding path program 129 times [2018-09-26 08:21:45,581 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:45,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:46,413 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:46,413 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-09-26 08:21:46,413 INFO L459 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-09-26 08:21:46,414 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-09-26 08:21:46,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:21:46,415 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-09-26 08:21:47,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:47,571 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-09-26 08:21:47,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-09-26 08:21:47,571 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-09-26 08:21:47,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:47,572 INFO L225 Difference]: With dead ends: 267 [2018-09-26 08:21:47,572 INFO L226 Difference]: Without dead ends: 265 [2018-09-26 08:21:47,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-09-26 08:21:47,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-09-26 08:21:47,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-09-26 08:21:47,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-09-26 08:21:47,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-09-26 08:21:47,582 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-09-26 08:21:47,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:47,582 INFO L480 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-09-26 08:21:47,583 INFO L481 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-09-26 08:21:47,583 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-09-26 08:21:47,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-09-26 08:21:47,584 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:47,584 INFO L375 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-09-26 08:21:47,584 INFO L423 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:47,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:47,584 INFO L82 PathProgramCache]: Analyzing trace with hash 151880123, now seen corresponding path program 130 times [2018-09-26 08:21:47,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:48,478 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:48,479 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:48,479 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-09-26 08:21:48,479 INFO L459 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-09-26 08:21:48,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-09-26 08:21:48,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:21:48,480 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-09-26 08:21:49,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:49,613 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-09-26 08:21:49,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-09-26 08:21:49,613 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-09-26 08:21:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:49,614 INFO L225 Difference]: With dead ends: 269 [2018-09-26 08:21:49,614 INFO L226 Difference]: Without dead ends: 267 [2018-09-26 08:21:49,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-09-26 08:21:49,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-09-26 08:21:49,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-09-26 08:21:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-09-26 08:21:49,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-09-26 08:21:49,622 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-09-26 08:21:49,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:49,622 INFO L480 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-09-26 08:21:49,622 INFO L481 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-09-26 08:21:49,622 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-09-26 08:21:49,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-09-26 08:21:49,623 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:49,623 INFO L375 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-09-26 08:21:49,623 INFO L423 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:49,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:49,624 INFO L82 PathProgramCache]: Analyzing trace with hash -72037771, now seen corresponding path program 131 times [2018-09-26 08:21:49,624 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:49,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:50,488 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:50,488 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:50,488 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-09-26 08:21:50,488 INFO L459 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-09-26 08:21:50,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-09-26 08:21:50,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:21:50,490 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-09-26 08:21:51,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:51,670 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-09-26 08:21:51,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-09-26 08:21:51,670 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-09-26 08:21:51,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:51,671 INFO L225 Difference]: With dead ends: 271 [2018-09-26 08:21:51,671 INFO L226 Difference]: Without dead ends: 269 [2018-09-26 08:21:51,672 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-09-26 08:21:51,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-09-26 08:21:51,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-09-26 08:21:51,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-09-26 08:21:51,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-09-26 08:21:51,679 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-09-26 08:21:51,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:51,679 INFO L480 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-09-26 08:21:51,679 INFO L481 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-09-26 08:21:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-09-26 08:21:51,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-09-26 08:21:51,680 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:51,680 INFO L375 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-09-26 08:21:51,681 INFO L423 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:51,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:51,681 INFO L82 PathProgramCache]: Analyzing trace with hash -508769105, now seen corresponding path program 132 times [2018-09-26 08:21:51,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:51,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:52,577 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:52,577 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:52,577 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-09-26 08:21:52,577 INFO L459 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-09-26 08:21:52,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-09-26 08:21:52,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:21:52,578 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-09-26 08:21:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:53,753 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-09-26 08:21:53,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-09-26 08:21:53,753 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-09-26 08:21:53,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:53,754 INFO L225 Difference]: With dead ends: 273 [2018-09-26 08:21:53,754 INFO L226 Difference]: Without dead ends: 271 [2018-09-26 08:21:53,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-09-26 08:21:53,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-09-26 08:21:53,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-09-26 08:21:53,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-09-26 08:21:53,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-09-26 08:21:53,762 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-09-26 08:21:53,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:53,762 INFO L480 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-09-26 08:21:53,762 INFO L481 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-09-26 08:21:53,762 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-09-26 08:21:53,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-09-26 08:21:53,763 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:53,763 INFO L375 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-09-26 08:21:53,763 INFO L423 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:53,763 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:53,763 INFO L82 PathProgramCache]: Analyzing trace with hash 699213929, now seen corresponding path program 133 times [2018-09-26 08:21:53,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:53,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:54,653 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:54,653 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:54,653 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-09-26 08:21:54,653 INFO L459 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-09-26 08:21:54,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-09-26 08:21:54,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:21:54,654 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-09-26 08:21:55,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:55,840 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-09-26 08:21:55,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-09-26 08:21:55,840 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-09-26 08:21:55,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:55,841 INFO L225 Difference]: With dead ends: 275 [2018-09-26 08:21:55,841 INFO L226 Difference]: Without dead ends: 273 [2018-09-26 08:21:55,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-09-26 08:21:55,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-09-26 08:21:55,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-09-26 08:21:55,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-09-26 08:21:55,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-09-26 08:21:55,849 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-09-26 08:21:55,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:55,849 INFO L480 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-09-26 08:21:55,850 INFO L481 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-09-26 08:21:55,850 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-09-26 08:21:55,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-09-26 08:21:55,850 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:55,850 INFO L375 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-09-26 08:21:55,851 INFO L423 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:55,851 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:55,851 INFO L82 PathProgramCache]: Analyzing trace with hash 1929739683, now seen corresponding path program 134 times [2018-09-26 08:21:55,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:55,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:56,836 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:56,836 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:56,836 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-09-26 08:21:56,836 INFO L459 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-09-26 08:21:56,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-09-26 08:21:56,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:21:56,838 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-09-26 08:21:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:21:58,057 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-09-26 08:21:58,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-09-26 08:21:58,058 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-09-26 08:21:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:21:58,059 INFO L225 Difference]: With dead ends: 277 [2018-09-26 08:21:58,059 INFO L226 Difference]: Without dead ends: 275 [2018-09-26 08:21:58,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-09-26 08:21:58,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-09-26 08:21:58,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-09-26 08:21:58,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-09-26 08:21:58,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-09-26 08:21:58,071 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-09-26 08:21:58,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:21:58,071 INFO L480 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-09-26 08:21:58,071 INFO L481 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-09-26 08:21:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-09-26 08:21:58,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-09-26 08:21:58,073 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:21:58,073 INFO L375 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-09-26 08:21:58,073 INFO L423 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:21:58,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:21:58,073 INFO L82 PathProgramCache]: Analyzing trace with hash -945984419, now seen corresponding path program 135 times [2018-09-26 08:21:58,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:21:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:21:59,053 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:21:59,053 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:21:59,053 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-09-26 08:21:59,054 INFO L459 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-09-26 08:21:59,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-09-26 08:21:59,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:21:59,055 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-09-26 08:22:00,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:00,308 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-09-26 08:22:00,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-09-26 08:22:00,308 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-09-26 08:22:00,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:00,309 INFO L225 Difference]: With dead ends: 279 [2018-09-26 08:22:00,309 INFO L226 Difference]: Without dead ends: 277 [2018-09-26 08:22:00,310 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-09-26 08:22:00,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-09-26 08:22:00,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-09-26 08:22:00,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-09-26 08:22:00,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-09-26 08:22:00,317 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-09-26 08:22:00,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:00,317 INFO L480 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-09-26 08:22:00,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-09-26 08:22:00,317 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-09-26 08:22:00,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-09-26 08:22:00,318 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:00,318 INFO L375 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-09-26 08:22:00,318 INFO L423 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:00,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:00,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1442092183, now seen corresponding path program 136 times [2018-09-26 08:22:00,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:01,283 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:01,283 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:01,283 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-09-26 08:22:01,284 INFO L459 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-09-26 08:22:01,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-09-26 08:22:01,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:22:01,285 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. [2018-09-26 08:22:02,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:02,536 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-09-26 08:22:02,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-09-26 08:22:02,537 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 276 [2018-09-26 08:22:02,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:02,537 INFO L225 Difference]: With dead ends: 281 [2018-09-26 08:22:02,538 INFO L226 Difference]: Without dead ends: 279 [2018-09-26 08:22:02,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-09-26 08:22:02,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-09-26 08:22:02,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 279. [2018-09-26 08:22:02,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-09-26 08:22:02,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-09-26 08:22:02,546 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-09-26 08:22:02,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:02,547 INFO L480 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-09-26 08:22:02,547 INFO L481 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-09-26 08:22:02,547 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-09-26 08:22:02,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-09-26 08:22:02,548 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:02,548 INFO L375 BasicCegarLoop]: trace histogram [138, 137, 1, 1, 1] [2018-09-26 08:22:02,548 INFO L423 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:02,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:02,548 INFO L82 PathProgramCache]: Analyzing trace with hash -1423796655, now seen corresponding path program 137 times [2018-09-26 08:22:02,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:03,490 INFO L134 CoverageAnalysis]: Checked inductivity of 18906 backedges. 0 proven. 18906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:03,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:03,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-09-26 08:22:03,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-09-26 08:22:03,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-09-26 08:22:03,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:22:03,493 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 140 states. [2018-09-26 08:22:04,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:04,836 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-09-26 08:22:04,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-09-26 08:22:04,836 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 278 [2018-09-26 08:22:04,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:04,837 INFO L225 Difference]: With dead ends: 283 [2018-09-26 08:22:04,837 INFO L226 Difference]: Without dead ends: 281 [2018-09-26 08:22:04,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=277, Invalid=19183, Unknown=0, NotChecked=0, Total=19460 [2018-09-26 08:22:04,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-09-26 08:22:04,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 281. [2018-09-26 08:22:04,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-09-26 08:22:04,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-09-26 08:22:04,844 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-09-26 08:22:04,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:04,844 INFO L480 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-09-26 08:22:04,844 INFO L481 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-09-26 08:22:04,845 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-09-26 08:22:04,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-09-26 08:22:04,845 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:04,845 INFO L375 BasicCegarLoop]: trace histogram [139, 138, 1, 1, 1] [2018-09-26 08:22:04,846 INFO L423 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:04,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:04,846 INFO L82 PathProgramCache]: Analyzing trace with hash 1826034059, now seen corresponding path program 138 times [2018-09-26 08:22:04,846 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:04,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:05,800 INFO L134 CoverageAnalysis]: Checked inductivity of 19182 backedges. 0 proven. 19182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:05,800 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:05,800 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-09-26 08:22:05,801 INFO L459 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-09-26 08:22:05,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-09-26 08:22:05,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:22:05,803 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 141 states. [2018-09-26 08:22:07,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:07,114 INFO L93 Difference]: Finished difference Result 285 states and 285 transitions. [2018-09-26 08:22:07,114 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-09-26 08:22:07,114 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 280 [2018-09-26 08:22:07,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:07,115 INFO L225 Difference]: With dead ends: 285 [2018-09-26 08:22:07,115 INFO L226 Difference]: Without dead ends: 283 [2018-09-26 08:22:07,116 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=279, Invalid=19461, Unknown=0, NotChecked=0, Total=19740 [2018-09-26 08:22:07,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-09-26 08:22:07,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 283. [2018-09-26 08:22:07,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-09-26 08:22:07,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-09-26 08:22:07,123 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-09-26 08:22:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:07,123 INFO L480 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-09-26 08:22:07,123 INFO L481 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-09-26 08:22:07,123 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-09-26 08:22:07,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-09-26 08:22:07,124 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:07,124 INFO L375 BasicCegarLoop]: trace histogram [140, 139, 1, 1, 1] [2018-09-26 08:22:07,124 INFO L423 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:07,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:07,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1822841275, now seen corresponding path program 139 times [2018-09-26 08:22:07,125 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:07,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:08,103 INFO L134 CoverageAnalysis]: Checked inductivity of 19460 backedges. 0 proven. 19460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:08,103 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:08,103 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-09-26 08:22:08,104 INFO L459 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-09-26 08:22:08,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-09-26 08:22:08,105 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:22:08,105 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 142 states. [2018-09-26 08:22:09,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:09,453 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-09-26 08:22:09,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-09-26 08:22:09,453 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 282 [2018-09-26 08:22:09,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:09,454 INFO L225 Difference]: With dead ends: 287 [2018-09-26 08:22:09,454 INFO L226 Difference]: Without dead ends: 285 [2018-09-26 08:22:09,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=281, Invalid=19741, Unknown=0, NotChecked=0, Total=20022 [2018-09-26 08:22:09,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2018-09-26 08:22:09,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 285. [2018-09-26 08:22:09,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-09-26 08:22:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-09-26 08:22:09,461 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-09-26 08:22:09,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:09,462 INFO L480 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-09-26 08:22:09,462 INFO L481 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-09-26 08:22:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-09-26 08:22:09,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-09-26 08:22:09,463 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:09,463 INFO L375 BasicCegarLoop]: trace histogram [141, 140, 1, 1, 1] [2018-09-26 08:22:09,463 INFO L423 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:09,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:09,463 INFO L82 PathProgramCache]: Analyzing trace with hash 596243583, now seen corresponding path program 140 times [2018-09-26 08:22:09,463 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 19740 backedges. 0 proven. 19740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:10,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:10,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-09-26 08:22:10,414 INFO L459 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-09-26 08:22:10,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-09-26 08:22:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:22:10,416 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 143 states. [2018-09-26 08:22:11,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:11,774 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-09-26 08:22:11,774 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-09-26 08:22:11,774 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 284 [2018-09-26 08:22:11,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:11,775 INFO L225 Difference]: With dead ends: 289 [2018-09-26 08:22:11,775 INFO L226 Difference]: Without dead ends: 287 [2018-09-26 08:22:11,777 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=283, Invalid=20023, Unknown=0, NotChecked=0, Total=20306 [2018-09-26 08:22:11,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-09-26 08:22:11,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 287. [2018-09-26 08:22:11,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-09-26 08:22:11,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-09-26 08:22:11,784 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-09-26 08:22:11,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:11,785 INFO L480 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-09-26 08:22:11,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-09-26 08:22:11,785 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-09-26 08:22:11,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-09-26 08:22:11,786 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:11,786 INFO L375 BasicCegarLoop]: trace histogram [142, 141, 1, 1, 1] [2018-09-26 08:22:11,786 INFO L423 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:11,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:11,787 INFO L82 PathProgramCache]: Analyzing trace with hash 1759484985, now seen corresponding path program 141 times [2018-09-26 08:22:11,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:11,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 20022 backedges. 0 proven. 20022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:12,801 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:12,801 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-09-26 08:22:12,802 INFO L459 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-09-26 08:22:12,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-09-26 08:22:12,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:22:12,803 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 144 states. [2018-09-26 08:22:14,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:14,049 INFO L93 Difference]: Finished difference Result 291 states and 291 transitions. [2018-09-26 08:22:14,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-09-26 08:22:14,050 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 286 [2018-09-26 08:22:14,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:14,050 INFO L225 Difference]: With dead ends: 291 [2018-09-26 08:22:14,051 INFO L226 Difference]: Without dead ends: 289 [2018-09-26 08:22:14,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=285, Invalid=20307, Unknown=0, NotChecked=0, Total=20592 [2018-09-26 08:22:14,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-09-26 08:22:14,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2018-09-26 08:22:14,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-09-26 08:22:14,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-09-26 08:22:14,057 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-09-26 08:22:14,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:14,058 INFO L480 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-09-26 08:22:14,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-09-26 08:22:14,058 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-09-26 08:22:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-09-26 08:22:14,058 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:14,059 INFO L375 BasicCegarLoop]: trace histogram [143, 142, 1, 1, 1] [2018-09-26 08:22:14,059 INFO L423 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:14,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:14,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1351991949, now seen corresponding path program 142 times [2018-09-26 08:22:14,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:14,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:14,924 INFO L134 CoverageAnalysis]: Checked inductivity of 20306 backedges. 0 proven. 20306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:14,924 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:14,924 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-09-26 08:22:14,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-09-26 08:22:14,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-09-26 08:22:14,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:22:14,926 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 145 states. [2018-09-26 08:22:16,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:16,211 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-09-26 08:22:16,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-09-26 08:22:16,211 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 288 [2018-09-26 08:22:16,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:16,212 INFO L225 Difference]: With dead ends: 293 [2018-09-26 08:22:16,212 INFO L226 Difference]: Without dead ends: 291 [2018-09-26 08:22:16,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=287, Invalid=20593, Unknown=0, NotChecked=0, Total=20880 [2018-09-26 08:22:16,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-09-26 08:22:16,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2018-09-26 08:22:16,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-09-26 08:22:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-09-26 08:22:16,225 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-09-26 08:22:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:16,226 INFO L480 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-09-26 08:22:16,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-09-26 08:22:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-09-26 08:22:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-09-26 08:22:16,227 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:16,227 INFO L375 BasicCegarLoop]: trace histogram [144, 143, 1, 1, 1] [2018-09-26 08:22:16,228 INFO L423 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:16,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:16,228 INFO L82 PathProgramCache]: Analyzing trace with hash 2110879789, now seen corresponding path program 143 times [2018-09-26 08:22:16,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:16,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:17,295 INFO L134 CoverageAnalysis]: Checked inductivity of 20592 backedges. 0 proven. 20592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:17,296 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:17,296 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-09-26 08:22:17,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-09-26 08:22:17,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-09-26 08:22:17,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:22:17,297 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 146 states. [2018-09-26 08:22:18,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:18,695 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-09-26 08:22:18,695 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-09-26 08:22:18,695 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 290 [2018-09-26 08:22:18,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:18,696 INFO L225 Difference]: With dead ends: 295 [2018-09-26 08:22:18,696 INFO L226 Difference]: Without dead ends: 293 [2018-09-26 08:22:18,697 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=289, Invalid=20881, Unknown=0, NotChecked=0, Total=21170 [2018-09-26 08:22:18,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-09-26 08:22:18,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 293. [2018-09-26 08:22:18,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-09-26 08:22:18,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-09-26 08:22:18,704 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-09-26 08:22:18,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:18,704 INFO L480 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-09-26 08:22:18,705 INFO L481 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-09-26 08:22:18,705 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-09-26 08:22:18,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-09-26 08:22:18,705 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:18,705 INFO L375 BasicCegarLoop]: trace histogram [145, 144, 1, 1, 1] [2018-09-26 08:22:18,706 INFO L423 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:18,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:18,706 INFO L82 PathProgramCache]: Analyzing trace with hash 1330965607, now seen corresponding path program 144 times [2018-09-26 08:22:18,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:18,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:19,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20880 backedges. 0 proven. 20880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:19,708 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:19,708 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-09-26 08:22:19,708 INFO L459 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-09-26 08:22:19,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-09-26 08:22:19,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:22:19,710 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 147 states. [2018-09-26 08:22:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:21,179 INFO L93 Difference]: Finished difference Result 297 states and 297 transitions. [2018-09-26 08:22:21,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-09-26 08:22:21,179 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 292 [2018-09-26 08:22:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:21,180 INFO L225 Difference]: With dead ends: 297 [2018-09-26 08:22:21,180 INFO L226 Difference]: Without dead ends: 295 [2018-09-26 08:22:21,182 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=291, Invalid=21171, Unknown=0, NotChecked=0, Total=21462 [2018-09-26 08:22:21,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-09-26 08:22:21,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 295. [2018-09-26 08:22:21,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-09-26 08:22:21,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-09-26 08:22:21,190 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-09-26 08:22:21,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:21,190 INFO L480 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-09-26 08:22:21,190 INFO L481 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-09-26 08:22:21,190 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-09-26 08:22:21,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-09-26 08:22:21,191 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:21,191 INFO L375 BasicCegarLoop]: trace histogram [146, 145, 1, 1, 1] [2018-09-26 08:22:21,191 INFO L423 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:21,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:21,191 INFO L82 PathProgramCache]: Analyzing trace with hash -842253791, now seen corresponding path program 145 times [2018-09-26 08:22:21,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:21,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 21170 backedges. 0 proven. 21170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:22,236 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:22,236 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-09-26 08:22:22,236 INFO L459 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-09-26 08:22:22,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-09-26 08:22:22,237 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:22:22,238 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 148 states. [2018-09-26 08:22:23,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:23,698 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-09-26 08:22:23,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-09-26 08:22:23,699 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 294 [2018-09-26 08:22:23,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:23,699 INFO L225 Difference]: With dead ends: 299 [2018-09-26 08:22:23,700 INFO L226 Difference]: Without dead ends: 297 [2018-09-26 08:22:23,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=21463, Unknown=0, NotChecked=0, Total=21756 [2018-09-26 08:22:23,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-09-26 08:22:23,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2018-09-26 08:22:23,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-09-26 08:22:23,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-09-26 08:22:23,708 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-09-26 08:22:23,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:23,709 INFO L480 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-09-26 08:22:23,709 INFO L481 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-09-26 08:22:23,709 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-09-26 08:22:23,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-09-26 08:22:23,709 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:23,710 INFO L375 BasicCegarLoop]: trace histogram [147, 146, 1, 1, 1] [2018-09-26 08:22:23,710 INFO L423 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:23,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:23,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1951989413, now seen corresponding path program 146 times [2018-09-26 08:22:23,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 21462 backedges. 0 proven. 21462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:24,773 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:24,773 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-09-26 08:22:24,773 INFO L459 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-09-26 08:22:24,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-09-26 08:22:24,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:22:24,774 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 149 states. [2018-09-26 08:22:26,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:26,268 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-09-26 08:22:26,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-09-26 08:22:26,268 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 296 [2018-09-26 08:22:26,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:26,269 INFO L225 Difference]: With dead ends: 301 [2018-09-26 08:22:26,269 INFO L226 Difference]: Without dead ends: 299 [2018-09-26 08:22:26,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=295, Invalid=21757, Unknown=0, NotChecked=0, Total=22052 [2018-09-26 08:22:26,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-09-26 08:22:26,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 299. [2018-09-26 08:22:26,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-09-26 08:22:26,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-09-26 08:22:26,282 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-09-26 08:22:26,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:26,282 INFO L480 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-09-26 08:22:26,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-09-26 08:22:26,282 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-09-26 08:22:26,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-09-26 08:22:26,284 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:26,284 INFO L375 BasicCegarLoop]: trace histogram [148, 147, 1, 1, 1] [2018-09-26 08:22:26,284 INFO L423 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:26,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:26,284 INFO L82 PathProgramCache]: Analyzing trace with hash 1038934549, now seen corresponding path program 147 times [2018-09-26 08:22:26,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:26,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:27,394 INFO L134 CoverageAnalysis]: Checked inductivity of 21756 backedges. 0 proven. 21756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:27,394 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:27,394 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-09-26 08:22:27,395 INFO L459 AbstractCegarLoop]: Interpolant automaton has 150 states [2018-09-26 08:22:27,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 150 interpolants. [2018-09-26 08:22:27,396 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:22:27,396 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 150 states. [2018-09-26 08:22:28,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:28,924 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-09-26 08:22:28,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-09-26 08:22:28,924 INFO L78 Accepts]: Start accepts. Automaton has 150 states. Word has length 298 [2018-09-26 08:22:28,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:28,925 INFO L225 Difference]: With dead ends: 303 [2018-09-26 08:22:28,925 INFO L226 Difference]: Without dead ends: 301 [2018-09-26 08:22:28,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=22053, Unknown=0, NotChecked=0, Total=22350 [2018-09-26 08:22:28,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-09-26 08:22:28,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 301. [2018-09-26 08:22:28,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-09-26 08:22:28,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-09-26 08:22:28,939 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-09-26 08:22:28,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:28,939 INFO L480 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-09-26 08:22:28,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 150 states. [2018-09-26 08:22:28,939 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-09-26 08:22:28,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-09-26 08:22:28,941 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:28,941 INFO L375 BasicCegarLoop]: trace histogram [149, 148, 1, 1, 1] [2018-09-26 08:22:28,941 INFO L423 AbstractCegarLoop]: === Iteration 149 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:28,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:28,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1983741007, now seen corresponding path program 148 times [2018-09-26 08:22:28,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:28,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:30,097 INFO L134 CoverageAnalysis]: Checked inductivity of 22052 backedges. 0 proven. 22052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:30,097 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:30,097 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [150] total 150 [2018-09-26 08:22:30,098 INFO L459 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-09-26 08:22:30,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-09-26 08:22:30,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:22:30,099 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 151 states. [2018-09-26 08:22:31,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:31,607 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-09-26 08:22:31,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-09-26 08:22:31,607 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 300 [2018-09-26 08:22:31,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:31,608 INFO L225 Difference]: With dead ends: 305 [2018-09-26 08:22:31,608 INFO L226 Difference]: Without dead ends: 303 [2018-09-26 08:22:31,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=299, Invalid=22351, Unknown=0, NotChecked=0, Total=22650 [2018-09-26 08:22:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-09-26 08:22:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2018-09-26 08:22:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-09-26 08:22:31,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-09-26 08:22:31,617 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-09-26 08:22:31,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:31,617 INFO L480 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-09-26 08:22:31,617 INFO L481 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-09-26 08:22:31,617 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-09-26 08:22:31,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-09-26 08:22:31,618 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:31,618 INFO L375 BasicCegarLoop]: trace histogram [150, 149, 1, 1, 1] [2018-09-26 08:22:31,618 INFO L423 AbstractCegarLoop]: === Iteration 150 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:31,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:31,619 INFO L82 PathProgramCache]: Analyzing trace with hash -590319607, now seen corresponding path program 149 times [2018-09-26 08:22:31,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:31,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:32,718 INFO L134 CoverageAnalysis]: Checked inductivity of 22350 backedges. 0 proven. 22350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:32,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:32,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-09-26 08:22:32,719 INFO L459 AbstractCegarLoop]: Interpolant automaton has 152 states [2018-09-26 08:22:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 152 interpolants. [2018-09-26 08:22:32,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:22:32,721 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 152 states. [2018-09-26 08:22:34,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:34,272 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-09-26 08:22:34,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-09-26 08:22:34,273 INFO L78 Accepts]: Start accepts. Automaton has 152 states. Word has length 302 [2018-09-26 08:22:34,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:34,273 INFO L225 Difference]: With dead ends: 307 [2018-09-26 08:22:34,273 INFO L226 Difference]: Without dead ends: 305 [2018-09-26 08:22:34,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=22651, Unknown=0, NotChecked=0, Total=22952 [2018-09-26 08:22:34,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-09-26 08:22:34,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2018-09-26 08:22:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-09-26 08:22:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-09-26 08:22:34,282 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-09-26 08:22:34,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:34,282 INFO L480 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-09-26 08:22:34,282 INFO L481 AbstractCegarLoop]: Interpolant automaton has 152 states. [2018-09-26 08:22:34,282 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-09-26 08:22:34,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-09-26 08:22:34,283 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:34,283 INFO L375 BasicCegarLoop]: trace histogram [151, 150, 1, 1, 1] [2018-09-26 08:22:34,283 INFO L423 AbstractCegarLoop]: === Iteration 151 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:34,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:34,283 INFO L82 PathProgramCache]: Analyzing trace with hash -361407165, now seen corresponding path program 150 times [2018-09-26 08:22:34,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:35,408 INFO L134 CoverageAnalysis]: Checked inductivity of 22650 backedges. 0 proven. 22650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:35,409 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:35,409 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [152] total 152 [2018-09-26 08:22:35,409 INFO L459 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-09-26 08:22:35,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-09-26 08:22:35,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:22:35,411 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 153 states. [2018-09-26 08:22:36,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:36,996 INFO L93 Difference]: Finished difference Result 309 states and 309 transitions. [2018-09-26 08:22:36,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-09-26 08:22:36,996 INFO L78 Accepts]: Start accepts. Automaton has 153 states. Word has length 304 [2018-09-26 08:22:36,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:36,997 INFO L225 Difference]: With dead ends: 309 [2018-09-26 08:22:36,997 INFO L226 Difference]: Without dead ends: 307 [2018-09-26 08:22:36,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=303, Invalid=22953, Unknown=0, NotChecked=0, Total=23256 [2018-09-26 08:22:36,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-09-26 08:22:37,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 307. [2018-09-26 08:22:37,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 307 states. [2018-09-26 08:22:37,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 307 states to 307 states and 307 transitions. [2018-09-26 08:22:37,007 INFO L78 Accepts]: Start accepts. Automaton has 307 states and 307 transitions. Word has length 304 [2018-09-26 08:22:37,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:37,008 INFO L480 AbstractCegarLoop]: Abstraction has 307 states and 307 transitions. [2018-09-26 08:22:37,008 INFO L481 AbstractCegarLoop]: Interpolant automaton has 153 states. [2018-09-26 08:22:37,008 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 307 transitions. [2018-09-26 08:22:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-09-26 08:22:37,009 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:37,009 INFO L375 BasicCegarLoop]: trace histogram [152, 151, 1, 1, 1] [2018-09-26 08:22:37,009 INFO L423 AbstractCegarLoop]: === Iteration 152 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:37,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:37,009 INFO L82 PathProgramCache]: Analyzing trace with hash 580117501, now seen corresponding path program 151 times [2018-09-26 08:22:37,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:37,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 22952 backedges. 0 proven. 22952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:38,197 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:38,197 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-09-26 08:22:38,198 INFO L459 AbstractCegarLoop]: Interpolant automaton has 154 states [2018-09-26 08:22:38,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 154 interpolants. [2018-09-26 08:22:38,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:22:38,199 INFO L87 Difference]: Start difference. First operand 307 states and 307 transitions. Second operand 154 states. [2018-09-26 08:22:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:39,756 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-09-26 08:22:39,756 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-09-26 08:22:39,756 INFO L78 Accepts]: Start accepts. Automaton has 154 states. Word has length 306 [2018-09-26 08:22:39,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:39,757 INFO L225 Difference]: With dead ends: 311 [2018-09-26 08:22:39,758 INFO L226 Difference]: Without dead ends: 309 [2018-09-26 08:22:39,759 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=23257, Unknown=0, NotChecked=0, Total=23562 [2018-09-26 08:22:39,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2018-09-26 08:22:39,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 309. [2018-09-26 08:22:39,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-09-26 08:22:39,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-09-26 08:22:39,771 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 306 [2018-09-26 08:22:39,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:39,772 INFO L480 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-09-26 08:22:39,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 154 states. [2018-09-26 08:22:39,772 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-09-26 08:22:39,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-09-26 08:22:39,773 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:39,774 INFO L375 BasicCegarLoop]: trace histogram [153, 152, 1, 1, 1] [2018-09-26 08:22:39,774 INFO L423 AbstractCegarLoop]: === Iteration 153 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:39,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:39,774 INFO L82 PathProgramCache]: Analyzing trace with hash -852777929, now seen corresponding path program 152 times [2018-09-26 08:22:39,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:39,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:40,999 INFO L134 CoverageAnalysis]: Checked inductivity of 23256 backedges. 0 proven. 23256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:40,999 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:40,999 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [154] total 154 [2018-09-26 08:22:41,000 INFO L459 AbstractCegarLoop]: Interpolant automaton has 155 states [2018-09-26 08:22:41,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 155 interpolants. [2018-09-26 08:22:41,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:22:41,001 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 155 states. [2018-09-26 08:22:42,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:42,665 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-09-26 08:22:42,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-09-26 08:22:42,665 INFO L78 Accepts]: Start accepts. Automaton has 155 states. Word has length 308 [2018-09-26 08:22:42,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:42,666 INFO L225 Difference]: With dead ends: 313 [2018-09-26 08:22:42,666 INFO L226 Difference]: Without dead ends: 311 [2018-09-26 08:22:42,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=23563, Unknown=0, NotChecked=0, Total=23870 [2018-09-26 08:22:42,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-09-26 08:22:42,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 311. [2018-09-26 08:22:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-09-26 08:22:42,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-09-26 08:22:42,674 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 308 [2018-09-26 08:22:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:42,675 INFO L480 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-09-26 08:22:42,675 INFO L481 AbstractCegarLoop]: Interpolant automaton has 155 states. [2018-09-26 08:22:42,675 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-09-26 08:22:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-09-26 08:22:42,676 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:42,676 INFO L375 BasicCegarLoop]: trace histogram [154, 153, 1, 1, 1] [2018-09-26 08:22:42,676 INFO L423 AbstractCegarLoop]: === Iteration 154 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:42,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:42,676 INFO L82 PathProgramCache]: Analyzing trace with hash 819215857, now seen corresponding path program 153 times [2018-09-26 08:22:42,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:43,820 INFO L134 CoverageAnalysis]: Checked inductivity of 23562 backedges. 0 proven. 23562 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:43,820 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:43,820 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [155] total 155 [2018-09-26 08:22:43,820 INFO L459 AbstractCegarLoop]: Interpolant automaton has 156 states [2018-09-26 08:22:43,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 156 interpolants. [2018-09-26 08:22:43,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:22:43,822 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 156 states. [2018-09-26 08:22:45,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:45,480 INFO L93 Difference]: Finished difference Result 315 states and 315 transitions. [2018-09-26 08:22:45,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-09-26 08:22:45,481 INFO L78 Accepts]: Start accepts. Automaton has 156 states. Word has length 310 [2018-09-26 08:22:45,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:45,481 INFO L225 Difference]: With dead ends: 315 [2018-09-26 08:22:45,481 INFO L226 Difference]: Without dead ends: 313 [2018-09-26 08:22:45,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=309, Invalid=23871, Unknown=0, NotChecked=0, Total=24180 [2018-09-26 08:22:45,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-09-26 08:22:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 313. [2018-09-26 08:22:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-09-26 08:22:45,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-09-26 08:22:45,491 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 310 [2018-09-26 08:22:45,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:45,491 INFO L480 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-09-26 08:22:45,491 INFO L481 AbstractCegarLoop]: Interpolant automaton has 156 states. [2018-09-26 08:22:45,491 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-09-26 08:22:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-09-26 08:22:45,492 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:45,492 INFO L375 BasicCegarLoop]: trace histogram [155, 154, 1, 1, 1] [2018-09-26 08:22:45,492 INFO L423 AbstractCegarLoop]: === Iteration 155 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:45,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:45,492 INFO L82 PathProgramCache]: Analyzing trace with hash 1287475499, now seen corresponding path program 154 times [2018-09-26 08:22:45,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:46,690 INFO L134 CoverageAnalysis]: Checked inductivity of 23870 backedges. 0 proven. 23870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:46,690 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:46,690 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [156] total 156 [2018-09-26 08:22:46,690 INFO L459 AbstractCegarLoop]: Interpolant automaton has 157 states [2018-09-26 08:22:46,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 157 interpolants. [2018-09-26 08:22:46,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:22:46,691 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 157 states. [2018-09-26 08:22:48,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:48,316 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-09-26 08:22:48,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-09-26 08:22:48,316 INFO L78 Accepts]: Start accepts. Automaton has 157 states. Word has length 312 [2018-09-26 08:22:48,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:48,317 INFO L225 Difference]: With dead ends: 317 [2018-09-26 08:22:48,317 INFO L226 Difference]: Without dead ends: 315 [2018-09-26 08:22:48,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=311, Invalid=24181, Unknown=0, NotChecked=0, Total=24492 [2018-09-26 08:22:48,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-09-26 08:22:48,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2018-09-26 08:22:48,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-09-26 08:22:48,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-09-26 08:22:48,330 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 312 [2018-09-26 08:22:48,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:48,331 INFO L480 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-09-26 08:22:48,331 INFO L481 AbstractCegarLoop]: Interpolant automaton has 157 states. [2018-09-26 08:22:48,331 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-09-26 08:22:48,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-09-26 08:22:48,332 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:48,332 INFO L375 BasicCegarLoop]: trace histogram [156, 155, 1, 1, 1] [2018-09-26 08:22:48,333 INFO L423 AbstractCegarLoop]: === Iteration 156 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:48,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:48,333 INFO L82 PathProgramCache]: Analyzing trace with hash 313425381, now seen corresponding path program 155 times [2018-09-26 08:22:48,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:48,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:49,619 INFO L134 CoverageAnalysis]: Checked inductivity of 24180 backedges. 0 proven. 24180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:49,620 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:49,620 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [157] total 157 [2018-09-26 08:22:49,620 INFO L459 AbstractCegarLoop]: Interpolant automaton has 158 states [2018-09-26 08:22:49,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 158 interpolants. [2018-09-26 08:22:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:22:49,622 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 158 states. [2018-09-26 08:22:51,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:51,316 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-09-26 08:22:51,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-09-26 08:22:51,317 INFO L78 Accepts]: Start accepts. Automaton has 158 states. Word has length 314 [2018-09-26 08:22:51,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:51,317 INFO L225 Difference]: With dead ends: 319 [2018-09-26 08:22:51,317 INFO L226 Difference]: Without dead ends: 317 [2018-09-26 08:22:51,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=313, Invalid=24493, Unknown=0, NotChecked=0, Total=24806 [2018-09-26 08:22:51,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-09-26 08:22:51,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 317. [2018-09-26 08:22:51,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-09-26 08:22:51,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-09-26 08:22:51,325 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 314 [2018-09-26 08:22:51,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:51,325 INFO L480 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-09-26 08:22:51,325 INFO L481 AbstractCegarLoop]: Interpolant automaton has 158 states. [2018-09-26 08:22:51,326 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-09-26 08:22:51,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-09-26 08:22:51,327 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:51,327 INFO L375 BasicCegarLoop]: trace histogram [157, 156, 1, 1, 1] [2018-09-26 08:22:51,327 INFO L423 AbstractCegarLoop]: === Iteration 157 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:51,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:51,328 INFO L82 PathProgramCache]: Analyzing trace with hash 554132511, now seen corresponding path program 156 times [2018-09-26 08:22:51,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:51,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 24492 backedges. 0 proven. 24492 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:52,533 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:52,533 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [158] total 158 [2018-09-26 08:22:52,533 INFO L459 AbstractCegarLoop]: Interpolant automaton has 159 states [2018-09-26 08:22:52,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 159 interpolants. [2018-09-26 08:22:52,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:22:52,535 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 159 states. [2018-09-26 08:22:54,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:54,235 INFO L93 Difference]: Finished difference Result 321 states and 321 transitions. [2018-09-26 08:22:54,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-09-26 08:22:54,235 INFO L78 Accepts]: Start accepts. Automaton has 159 states. Word has length 316 [2018-09-26 08:22:54,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:54,236 INFO L225 Difference]: With dead ends: 321 [2018-09-26 08:22:54,236 INFO L226 Difference]: Without dead ends: 319 [2018-09-26 08:22:54,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=315, Invalid=24807, Unknown=0, NotChecked=0, Total=25122 [2018-09-26 08:22:54,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-09-26 08:22:54,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 319. [2018-09-26 08:22:54,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-09-26 08:22:54,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-09-26 08:22:54,246 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 316 [2018-09-26 08:22:54,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:54,246 INFO L480 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-09-26 08:22:54,246 INFO L481 AbstractCegarLoop]: Interpolant automaton has 159 states. [2018-09-26 08:22:54,246 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-09-26 08:22:54,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-09-26 08:22:54,247 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:54,247 INFO L375 BasicCegarLoop]: trace histogram [158, 157, 1, 1, 1] [2018-09-26 08:22:54,248 INFO L423 AbstractCegarLoop]: === Iteration 158 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:54,248 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:54,248 INFO L82 PathProgramCache]: Analyzing trace with hash -54549543, now seen corresponding path program 157 times [2018-09-26 08:22:54,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:54,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:55,511 INFO L134 CoverageAnalysis]: Checked inductivity of 24806 backedges. 0 proven. 24806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:55,511 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:55,511 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [159] total 159 [2018-09-26 08:22:55,511 INFO L459 AbstractCegarLoop]: Interpolant automaton has 160 states [2018-09-26 08:22:55,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 160 interpolants. [2018-09-26 08:22:55,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:22:55,512 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 160 states. [2018-09-26 08:22:57,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:22:57,146 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-09-26 08:22:57,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 160 states. [2018-09-26 08:22:57,146 INFO L78 Accepts]: Start accepts. Automaton has 160 states. Word has length 318 [2018-09-26 08:22:57,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:22:57,147 INFO L225 Difference]: With dead ends: 323 [2018-09-26 08:22:57,147 INFO L226 Difference]: Without dead ends: 321 [2018-09-26 08:22:57,148 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=317, Invalid=25123, Unknown=0, NotChecked=0, Total=25440 [2018-09-26 08:22:57,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2018-09-26 08:22:57,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 321. [2018-09-26 08:22:57,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-09-26 08:22:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-09-26 08:22:57,156 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 318 [2018-09-26 08:22:57,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:22:57,156 INFO L480 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-09-26 08:22:57,156 INFO L481 AbstractCegarLoop]: Interpolant automaton has 160 states. [2018-09-26 08:22:57,156 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-09-26 08:22:57,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-09-26 08:22:57,157 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:22:57,157 INFO L375 BasicCegarLoop]: trace histogram [159, 158, 1, 1, 1] [2018-09-26 08:22:57,157 INFO L423 AbstractCegarLoop]: === Iteration 159 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:22:57,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:22:57,158 INFO L82 PathProgramCache]: Analyzing trace with hash -882451181, now seen corresponding path program 158 times [2018-09-26 08:22:57,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:22:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:22:58,374 INFO L134 CoverageAnalysis]: Checked inductivity of 25122 backedges. 0 proven. 25122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:22:58,374 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:22:58,374 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [160] total 160 [2018-09-26 08:22:58,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 161 states [2018-09-26 08:22:58,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 161 interpolants. [2018-09-26 08:22:58,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:22:58,376 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 161 states. [2018-09-26 08:23:00,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:00,048 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-09-26 08:23:00,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-09-26 08:23:00,048 INFO L78 Accepts]: Start accepts. Automaton has 161 states. Word has length 320 [2018-09-26 08:23:00,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:00,049 INFO L225 Difference]: With dead ends: 325 [2018-09-26 08:23:00,049 INFO L226 Difference]: Without dead ends: 323 [2018-09-26 08:23:00,050 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 159 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=319, Invalid=25441, Unknown=0, NotChecked=0, Total=25760 [2018-09-26 08:23:00,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-09-26 08:23:00,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 323. [2018-09-26 08:23:00,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-09-26 08:23:00,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-09-26 08:23:00,058 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 320 [2018-09-26 08:23:00,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:00,058 INFO L480 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-09-26 08:23:00,058 INFO L481 AbstractCegarLoop]: Interpolant automaton has 161 states. [2018-09-26 08:23:00,058 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-09-26 08:23:00,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-09-26 08:23:00,059 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:00,059 INFO L375 BasicCegarLoop]: trace histogram [160, 159, 1, 1, 1] [2018-09-26 08:23:00,059 INFO L423 AbstractCegarLoop]: === Iteration 160 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:00,059 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:00,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1926975539, now seen corresponding path program 159 times [2018-09-26 08:23:00,060 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:00,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:01,348 INFO L134 CoverageAnalysis]: Checked inductivity of 25440 backedges. 0 proven. 25440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:01,349 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:01,349 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [161] total 161 [2018-09-26 08:23:01,349 INFO L459 AbstractCegarLoop]: Interpolant automaton has 162 states [2018-09-26 08:23:01,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 162 interpolants. [2018-09-26 08:23:01,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:23:01,351 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 162 states. [2018-09-26 08:23:03,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:03,107 INFO L93 Difference]: Finished difference Result 327 states and 327 transitions. [2018-09-26 08:23:03,107 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-09-26 08:23:03,107 INFO L78 Accepts]: Start accepts. Automaton has 162 states. Word has length 322 [2018-09-26 08:23:03,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:03,108 INFO L225 Difference]: With dead ends: 327 [2018-09-26 08:23:03,108 INFO L226 Difference]: Without dead ends: 325 [2018-09-26 08:23:03,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=321, Invalid=25761, Unknown=0, NotChecked=0, Total=26082 [2018-09-26 08:23:03,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-09-26 08:23:03,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2018-09-26 08:23:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-09-26 08:23:03,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 325 transitions. [2018-09-26 08:23:03,118 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 325 transitions. Word has length 322 [2018-09-26 08:23:03,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:03,118 INFO L480 AbstractCegarLoop]: Abstraction has 325 states and 325 transitions. [2018-09-26 08:23:03,118 INFO L481 AbstractCegarLoop]: Interpolant automaton has 162 states. [2018-09-26 08:23:03,118 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 325 transitions. [2018-09-26 08:23:03,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-09-26 08:23:03,119 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:03,119 INFO L375 BasicCegarLoop]: trace histogram [161, 160, 1, 1, 1] [2018-09-26 08:23:03,120 INFO L423 AbstractCegarLoop]: === Iteration 161 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:03,120 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:03,120 INFO L82 PathProgramCache]: Analyzing trace with hash -692536313, now seen corresponding path program 160 times [2018-09-26 08:23:03,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:03,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:04,414 INFO L134 CoverageAnalysis]: Checked inductivity of 25760 backedges. 0 proven. 25760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:04,414 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:04,414 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2018-09-26 08:23:04,415 INFO L459 AbstractCegarLoop]: Interpolant automaton has 163 states [2018-09-26 08:23:04,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2018-09-26 08:23:04,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:23:04,416 INFO L87 Difference]: Start difference. First operand 325 states and 325 transitions. Second operand 163 states. [2018-09-26 08:23:06,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:06,159 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-09-26 08:23:06,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-09-26 08:23:06,159 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 324 [2018-09-26 08:23:06,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:06,160 INFO L225 Difference]: With dead ends: 329 [2018-09-26 08:23:06,160 INFO L226 Difference]: Without dead ends: 327 [2018-09-26 08:23:06,162 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=323, Invalid=26083, Unknown=0, NotChecked=0, Total=26406 [2018-09-26 08:23:06,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-09-26 08:23:06,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 327. [2018-09-26 08:23:06,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-09-26 08:23:06,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-09-26 08:23:06,170 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 324 [2018-09-26 08:23:06,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:06,170 INFO L480 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-09-26 08:23:06,170 INFO L481 AbstractCegarLoop]: Interpolant automaton has 163 states. [2018-09-26 08:23:06,170 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-09-26 08:23:06,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-09-26 08:23:06,171 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:06,171 INFO L375 BasicCegarLoop]: trace histogram [162, 161, 1, 1, 1] [2018-09-26 08:23:06,171 INFO L423 AbstractCegarLoop]: === Iteration 162 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:06,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:06,171 INFO L82 PathProgramCache]: Analyzing trace with hash 192586177, now seen corresponding path program 161 times [2018-09-26 08:23:06,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:06,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 26082 backedges. 0 proven. 26082 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:07,491 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:07,491 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [163] total 163 [2018-09-26 08:23:07,491 INFO L459 AbstractCegarLoop]: Interpolant automaton has 164 states [2018-09-26 08:23:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 164 interpolants. [2018-09-26 08:23:07,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:23:07,493 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 164 states. [2018-09-26 08:23:09,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:09,254 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-09-26 08:23:09,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-09-26 08:23:09,254 INFO L78 Accepts]: Start accepts. Automaton has 164 states. Word has length 326 [2018-09-26 08:23:09,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:09,255 INFO L225 Difference]: With dead ends: 331 [2018-09-26 08:23:09,255 INFO L226 Difference]: Without dead ends: 329 [2018-09-26 08:23:09,256 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=325, Invalid=26407, Unknown=0, NotChecked=0, Total=26732 [2018-09-26 08:23:09,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-09-26 08:23:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 329. [2018-09-26 08:23:09,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-09-26 08:23:09,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-09-26 08:23:09,264 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 326 [2018-09-26 08:23:09,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:09,264 INFO L480 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-09-26 08:23:09,264 INFO L481 AbstractCegarLoop]: Interpolant automaton has 164 states. [2018-09-26 08:23:09,264 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-09-26 08:23:09,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-09-26 08:23:09,265 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:09,265 INFO L375 BasicCegarLoop]: trace histogram [163, 162, 1, 1, 1] [2018-09-26 08:23:09,265 INFO L423 AbstractCegarLoop]: === Iteration 163 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:09,265 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:09,266 INFO L82 PathProgramCache]: Analyzing trace with hash 391774459, now seen corresponding path program 162 times [2018-09-26 08:23:09,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:09,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:10,555 INFO L134 CoverageAnalysis]: Checked inductivity of 26406 backedges. 0 proven. 26406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:10,555 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:10,556 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [164] total 164 [2018-09-26 08:23:10,556 INFO L459 AbstractCegarLoop]: Interpolant automaton has 165 states [2018-09-26 08:23:10,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 165 interpolants. [2018-09-26 08:23:10,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:23:10,558 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 165 states. [2018-09-26 08:23:12,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:12,400 INFO L93 Difference]: Finished difference Result 333 states and 333 transitions. [2018-09-26 08:23:12,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-09-26 08:23:12,400 INFO L78 Accepts]: Start accepts. Automaton has 165 states. Word has length 328 [2018-09-26 08:23:12,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:12,401 INFO L225 Difference]: With dead ends: 333 [2018-09-26 08:23:12,401 INFO L226 Difference]: Without dead ends: 331 [2018-09-26 08:23:12,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=327, Invalid=26733, Unknown=0, NotChecked=0, Total=27060 [2018-09-26 08:23:12,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-09-26 08:23:12,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 331. [2018-09-26 08:23:12,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2018-09-26 08:23:12,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 331 transitions. [2018-09-26 08:23:12,410 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 331 transitions. Word has length 328 [2018-09-26 08:23:12,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:12,410 INFO L480 AbstractCegarLoop]: Abstraction has 331 states and 331 transitions. [2018-09-26 08:23:12,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has 165 states. [2018-09-26 08:23:12,410 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 331 transitions. [2018-09-26 08:23:12,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-09-26 08:23:12,411 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:12,411 INFO L375 BasicCegarLoop]: trace histogram [164, 163, 1, 1, 1] [2018-09-26 08:23:12,411 INFO L423 AbstractCegarLoop]: === Iteration 164 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:12,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:12,412 INFO L82 PathProgramCache]: Analyzing trace with hash -1461814859, now seen corresponding path program 163 times [2018-09-26 08:23:12,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:12,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:13,719 INFO L134 CoverageAnalysis]: Checked inductivity of 26732 backedges. 0 proven. 26732 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:13,719 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:13,719 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [165] total 165 [2018-09-26 08:23:13,720 INFO L459 AbstractCegarLoop]: Interpolant automaton has 166 states [2018-09-26 08:23:13,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 166 interpolants. [2018-09-26 08:23:13,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:23:13,721 INFO L87 Difference]: Start difference. First operand 331 states and 331 transitions. Second operand 166 states. [2018-09-26 08:23:15,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:15,610 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-09-26 08:23:15,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-09-26 08:23:15,611 INFO L78 Accepts]: Start accepts. Automaton has 166 states. Word has length 330 [2018-09-26 08:23:15,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:15,612 INFO L225 Difference]: With dead ends: 335 [2018-09-26 08:23:15,612 INFO L226 Difference]: Without dead ends: 333 [2018-09-26 08:23:15,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=329, Invalid=27061, Unknown=0, NotChecked=0, Total=27390 [2018-09-26 08:23:15,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-09-26 08:23:15,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2018-09-26 08:23:15,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-09-26 08:23:15,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-09-26 08:23:15,628 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 330 [2018-09-26 08:23:15,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:15,629 INFO L480 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-09-26 08:23:15,629 INFO L481 AbstractCegarLoop]: Interpolant automaton has 166 states. [2018-09-26 08:23:15,629 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-09-26 08:23:15,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-09-26 08:23:15,630 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:15,630 INFO L375 BasicCegarLoop]: trace histogram [165, 164, 1, 1, 1] [2018-09-26 08:23:15,631 INFO L423 AbstractCegarLoop]: === Iteration 165 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:15,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:15,631 INFO L82 PathProgramCache]: Analyzing trace with hash -349721617, now seen corresponding path program 164 times [2018-09-26 08:23:15,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:15,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:17,160 INFO L134 CoverageAnalysis]: Checked inductivity of 27060 backedges. 0 proven. 27060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:17,161 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:17,161 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [166] total 166 [2018-09-26 08:23:17,161 INFO L459 AbstractCegarLoop]: Interpolant automaton has 167 states [2018-09-26 08:23:17,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 167 interpolants. [2018-09-26 08:23:17,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:23:17,163 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 167 states. [2018-09-26 08:23:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:19,043 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-09-26 08:23:19,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-09-26 08:23:19,043 INFO L78 Accepts]: Start accepts. Automaton has 167 states. Word has length 332 [2018-09-26 08:23:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:19,044 INFO L225 Difference]: With dead ends: 337 [2018-09-26 08:23:19,044 INFO L226 Difference]: Without dead ends: 335 [2018-09-26 08:23:19,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=331, Invalid=27391, Unknown=0, NotChecked=0, Total=27722 [2018-09-26 08:23:19,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-09-26 08:23:19,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 335. [2018-09-26 08:23:19,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-09-26 08:23:19,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-09-26 08:23:19,055 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 332 [2018-09-26 08:23:19,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:19,055 INFO L480 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-09-26 08:23:19,055 INFO L481 AbstractCegarLoop]: Interpolant automaton has 167 states. [2018-09-26 08:23:19,055 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-09-26 08:23:19,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-09-26 08:23:19,056 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:19,056 INFO L375 BasicCegarLoop]: trace histogram [166, 165, 1, 1, 1] [2018-09-26 08:23:19,056 INFO L423 AbstractCegarLoop]: === Iteration 166 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:19,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:19,057 INFO L82 PathProgramCache]: Analyzing trace with hash -1074972759, now seen corresponding path program 165 times [2018-09-26 08:23:19,057 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:19,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 27390 backedges. 0 proven. 27390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:20,443 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:20,443 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [167] total 167 [2018-09-26 08:23:20,443 INFO L459 AbstractCegarLoop]: Interpolant automaton has 168 states [2018-09-26 08:23:20,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 168 interpolants. [2018-09-26 08:23:20,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:23:20,444 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 168 states. [2018-09-26 08:23:22,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:22,250 INFO L93 Difference]: Finished difference Result 339 states and 339 transitions. [2018-09-26 08:23:22,250 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-09-26 08:23:22,250 INFO L78 Accepts]: Start accepts. Automaton has 168 states. Word has length 334 [2018-09-26 08:23:22,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:22,251 INFO L225 Difference]: With dead ends: 339 [2018-09-26 08:23:22,251 INFO L226 Difference]: Without dead ends: 337 [2018-09-26 08:23:22,252 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=333, Invalid=27723, Unknown=0, NotChecked=0, Total=28056 [2018-09-26 08:23:22,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-09-26 08:23:22,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 337. [2018-09-26 08:23:22,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-09-26 08:23:22,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 337 transitions. [2018-09-26 08:23:22,261 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 337 transitions. Word has length 334 [2018-09-26 08:23:22,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:22,261 INFO L480 AbstractCegarLoop]: Abstraction has 337 states and 337 transitions. [2018-09-26 08:23:22,261 INFO L481 AbstractCegarLoop]: Interpolant automaton has 168 states. [2018-09-26 08:23:22,261 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 337 transitions. [2018-09-26 08:23:22,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-09-26 08:23:22,262 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:22,262 INFO L375 BasicCegarLoop]: trace histogram [167, 166, 1, 1, 1] [2018-09-26 08:23:22,262 INFO L423 AbstractCegarLoop]: === Iteration 167 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:22,262 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:22,262 INFO L82 PathProgramCache]: Analyzing trace with hash 2038349027, now seen corresponding path program 166 times [2018-09-26 08:23:22,263 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:22,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:23,618 INFO L134 CoverageAnalysis]: Checked inductivity of 27722 backedges. 0 proven. 27722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:23,619 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:23,619 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [168] total 168 [2018-09-26 08:23:23,619 INFO L459 AbstractCegarLoop]: Interpolant automaton has 169 states [2018-09-26 08:23:23,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 169 interpolants. [2018-09-26 08:23:23,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:23:23,621 INFO L87 Difference]: Start difference. First operand 337 states and 337 transitions. Second operand 169 states. [2018-09-26 08:23:25,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:25,546 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-09-26 08:23:25,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-09-26 08:23:25,546 INFO L78 Accepts]: Start accepts. Automaton has 169 states. Word has length 336 [2018-09-26 08:23:25,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:25,547 INFO L225 Difference]: With dead ends: 341 [2018-09-26 08:23:25,547 INFO L226 Difference]: Without dead ends: 339 [2018-09-26 08:23:25,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=335, Invalid=28057, Unknown=0, NotChecked=0, Total=28392 [2018-09-26 08:23:25,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-09-26 08:23:25,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 339. [2018-09-26 08:23:25,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-09-26 08:23:25,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-09-26 08:23:25,556 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 336 [2018-09-26 08:23:25,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:25,556 INFO L480 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-09-26 08:23:25,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 169 states. [2018-09-26 08:23:25,556 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-09-26 08:23:25,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-09-26 08:23:25,557 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:25,557 INFO L375 BasicCegarLoop]: trace histogram [168, 167, 1, 1, 1] [2018-09-26 08:23:25,558 INFO L423 AbstractCegarLoop]: === Iteration 168 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:25,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:25,558 INFO L82 PathProgramCache]: Analyzing trace with hash 348380061, now seen corresponding path program 167 times [2018-09-26 08:23:25,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:25,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:27,001 INFO L134 CoverageAnalysis]: Checked inductivity of 28056 backedges. 0 proven. 28056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:27,001 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:27,001 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [169] total 169 [2018-09-26 08:23:27,001 INFO L459 AbstractCegarLoop]: Interpolant automaton has 170 states [2018-09-26 08:23:27,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 170 interpolants. [2018-09-26 08:23:27,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:23:27,003 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 170 states. [2018-09-26 08:23:28,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:28,989 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-09-26 08:23:28,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-09-26 08:23:28,989 INFO L78 Accepts]: Start accepts. Automaton has 170 states. Word has length 338 [2018-09-26 08:23:28,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:28,989 INFO L225 Difference]: With dead ends: 343 [2018-09-26 08:23:28,990 INFO L226 Difference]: Without dead ends: 341 [2018-09-26 08:23:28,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=337, Invalid=28393, Unknown=0, NotChecked=0, Total=28730 [2018-09-26 08:23:28,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-09-26 08:23:28,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 341. [2018-09-26 08:23:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-09-26 08:23:28,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-09-26 08:23:28,999 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 338 [2018-09-26 08:23:28,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:28,999 INFO L480 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-09-26 08:23:28,999 INFO L481 AbstractCegarLoop]: Interpolant automaton has 170 states. [2018-09-26 08:23:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-09-26 08:23:29,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-09-26 08:23:29,000 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:29,000 INFO L375 BasicCegarLoop]: trace histogram [169, 168, 1, 1, 1] [2018-09-26 08:23:29,000 INFO L423 AbstractCegarLoop]: === Iteration 169 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:29,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:29,001 INFO L82 PathProgramCache]: Analyzing trace with hash -214158377, now seen corresponding path program 168 times [2018-09-26 08:23:29,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:29,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:30,399 INFO L134 CoverageAnalysis]: Checked inductivity of 28392 backedges. 0 proven. 28392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:30,399 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:30,399 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [170] total 170 [2018-09-26 08:23:30,399 INFO L459 AbstractCegarLoop]: Interpolant automaton has 171 states [2018-09-26 08:23:30,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 171 interpolants. [2018-09-26 08:23:30,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:23:30,401 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 171 states. [2018-09-26 08:23:32,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:32,431 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-09-26 08:23:32,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-09-26 08:23:32,431 INFO L78 Accepts]: Start accepts. Automaton has 171 states. Word has length 340 [2018-09-26 08:23:32,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:32,432 INFO L225 Difference]: With dead ends: 345 [2018-09-26 08:23:32,432 INFO L226 Difference]: Without dead ends: 343 [2018-09-26 08:23:32,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=339, Invalid=28731, Unknown=0, NotChecked=0, Total=29070 [2018-09-26 08:23:32,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-09-26 08:23:32,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 343. [2018-09-26 08:23:32,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-09-26 08:23:32,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-09-26 08:23:32,443 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 340 [2018-09-26 08:23:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:32,443 INFO L480 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-09-26 08:23:32,443 INFO L481 AbstractCegarLoop]: Interpolant automaton has 171 states. [2018-09-26 08:23:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-09-26 08:23:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-09-26 08:23:32,444 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:32,444 INFO L375 BasicCegarLoop]: trace histogram [170, 169, 1, 1, 1] [2018-09-26 08:23:32,444 INFO L423 AbstractCegarLoop]: === Iteration 170 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:32,445 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:32,445 INFO L82 PathProgramCache]: Analyzing trace with hash 352282001, now seen corresponding path program 169 times [2018-09-26 08:23:32,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:32,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:33,862 INFO L134 CoverageAnalysis]: Checked inductivity of 28730 backedges. 0 proven. 28730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:33,862 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:33,862 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [171] total 171 [2018-09-26 08:23:33,863 INFO L459 AbstractCegarLoop]: Interpolant automaton has 172 states [2018-09-26 08:23:33,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 172 interpolants. [2018-09-26 08:23:33,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:23:33,864 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 172 states. [2018-09-26 08:23:35,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:35,846 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-09-26 08:23:35,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 172 states. [2018-09-26 08:23:35,846 INFO L78 Accepts]: Start accepts. Automaton has 172 states. Word has length 342 [2018-09-26 08:23:35,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:35,847 INFO L225 Difference]: With dead ends: 347 [2018-09-26 08:23:35,847 INFO L226 Difference]: Without dead ends: 345 [2018-09-26 08:23:35,849 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=341, Invalid=29071, Unknown=0, NotChecked=0, Total=29412 [2018-09-26 08:23:35,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-09-26 08:23:35,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 345. [2018-09-26 08:23:35,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-09-26 08:23:35,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-09-26 08:23:35,858 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 342 [2018-09-26 08:23:35,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:35,858 INFO L480 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-09-26 08:23:35,858 INFO L481 AbstractCegarLoop]: Interpolant automaton has 172 states. [2018-09-26 08:23:35,858 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-09-26 08:23:35,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-09-26 08:23:35,859 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:35,859 INFO L375 BasicCegarLoop]: trace histogram [171, 170, 1, 1, 1] [2018-09-26 08:23:35,860 INFO L423 AbstractCegarLoop]: === Iteration 171 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:35,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:35,860 INFO L82 PathProgramCache]: Analyzing trace with hash -759361333, now seen corresponding path program 170 times [2018-09-26 08:23:35,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:35,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:37,316 INFO L134 CoverageAnalysis]: Checked inductivity of 29070 backedges. 0 proven. 29070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:37,317 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:37,317 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [172] total 172 [2018-09-26 08:23:37,317 INFO L459 AbstractCegarLoop]: Interpolant automaton has 173 states [2018-09-26 08:23:37,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 173 interpolants. [2018-09-26 08:23:37,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:23:37,319 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 173 states. [2018-09-26 08:23:39,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:39,280 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-09-26 08:23:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-09-26 08:23:39,281 INFO L78 Accepts]: Start accepts. Automaton has 173 states. Word has length 344 [2018-09-26 08:23:39,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:39,281 INFO L225 Difference]: With dead ends: 349 [2018-09-26 08:23:39,281 INFO L226 Difference]: Without dead ends: 347 [2018-09-26 08:23:39,282 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=343, Invalid=29413, Unknown=0, NotChecked=0, Total=29756 [2018-09-26 08:23:39,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-09-26 08:23:39,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2018-09-26 08:23:39,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-09-26 08:23:39,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-09-26 08:23:39,291 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 344 [2018-09-26 08:23:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:39,291 INFO L480 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-09-26 08:23:39,291 INFO L481 AbstractCegarLoop]: Interpolant automaton has 173 states. [2018-09-26 08:23:39,292 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-09-26 08:23:39,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-09-26 08:23:39,293 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:39,293 INFO L375 BasicCegarLoop]: trace histogram [172, 171, 1, 1, 1] [2018-09-26 08:23:39,293 INFO L423 AbstractCegarLoop]: === Iteration 172 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:39,293 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:39,293 INFO L82 PathProgramCache]: Analyzing trace with hash 398251397, now seen corresponding path program 171 times [2018-09-26 08:23:39,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:40,807 INFO L134 CoverageAnalysis]: Checked inductivity of 29412 backedges. 0 proven. 29412 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:40,807 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:40,808 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [173] total 173 [2018-09-26 08:23:40,808 INFO L459 AbstractCegarLoop]: Interpolant automaton has 174 states [2018-09-26 08:23:40,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 174 interpolants. [2018-09-26 08:23:40,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:23:40,809 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 174 states. [2018-09-26 08:23:42,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:42,784 INFO L93 Difference]: Finished difference Result 351 states and 351 transitions. [2018-09-26 08:23:42,784 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-09-26 08:23:42,784 INFO L78 Accepts]: Start accepts. Automaton has 174 states. Word has length 346 [2018-09-26 08:23:42,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:42,785 INFO L225 Difference]: With dead ends: 351 [2018-09-26 08:23:42,785 INFO L226 Difference]: Without dead ends: 349 [2018-09-26 08:23:42,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=345, Invalid=29757, Unknown=0, NotChecked=0, Total=30102 [2018-09-26 08:23:42,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-09-26 08:23:42,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 349. [2018-09-26 08:23:42,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-09-26 08:23:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 349 transitions. [2018-09-26 08:23:42,800 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 349 transitions. Word has length 346 [2018-09-26 08:23:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:42,800 INFO L480 AbstractCegarLoop]: Abstraction has 349 states and 349 transitions. [2018-09-26 08:23:42,800 INFO L481 AbstractCegarLoop]: Interpolant automaton has 174 states. [2018-09-26 08:23:42,800 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 349 transitions. [2018-09-26 08:23:42,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-09-26 08:23:42,802 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:42,802 INFO L375 BasicCegarLoop]: trace histogram [173, 172, 1, 1, 1] [2018-09-26 08:23:42,802 INFO L423 AbstractCegarLoop]: === Iteration 173 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:42,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:42,802 INFO L82 PathProgramCache]: Analyzing trace with hash 467555263, now seen corresponding path program 172 times [2018-09-26 08:23:42,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:42,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:44,381 INFO L134 CoverageAnalysis]: Checked inductivity of 29756 backedges. 0 proven. 29756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:44,382 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:44,382 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [174] total 174 [2018-09-26 08:23:44,382 INFO L459 AbstractCegarLoop]: Interpolant automaton has 175 states [2018-09-26 08:23:44,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 175 interpolants. [2018-09-26 08:23:44,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:23:44,384 INFO L87 Difference]: Start difference. First operand 349 states and 349 transitions. Second operand 175 states. [2018-09-26 08:23:46,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:46,418 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-09-26 08:23:46,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-09-26 08:23:46,418 INFO L78 Accepts]: Start accepts. Automaton has 175 states. Word has length 348 [2018-09-26 08:23:46,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:46,419 INFO L225 Difference]: With dead ends: 353 [2018-09-26 08:23:46,419 INFO L226 Difference]: Without dead ends: 351 [2018-09-26 08:23:46,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=347, Invalid=30103, Unknown=0, NotChecked=0, Total=30450 [2018-09-26 08:23:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-09-26 08:23:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 351. [2018-09-26 08:23:46,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-09-26 08:23:46,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-09-26 08:23:46,428 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 348 [2018-09-26 08:23:46,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:46,429 INFO L480 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-09-26 08:23:46,429 INFO L481 AbstractCegarLoop]: Interpolant automaton has 175 states. [2018-09-26 08:23:46,429 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-09-26 08:23:46,430 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-09-26 08:23:46,430 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:46,430 INFO L375 BasicCegarLoop]: trace histogram [174, 173, 1, 1, 1] [2018-09-26 08:23:46,430 INFO L423 AbstractCegarLoop]: === Iteration 174 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:46,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:46,430 INFO L82 PathProgramCache]: Analyzing trace with hash -1650906247, now seen corresponding path program 173 times [2018-09-26 08:23:46,430 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:46,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:47,956 INFO L134 CoverageAnalysis]: Checked inductivity of 30102 backedges. 0 proven. 30102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:47,956 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:47,956 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [175] total 175 [2018-09-26 08:23:47,957 INFO L459 AbstractCegarLoop]: Interpolant automaton has 176 states [2018-09-26 08:23:47,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 176 interpolants. [2018-09-26 08:23:47,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:23:47,958 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 176 states. [2018-09-26 08:23:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:49,999 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-09-26 08:23:49,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-09-26 08:23:49,999 INFO L78 Accepts]: Start accepts. Automaton has 176 states. Word has length 350 [2018-09-26 08:23:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:50,000 INFO L225 Difference]: With dead ends: 355 [2018-09-26 08:23:50,000 INFO L226 Difference]: Without dead ends: 353 [2018-09-26 08:23:50,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=349, Invalid=30451, Unknown=0, NotChecked=0, Total=30800 [2018-09-26 08:23:50,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-09-26 08:23:50,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 353. [2018-09-26 08:23:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-09-26 08:23:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-09-26 08:23:50,009 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 350 [2018-09-26 08:23:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:50,010 INFO L480 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-09-26 08:23:50,010 INFO L481 AbstractCegarLoop]: Interpolant automaton has 176 states. [2018-09-26 08:23:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-09-26 08:23:50,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-09-26 08:23:50,011 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:50,011 INFO L375 BasicCegarLoop]: trace histogram [175, 174, 1, 1, 1] [2018-09-26 08:23:50,011 INFO L423 AbstractCegarLoop]: === Iteration 175 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:50,011 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:50,011 INFO L82 PathProgramCache]: Analyzing trace with hash -1677919053, now seen corresponding path program 174 times [2018-09-26 08:23:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:51,541 INFO L134 CoverageAnalysis]: Checked inductivity of 30450 backedges. 0 proven. 30450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:51,542 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:51,542 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [176] total 176 [2018-09-26 08:23:51,542 INFO L459 AbstractCegarLoop]: Interpolant automaton has 177 states [2018-09-26 08:23:51,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 177 interpolants. [2018-09-26 08:23:51,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:23:51,544 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 177 states. [2018-09-26 08:23:53,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:53,617 INFO L93 Difference]: Finished difference Result 357 states and 357 transitions. [2018-09-26 08:23:53,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-09-26 08:23:53,617 INFO L78 Accepts]: Start accepts. Automaton has 177 states. Word has length 352 [2018-09-26 08:23:53,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:53,618 INFO L225 Difference]: With dead ends: 357 [2018-09-26 08:23:53,618 INFO L226 Difference]: Without dead ends: 355 [2018-09-26 08:23:53,619 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=351, Invalid=30801, Unknown=0, NotChecked=0, Total=31152 [2018-09-26 08:23:53,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-09-26 08:23:53,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 355. [2018-09-26 08:23:53,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-09-26 08:23:53,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 355 transitions. [2018-09-26 08:23:53,627 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 355 transitions. Word has length 352 [2018-09-26 08:23:53,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:53,627 INFO L480 AbstractCegarLoop]: Abstraction has 355 states and 355 transitions. [2018-09-26 08:23:53,628 INFO L481 AbstractCegarLoop]: Interpolant automaton has 177 states. [2018-09-26 08:23:53,628 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 355 transitions. [2018-09-26 08:23:53,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-09-26 08:23:53,629 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:53,629 INFO L375 BasicCegarLoop]: trace histogram [176, 175, 1, 1, 1] [2018-09-26 08:23:53,629 INFO L423 AbstractCegarLoop]: === Iteration 176 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:53,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:53,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1867421843, now seen corresponding path program 175 times [2018-09-26 08:23:53,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:53,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:55,193 INFO L134 CoverageAnalysis]: Checked inductivity of 30800 backedges. 0 proven. 30800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:55,193 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:55,193 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [177] total 177 [2018-09-26 08:23:55,194 INFO L459 AbstractCegarLoop]: Interpolant automaton has 178 states [2018-09-26 08:23:55,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 178 interpolants. [2018-09-26 08:23:55,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:23:55,195 INFO L87 Difference]: Start difference. First operand 355 states and 355 transitions. Second operand 178 states. [2018-09-26 08:23:57,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:23:57,255 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-09-26 08:23:57,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 178 states. [2018-09-26 08:23:57,255 INFO L78 Accepts]: Start accepts. Automaton has 178 states. Word has length 354 [2018-09-26 08:23:57,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:23:57,256 INFO L225 Difference]: With dead ends: 359 [2018-09-26 08:23:57,256 INFO L226 Difference]: Without dead ends: 357 [2018-09-26 08:23:57,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=353, Invalid=31153, Unknown=0, NotChecked=0, Total=31506 [2018-09-26 08:23:57,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 357 states. [2018-09-26 08:23:57,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 357 to 357. [2018-09-26 08:23:57,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-09-26 08:23:57,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-09-26 08:23:57,266 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 354 [2018-09-26 08:23:57,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:23:57,266 INFO L480 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-09-26 08:23:57,266 INFO L481 AbstractCegarLoop]: Interpolant automaton has 178 states. [2018-09-26 08:23:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-09-26 08:23:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-09-26 08:23:57,268 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:23:57,268 INFO L375 BasicCegarLoop]: trace histogram [177, 176, 1, 1, 1] [2018-09-26 08:23:57,268 INFO L423 AbstractCegarLoop]: === Iteration 177 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:23:57,268 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:23:57,268 INFO L82 PathProgramCache]: Analyzing trace with hash 703990695, now seen corresponding path program 176 times [2018-09-26 08:23:57,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:23:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:23:58,877 INFO L134 CoverageAnalysis]: Checked inductivity of 31152 backedges. 0 proven. 31152 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:23:58,877 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:23:58,878 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2018-09-26 08:23:58,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 179 states [2018-09-26 08:23:58,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2018-09-26 08:23:58,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:23:58,879 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 179 states. [2018-09-26 08:24:01,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:01,007 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-09-26 08:24:01,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-09-26 08:24:01,007 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 356 [2018-09-26 08:24:01,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:01,008 INFO L225 Difference]: With dead ends: 361 [2018-09-26 08:24:01,008 INFO L226 Difference]: Without dead ends: 359 [2018-09-26 08:24:01,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=355, Invalid=31507, Unknown=0, NotChecked=0, Total=31862 [2018-09-26 08:24:01,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-09-26 08:24:01,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 359. [2018-09-26 08:24:01,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-09-26 08:24:01,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-09-26 08:24:01,020 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 356 [2018-09-26 08:24:01,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:01,020 INFO L480 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-09-26 08:24:01,020 INFO L481 AbstractCegarLoop]: Interpolant automaton has 179 states. [2018-09-26 08:24:01,020 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-09-26 08:24:01,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-09-26 08:24:01,021 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:01,021 INFO L375 BasicCegarLoop]: trace histogram [178, 177, 1, 1, 1] [2018-09-26 08:24:01,021 INFO L423 AbstractCegarLoop]: === Iteration 178 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:01,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:01,022 INFO L82 PathProgramCache]: Analyzing trace with hash -2069722783, now seen corresponding path program 177 times [2018-09-26 08:24:01,022 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:01,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-09-26 08:24:02,648 INFO L134 CoverageAnalysis]: Checked inductivity of 31506 backedges. 0 proven. 31506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-09-26 08:24:02,648 INFO L313 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-09-26 08:24:02,649 INFO L328 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [179] total 179 [2018-09-26 08:24:02,649 INFO L459 AbstractCegarLoop]: Interpolant automaton has 180 states [2018-09-26 08:24:02,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 180 interpolants. [2018-09-26 08:24:02,650 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:24:02,650 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 180 states. [2018-09-26 08:24:04,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-09-26 08:24:04,881 INFO L93 Difference]: Finished difference Result 363 states and 363 transitions. [2018-09-26 08:24:04,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-09-26 08:24:04,882 INFO L78 Accepts]: Start accepts. Automaton has 180 states. Word has length 358 [2018-09-26 08:24:04,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-09-26 08:24:04,882 INFO L225 Difference]: With dead ends: 363 [2018-09-26 08:24:04,883 INFO L226 Difference]: Without dead ends: 361 [2018-09-26 08:24:04,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=357, Invalid=31863, Unknown=0, NotChecked=0, Total=32220 [2018-09-26 08:24:04,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-09-26 08:24:04,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-09-26 08:24:04,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-09-26 08:24:04,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-09-26 08:24:04,892 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 358 [2018-09-26 08:24:04,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-09-26 08:24:04,893 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-09-26 08:24:04,893 INFO L481 AbstractCegarLoop]: Interpolant automaton has 180 states. [2018-09-26 08:24:04,893 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-09-26 08:24:04,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-09-26 08:24:04,894 INFO L367 BasicCegarLoop]: Found error trace [2018-09-26 08:24:04,894 INFO L375 BasicCegarLoop]: trace histogram [179, 178, 1, 1, 1] [2018-09-26 08:24:04,894 INFO L423 AbstractCegarLoop]: === Iteration 179 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-09-26 08:24:04,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-09-26 08:24:04,895 INFO L82 PathProgramCache]: Analyzing trace with hash -433684325, now seen corresponding path program 178 times [2018-09-26 08:24:04,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-09-26 08:24:04,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Received shutdown request... [2018-09-26 08:24:05,250 WARN L549 AbstractCegarLoop]: Verification canceled [2018-09-26 08:24:05,254 WARN L206 ceAbstractionStarter]: Timeout [2018-09-26 08:24:05,254 INFO L202 PluginConnector]: Adding new model simple4.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.09 08:24:05 BoogieIcfgContainer [2018-09-26 08:24:05,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-09-26 08:24:05,256 INFO L168 Benchmark]: Toolchain (without parser) took 251018.11 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 70.7 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-26 08:24:05,257 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.14 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:24:05,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.72 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:24:05,258 INFO L168 Benchmark]: Boogie Preprocessor took 22.11 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:24:05,258 INFO L168 Benchmark]: RCFGBuilder took 291.47 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:24:05,259 INFO L168 Benchmark]: TraceAbstraction took 250655.48 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 60.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2018-09-26 08:24:05,261 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.14 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.72 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 22.11 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 291.47 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 250655.48 ms. Allocated memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: 1.7 GB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 60.1 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 30]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 30). Cancelled while BasicCegarLoop was analyzing trace of length 361 with TraceHistMax 179, while InterpolatingTraceCheckCraig was constructing Craig interpolants, while PredicateComparison was comparing new predicate (quantifier-free) to 73 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 250.5s OverallTime, 179 OverallIterations, 179 TraceHistogramMax, 139.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16465 SDtfs, 0 SDslu, 1895790 SDs, 0 SdLazy, 1927651 SolverSat, 0 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 92.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 16109 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 15931 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=361occurred in iteration=178, 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: 1.4s AutomataMinimizationTime, 178 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 2.8s SatisfiabilityAnalysisTime, 94.8s InterpolantComputationTime, 32218 NumberOfCodeBlocks, 32218 NumberOfCodeBlocksAsserted, 178 NumberOfCheckSat, 32040 ConstructedInterpolants, 0 QuantifiedInterpolants, 53337166 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 178 InterpolantComputations, 1 PerfectInterpolantSequences, 0/1879858 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/simple4.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-09-26_08-24-05-273.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/simple4.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-09-26_08-24-05-273.csv Completed graceful shutdown