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 --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:12:10,847 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:12:10,849 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:12:10,861 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:12:10,862 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:12:10,863 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:12:10,864 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:12:10,866 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:12:10,868 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:12:10,869 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:12:10,869 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:12:10,870 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:12:10,871 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:12:10,872 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:12:10,873 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:12:10,874 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:12:10,875 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:12:10,876 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:12:10,879 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:12:10,880 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:12:10,881 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:12:10,882 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:12:10,885 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:12:10,885 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:12:10,886 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:12:10,887 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:12:10,888 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:12:10,888 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:12:10,889 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:12:10,891 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:12:10,891 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:12:10,892 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:12:10,892 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:12:10,892 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:12:10,893 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:12:10,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:12:10,894 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:12:10,904 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:12:10,905 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:12:10,905 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:12:10,906 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:12:10,906 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:12:10,906 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:12:10,907 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:12:10,907 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:12:10,907 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:12:10,907 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:12:10,907 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:12:10,908 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:12:10,908 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:12:10,909 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:12:10,909 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:12:10,955 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:12:10,970 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:12:10,974 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:12:10,976 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:12:10,976 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:12:10,977 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl [2018-10-10 15:12:10,977 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_44.bpl' [2018-10-10 15:12:11,077 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:12:11,079 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:12:11,079 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:12:11,080 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:12:11,080 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:12:11,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,106 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,127 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,128 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,147 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,150 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,157 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... [2018-10-10 15:12:11,165 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:12:11,166 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:12:11,167 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:12:11,167 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:12:11,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:12:11,233 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:12:11,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:12:11,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:12:12,319 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:12:12,320 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:12:12 BoogieIcfgContainer [2018-10-10 15:12:12,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:12:12,322 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:12:12,322 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:12:12,325 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:12:12,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:11" (1/2) ... [2018-10-10 15:12:12,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ead4e84 and model type 20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:12:12, skipping insertion in model container [2018-10-10 15:12:12,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:12:12" (2/2) ... [2018-10-10 15:12:12,329 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_44.bpl [2018-10-10 15:12:12,339 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:12:12,347 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:12:12,364 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:12:12,393 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:12:12,393 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:12:12,393 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:12:12,394 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:12:12,394 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:12:12,394 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:12:12,394 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:12:12,394 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:12:12,394 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:12:12,416 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states. [2018-10-10 15:12:12,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:12:12,432 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:12,434 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:12,435 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:12,441 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:12,441 INFO L82 PathProgramCache]: Analyzing trace with hash -1209971596, now seen corresponding path program 1 times [2018-10-10 15:12:12,490 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:12,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:12,920 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:12,923 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:12:12,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:12:12,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:12:12,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:12:12,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:12:12,950 INFO L87 Difference]: Start difference. First operand 160 states. Second operand 4 states. [2018-10-10 15:12:13,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:13,137 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:12:13,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:12:13,139 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 155 [2018-10-10 15:12:13,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:13,155 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:12:13,155 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:12:13,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:12:13,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:12:13,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:12:13,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:12:13,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:12:13,208 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:12:13,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:13,209 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:12:13,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:12:13,210 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:12:13,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:12:13,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:13,213 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:13,214 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:13,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:13,215 INFO L82 PathProgramCache]: Analyzing trace with hash -1411765870, now seen corresponding path program 1 times [2018-10-10 15:12:13,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:13,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:13,418 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:13,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:13,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:12:13,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:12:13,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:12:13,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:12:13,422 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 5 states. [2018-10-10 15:12:13,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:13,559 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:12:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:12:13,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2018-10-10 15:12:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:13,568 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:12:13,569 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:12:13,570 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:12:13,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:12:13,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:12:13,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:12:13,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:12:13,592 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:12:13,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:13,593 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:12:13,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:12:13,593 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:12:13,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:12:13,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:13,596 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:13,597 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:13,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:13,598 INFO L82 PathProgramCache]: Analyzing trace with hash -110768204, now seen corresponding path program 2 times [2018-10-10 15:12:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:13,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:13,862 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:13,863 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:13,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:12:13,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:12:13,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:12:13,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:12:13,864 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 6 states. [2018-10-10 15:12:14,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:14,029 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:12:14,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:12:14,030 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 161 [2018-10-10 15:12:14,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:14,032 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:12:14,032 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:12:14,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:12:14,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:12:14,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:12:14,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:12:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:12:14,047 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:12:14,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:14,048 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:12:14,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:12:14,048 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:12:14,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:12:14,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:14,056 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:14,056 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:14,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:14,057 INFO L82 PathProgramCache]: Analyzing trace with hash 125820498, now seen corresponding path program 3 times [2018-10-10 15:12:14,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:14,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:14,356 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:14,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:14,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:12:14,358 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:12:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:12:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:12:14,359 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 7 states. [2018-10-10 15:12:14,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:14,782 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:12:14,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:12:14,783 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 164 [2018-10-10 15:12:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:14,785 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:12:14,785 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:12:14,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:14,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:12:14,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:12:14,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:12:14,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:12:14,796 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:12:14,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:14,797 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:12:14,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:12:14,797 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:12:14,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:12:14,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:14,800 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:14,800 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:14,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:14,801 INFO L82 PathProgramCache]: Analyzing trace with hash 298509044, now seen corresponding path program 4 times [2018-10-10 15:12:14,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:14,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:15,232 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:15,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:15,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:12:15,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:12:15,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:12:15,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:12:15,234 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 8 states. [2018-10-10 15:12:15,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:15,380 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:12:15,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:12:15,382 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 167 [2018-10-10 15:12:15,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:15,383 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:12:15,384 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:12:15,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:12:15,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:12:15,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:12:15,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:12:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:12:15,410 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:12:15,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:15,411 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:12:15,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:12:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:12:15,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:12:15,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:15,415 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:15,415 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:15,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:15,419 INFO L82 PathProgramCache]: Analyzing trace with hash -507837678, now seen corresponding path program 5 times [2018-10-10 15:12:15,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:15,924 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:15,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:15,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:12:15,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:12:15,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:12:15,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:12:15,926 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 9 states. [2018-10-10 15:12:16,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:16,164 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:12:16,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:12:16,166 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 170 [2018-10-10 15:12:16,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:16,168 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:12:16,168 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:12:16,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:12:16,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:12:16,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:12:16,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:12:16,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:12:16,176 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:12:16,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:16,176 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:12:16,177 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:12:16,177 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:12:16,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:12:16,179 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:16,179 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:16,180 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:16,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:16,180 INFO L82 PathProgramCache]: Analyzing trace with hash -630946252, now seen corresponding path program 6 times [2018-10-10 15:12:16,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:16,586 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:16,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:16,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:12:16,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:12:16,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:12:16,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:16,588 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 10 states. [2018-10-10 15:12:16,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:16,785 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:12:16,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:12:16,792 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 173 [2018-10-10 15:12:16,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:16,793 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:12:16,794 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:12:16,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:16,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:12:16,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:12:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:12:16,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:12:16,803 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:12:16,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:16,803 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:12:16,803 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:12:16,803 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:12:16,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:12:16,805 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:16,806 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:16,806 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:16,806 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:16,807 INFO L82 PathProgramCache]: Analyzing trace with hash -256403502, now seen corresponding path program 7 times [2018-10-10 15:12:16,807 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:17,090 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:17,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:17,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:12:17,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:12:17,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:12:17,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:12:17,092 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 11 states. [2018-10-10 15:12:17,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:17,410 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:12:17,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:12:17,410 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 176 [2018-10-10 15:12:17,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:17,412 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:12:17,412 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:12:17,412 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:12:17,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:12:17,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:12:17,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:12:17,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:12:17,417 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:12:17,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:17,417 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:12:17,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:12:17,417 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:12:17,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:12:17,418 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:17,419 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:17,419 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:17,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:17,419 INFO L82 PathProgramCache]: Analyzing trace with hash -578373260, now seen corresponding path program 8 times [2018-10-10 15:12:17,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:17,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:17,635 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:17,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:17,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:12:17,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:12:17,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:12:17,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:12:17,637 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 12 states. [2018-10-10 15:12:17,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:17,862 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:12:17,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:12:17,862 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 179 [2018-10-10 15:12:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:17,863 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:12:17,863 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:12:17,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:12:17,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:12:17,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:12:17,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:12:17,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:12:17,868 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:12:17,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:17,868 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:12:17,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:12:17,869 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:12:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:12:17,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:17,870 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:17,870 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:17,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1717461870, now seen corresponding path program 9 times [2018-10-10 15:12:17,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:18,135 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:18,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:18,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:12:18,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:12:18,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:12:18,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:12:18,137 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 13 states. [2018-10-10 15:12:18,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:18,383 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:12:18,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:12:18,386 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 182 [2018-10-10 15:12:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:18,387 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:12:18,387 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:12:18,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:12:18,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:12:18,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:12:18,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:12:18,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:12:18,394 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:12:18,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:18,394 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:12:18,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:12:18,394 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:12:18,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:12:18,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:18,396 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:18,396 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:18,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:18,396 INFO L82 PathProgramCache]: Analyzing trace with hash -1769636684, now seen corresponding path program 10 times [2018-10-10 15:12:18,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:18,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:18,623 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:18,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:18,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:12:18,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:12:18,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:12:18,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:12:18,624 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 14 states. [2018-10-10 15:12:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:19,079 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:12:19,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:12:19,079 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 185 [2018-10-10 15:12:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:19,081 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:12:19,081 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:12:19,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:12:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:12:19,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:12:19,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:12:19,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:12:19,086 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:12:19,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:19,086 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:12:19,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:12:19,087 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:12:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:12:19,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:19,088 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:19,088 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:19,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:19,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1331359406, now seen corresponding path program 11 times [2018-10-10 15:12:19,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:19,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:20,117 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:20,118 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:20,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:12:20,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:12:20,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:12:20,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:12:20,119 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 15 states. [2018-10-10 15:12:20,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:20,417 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:12:20,418 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:12:20,418 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 188 [2018-10-10 15:12:20,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:20,419 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:12:20,419 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:12:20,420 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:12:20,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:12:20,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:12:20,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:12:20,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:12:20,424 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:12:20,424 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:20,425 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:12:20,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:12:20,425 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:12:20,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:12:20,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:20,426 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:20,426 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:20,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:20,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1313550348, now seen corresponding path program 12 times [2018-10-10 15:12:20,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:21,385 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:21,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:21,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:12:21,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:12:21,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:12:21,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:21,387 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 16 states. [2018-10-10 15:12:21,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:21,699 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:12:21,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:12:21,699 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 191 [2018-10-10 15:12:21,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:21,700 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:12:21,700 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:12:21,701 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:12:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:12:21,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:12:21,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:12:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:12:21,706 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:12:21,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:21,706 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:12:21,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:12:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:12:21,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:12:21,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:21,708 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:21,709 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:21,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:21,709 INFO L82 PathProgramCache]: Analyzing trace with hash 955119122, now seen corresponding path program 13 times [2018-10-10 15:12:21,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:22,267 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:22,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:22,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:12:22,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:12:22,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:12:22,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:12:22,269 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 17 states. [2018-10-10 15:12:22,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:22,556 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:12:22,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:12:22,557 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 194 [2018-10-10 15:12:22,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:22,558 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:12:22,558 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:12:22,559 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:12:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:12:22,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:12:22,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:12:22,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:12:22,563 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:12:22,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:22,563 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:12:22,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:12:22,564 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:12:22,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:12:22,565 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:22,565 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:22,565 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:22,565 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:22,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1281930036, now seen corresponding path program 14 times [2018-10-10 15:12:22,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:22,997 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:22,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:22,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:12:22,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:12:22,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:12:22,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:12:22,999 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 18 states. [2018-10-10 15:12:23,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:23,403 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:12:23,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:12:23,403 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 197 [2018-10-10 15:12:23,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:23,404 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:12:23,404 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:12:23,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:12:23,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:12:23,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:12:23,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:12:23,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:12:23,414 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:12:23,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:23,415 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:12:23,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:12:23,415 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:12:23,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:12:23,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:23,416 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:23,416 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:23,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:23,417 INFO L82 PathProgramCache]: Analyzing trace with hash 615008978, now seen corresponding path program 15 times [2018-10-10 15:12:23,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:23,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:24,170 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:24,170 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:24,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:12:24,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:12:24,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:12:24,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:12:24,172 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 19 states. [2018-10-10 15:12:24,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:24,591 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:12:24,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:12:24,593 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 200 [2018-10-10 15:12:24,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:24,594 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:12:24,594 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:12:24,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:12:24,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:12:24,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:12:24,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:12:24,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:12:24,600 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:12:24,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:24,601 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:12:24,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:12:24,601 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:12:24,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:12:24,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:24,602 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:24,602 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:24,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:24,603 INFO L82 PathProgramCache]: Analyzing trace with hash 888481396, now seen corresponding path program 16 times [2018-10-10 15:12:24,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:24,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:25,999 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:25,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:25,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:12:26,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:12:26,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:12:26,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:12:26,000 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 20 states. [2018-10-10 15:12:26,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:26,426 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:12:26,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:12:26,428 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 203 [2018-10-10 15:12:26,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:26,429 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:12:26,429 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:12:26,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:12:26,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:12:26,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:12:26,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:12:26,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:12:26,434 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:12:26,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:26,434 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:12:26,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:12:26,435 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:12:26,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:12:26,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:26,436 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:26,436 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:26,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:26,437 INFO L82 PathProgramCache]: Analyzing trace with hash 352325522, now seen corresponding path program 17 times [2018-10-10 15:12:26,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:28,166 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:28,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:28,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:12:28,167 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:12:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:12:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:12:28,167 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 21 states. [2018-10-10 15:12:28,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:28,633 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:12:28,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:12:28,633 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 206 [2018-10-10 15:12:28,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:28,634 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:12:28,634 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:12:28,635 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:12:28,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:12:28,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:12:28,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:12:28,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:12:28,639 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:12:28,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:28,640 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:12:28,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:12:28,640 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:12:28,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:12:28,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:28,641 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:28,642 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:28,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:28,642 INFO L82 PathProgramCache]: Analyzing trace with hash 716057012, now seen corresponding path program 18 times [2018-10-10 15:12:28,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:28,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:29,056 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:29,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:29,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:12:29,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:12:29,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:12:29,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:12:29,058 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 22 states. [2018-10-10 15:12:29,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:29,426 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:12:29,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:12:29,428 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 209 [2018-10-10 15:12:29,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:29,429 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:12:29,429 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:12:29,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:12:29,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:12:29,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:12:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:12:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:12:29,434 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:12:29,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:29,435 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:12:29,435 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:12:29,435 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:12:29,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:12:29,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:29,436 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:29,436 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:29,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:29,437 INFO L82 PathProgramCache]: Analyzing trace with hash 438387794, now seen corresponding path program 19 times [2018-10-10 15:12:29,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:29,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:32,188 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:32,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:32,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:12:32,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:12:32,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:12:32,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:12:32,190 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 23 states. [2018-10-10 15:12:32,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:32,631 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:12:32,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:12:32,631 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 212 [2018-10-10 15:12:32,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:32,632 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:12:32,632 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:12:32,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:12:32,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:12:32,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:12:32,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:12:32,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:12:32,636 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:12:32,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:32,637 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:12:32,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:12:32,637 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:12:32,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:12:32,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:32,638 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:32,638 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:32,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:32,638 INFO L82 PathProgramCache]: Analyzing trace with hash 501726452, now seen corresponding path program 20 times [2018-10-10 15:12:32,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:33,771 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:33,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:33,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:12:33,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:12:33,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:12:33,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:12:33,773 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 24 states. [2018-10-10 15:12:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:34,326 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:12:34,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:12:34,327 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 215 [2018-10-10 15:12:34,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:34,328 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:12:34,328 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:12:34,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:12:34,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:12:34,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:12:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:12:34,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:12:34,333 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:12:34,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:34,333 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:12:34,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:12:34,334 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:12:34,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:12:34,335 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:34,335 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:34,335 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:34,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:34,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1933043986, now seen corresponding path program 21 times [2018-10-10 15:12:34,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:35,789 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:35,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:35,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:12:35,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:12:35,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:12:35,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:12:35,791 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 25 states. [2018-10-10 15:12:36,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:36,633 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:12:36,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:12:36,635 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 218 [2018-10-10 15:12:36,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:36,636 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:12:36,636 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:12:36,637 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:12:36,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:12:36,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:12:36,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:12:36,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:12:36,641 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:12:36,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:36,642 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:12:36,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:12:36,642 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:12:36,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:12:36,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:36,643 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:36,643 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:36,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:36,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1878384692, now seen corresponding path program 22 times [2018-10-10 15:12:36,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:37,811 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:37,812 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:37,812 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:12:37,812 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:12:37,813 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:12:37,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:12:37,813 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 26 states. [2018-10-10 15:12:38,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:38,356 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:12:38,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:12:38,356 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 221 [2018-10-10 15:12:38,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:38,357 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:12:38,357 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:12:38,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:38,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:12:38,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:12:38,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:12:38,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:12:38,364 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:12:38,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:38,364 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:12:38,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:12:38,365 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:12:38,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:12:38,366 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:38,366 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:38,366 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:38,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:38,367 INFO L82 PathProgramCache]: Analyzing trace with hash 1315962322, now seen corresponding path program 23 times [2018-10-10 15:12:38,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:38,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:38,879 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:38,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:38,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:12:38,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:12:38,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:12:38,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:12:38,881 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 27 states. [2018-10-10 15:12:39,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:39,506 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:12:39,507 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:12:39,507 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 224 [2018-10-10 15:12:39,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:39,508 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:12:39,508 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:12:39,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:39,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:12:39,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:12:39,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:12:39,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:12:39,513 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:12:39,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:39,514 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:12:39,514 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:12:39,514 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:12:39,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:12:39,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:39,515 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:39,516 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:39,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:39,516 INFO L82 PathProgramCache]: Analyzing trace with hash 858559348, now seen corresponding path program 24 times [2018-10-10 15:12:39,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:39,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:40,023 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:40,024 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:40,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:12:40,024 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:12:40,025 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:12:40,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:12:40,025 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 28 states. [2018-10-10 15:12:40,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:40,644 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:12:40,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:12:40,645 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 227 [2018-10-10 15:12:40,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:40,646 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:12:40,646 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:12:40,647 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:12:40,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:12:40,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:12:40,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:12:40,651 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:12:40,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:40,651 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:12:40,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:12:40,652 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:12:40,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:12:40,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:40,653 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:40,653 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:40,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:40,654 INFO L82 PathProgramCache]: Analyzing trace with hash -1997176174, now seen corresponding path program 25 times [2018-10-10 15:12:40,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:40,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:42,287 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:42,288 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:42,288 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:12:42,288 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:12:42,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:12:42,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:12:42,289 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 29 states. [2018-10-10 15:12:42,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:42,978 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:12:42,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:12:42,978 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 230 [2018-10-10 15:12:42,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:42,980 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:12:42,980 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:12:42,981 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:12:42,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:12:42,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:12:42,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:12:42,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:12:42,985 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:12:42,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:42,985 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:12:42,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:12:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:12:42,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:12:42,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:42,987 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:42,987 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:42,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:42,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1793054388, now seen corresponding path program 26 times [2018-10-10 15:12:42,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:43,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:44,501 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:44,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:12:44,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:12:44,502 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:12:44,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:12:44,503 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 30 states. [2018-10-10 15:12:45,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:45,187 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:12:45,187 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:12:45,188 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 233 [2018-10-10 15:12:45,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:45,189 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:12:45,189 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:12:45,190 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:12:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:12:45,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:12:45,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:12:45,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:12:45,194 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:12:45,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:45,194 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:12:45,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:12:45,195 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:12:45,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:12:45,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:45,196 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:45,196 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:45,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:45,196 INFO L82 PathProgramCache]: Analyzing trace with hash 1861515090, now seen corresponding path program 27 times [2018-10-10 15:12:45,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:45,726 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:45,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:45,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:12:45,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:12:45,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:12:45,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:12:45,727 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 31 states. [2018-10-10 15:12:46,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:46,661 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:12:46,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:12:46,663 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 236 [2018-10-10 15:12:46,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:46,664 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:12:46,664 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:12:46,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:12:46,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:12:46,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:12:46,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:12:46,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:12:46,669 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:12:46,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:46,669 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:12:46,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:12:46,669 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:12:46,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:12:46,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:46,671 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:46,671 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:46,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:46,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1264822772, now seen corresponding path program 28 times [2018-10-10 15:12:46,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:46,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:47,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:47,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:12:47,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:12:47,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:12:47,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:12:47,254 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 32 states. [2018-10-10 15:12:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:48,202 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:12:48,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:12:48,202 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 239 [2018-10-10 15:12:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:48,203 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:12:48,203 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:12:48,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:12:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:12:48,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:12:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:12:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:12:48,208 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:12:48,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:48,209 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:12:48,209 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:12:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:12:48,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:12:48,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:48,210 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:48,211 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:48,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:48,211 INFO L82 PathProgramCache]: Analyzing trace with hash 2073615378, now seen corresponding path program 29 times [2018-10-10 15:12:48,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:48,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:48,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:48,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:12:48,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:12:48,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:12:48,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:12:48,995 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 33 states. [2018-10-10 15:12:49,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:49,916 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:12:49,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:12:49,916 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 242 [2018-10-10 15:12:49,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:49,917 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:12:49,917 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:12:49,919 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:12:49,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:12:49,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:12:49,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:12:49,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:12:49,922 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:12:49,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:49,922 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:12:49,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:12:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:12:49,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:12:49,923 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:49,924 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:49,924 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:49,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:49,924 INFO L82 PathProgramCache]: Analyzing trace with hash 2047610164, now seen corresponding path program 30 times [2018-10-10 15:12:49,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:49,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:50,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:50,640 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:50,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:12:50,641 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:12:50,641 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:12:50,642 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:12:50,642 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 34 states. [2018-10-10 15:12:51,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:51,743 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:12:51,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:12:51,743 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 245 [2018-10-10 15:12:51,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:51,744 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:12:51,744 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:12:51,746 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:12:51,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:12:51,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:12:51,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:12:51,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:12:51,749 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:12:51,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:51,750 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:12:51,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:12:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:12:51,751 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:12:51,751 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:51,751 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:51,751 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:51,752 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:51,752 INFO L82 PathProgramCache]: Analyzing trace with hash 420393170, now seen corresponding path program 31 times [2018-10-10 15:12:51,752 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:51,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:52,477 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:52,477 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:52,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:12:52,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:12:52,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:12:52,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:12:52,478 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 35 states. [2018-10-10 15:12:53,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:53,431 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:12:53,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:12:53,431 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 248 [2018-10-10 15:12:53,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:53,432 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:12:53,433 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:12:53,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:12:53,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:12:53,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:12:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:12:53,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:12:53,437 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:12:53,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:53,438 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:12:53,438 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:12:53,438 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:12:53,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:12:53,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:53,439 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:53,440 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:53,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:53,440 INFO L82 PathProgramCache]: Analyzing trace with hash 1294794868, now seen corresponding path program 32 times [2018-10-10 15:12:53,441 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:54,205 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:54,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:54,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:12:54,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:12:54,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:12:54,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:12:54,207 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 36 states. [2018-10-10 15:12:55,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:55,251 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:12:55,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:12:55,251 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 251 [2018-10-10 15:12:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:55,252 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:12:55,253 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:12:55,254 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:12:55,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:12:55,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:12:55,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:12:55,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:12:55,259 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:12:55,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:55,260 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:12:55,260 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:12:55,260 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:12:55,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:12:55,262 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:55,262 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:55,263 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:55,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:55,263 INFO L82 PathProgramCache]: Analyzing trace with hash 1619129746, now seen corresponding path program 33 times [2018-10-10 15:12:55,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:55,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:12:56,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:12:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:12:56,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:12:56,020 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 37 states. [2018-10-10 15:12:57,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:57,263 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-10 15:12:57,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:12:57,263 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 254 [2018-10-10 15:12:57,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:57,264 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:12:57,265 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:12:57,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:12:57,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:12:57,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-10 15:12:57,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-10 15:12:57,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-10 15:12:57,268 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-10 15:12:57,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:57,268 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-10 15:12:57,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:12:57,268 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-10 15:12:57,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-10 15:12:57,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:57,269 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:57,270 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:57,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:57,270 INFO L82 PathProgramCache]: Analyzing trace with hash 203064244, now seen corresponding path program 34 times [2018-10-10 15:12:57,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:57,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:58,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:58,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:58,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:12:58,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:12:58,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:12:58,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:12:58,174 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 38 states. [2018-10-10 15:12:59,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:59,260 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-10 15:12:59,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:12:59,261 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 257 [2018-10-10 15:12:59,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:59,262 INFO L225 Difference]: With dead ends: 263 [2018-10-10 15:12:59,262 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 15:12:59,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:12:59,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 15:12:59,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-10 15:12:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-10 15:12:59,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-10 15:12:59,266 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-10 15:12:59,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:59,266 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-10 15:12:59,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:12:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-10 15:12:59,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-10 15:12:59,268 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:59,268 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:12:59,268 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:59,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:59,269 INFO L82 PathProgramCache]: Analyzing trace with hash -635524526, now seen corresponding path program 35 times [2018-10-10 15:12:59,269 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:00,091 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:00,091 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:00,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:13:00,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:13:00,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:13:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:13:00,092 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 39 states. [2018-10-10 15:13:01,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:01,108 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-10 15:13:01,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:13:01,108 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 260 [2018-10-10 15:13:01,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:01,110 INFO L225 Difference]: With dead ends: 266 [2018-10-10 15:13:01,110 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:13:01,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:13:01,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:13:01,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-10 15:13:01,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 15:13:01,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-10 15:13:01,114 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-10 15:13:01,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:01,115 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-10 15:13:01,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:13:01,115 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-10 15:13:01,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-10 15:13:01,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:01,116 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:01,117 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:01,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:01,117 INFO L82 PathProgramCache]: Analyzing trace with hash 791189236, now seen corresponding path program 36 times [2018-10-10 15:13:01,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:01,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:02,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:02,592 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:02,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:13:02,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:13:02,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:13:02,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:13:02,594 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 40 states. [2018-10-10 15:13:03,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:03,708 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-10 15:13:03,708 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:13:03,708 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 263 [2018-10-10 15:13:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:03,710 INFO L225 Difference]: With dead ends: 269 [2018-10-10 15:13:03,710 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 15:13:03,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:13:03,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 15:13:03,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-10 15:13:03,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 15:13:03,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-10 15:13:03,715 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-10 15:13:03,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:03,715 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-10 15:13:03,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:13:03,716 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-10 15:13:03,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-10 15:13:03,717 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:03,717 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:03,717 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:03,718 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:03,720 INFO L82 PathProgramCache]: Analyzing trace with hash 1024511762, now seen corresponding path program 37 times [2018-10-10 15:13:03,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:03,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:04,999 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:05,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:05,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:13:05,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:13:05,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:13:05,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:13:05,001 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 41 states. [2018-10-10 15:13:06,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:06,131 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-10 15:13:06,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:13:06,132 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 266 [2018-10-10 15:13:06,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:06,133 INFO L225 Difference]: With dead ends: 272 [2018-10-10 15:13:06,133 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 15:13:06,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:13:06,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 15:13:06,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-10 15:13:06,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:13:06,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-10 15:13:06,137 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-10 15:13:06,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:06,138 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-10 15:13:06,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:13:06,138 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-10 15:13:06,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-10 15:13:06,139 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:06,139 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:06,140 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:06,140 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:06,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1616168396, now seen corresponding path program 38 times [2018-10-10 15:13:06,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:06,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:07,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:07,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:07,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:13:07,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:13:07,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:13:07,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:13:07,233 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 42 states. [2018-10-10 15:13:08,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:08,493 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-10 15:13:08,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:13:08,497 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 269 [2018-10-10 15:13:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:08,498 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:13:08,498 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:13:08,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:13:08,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:13:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-10 15:13:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 15:13:08,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-10 15:13:08,503 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-10 15:13:08,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:08,503 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-10 15:13:08,503 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:13:08,503 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-10 15:13:08,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-10 15:13:08,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:08,505 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:08,505 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:08,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:08,505 INFO L82 PathProgramCache]: Analyzing trace with hash 797205458, now seen corresponding path program 39 times [2018-10-10 15:13:08,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:08,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:09,664 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:09,665 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:09,665 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:13:09,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:13:09,666 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:13:09,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:13:09,666 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 43 states. [2018-10-10 15:13:10,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:10,996 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-10 15:13:10,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:13:10,996 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 272 [2018-10-10 15:13:10,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:10,997 INFO L225 Difference]: With dead ends: 278 [2018-10-10 15:13:10,997 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 15:13:10,998 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:13:10,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 15:13:11,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-10 15:13:11,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:13:11,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-10 15:13:11,001 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-10 15:13:11,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:11,002 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-10 15:13:11,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:13:11,002 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-10 15:13:11,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:13:11,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:11,004 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:11,004 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:11,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:11,004 INFO L82 PathProgramCache]: Analyzing trace with hash -134845068, now seen corresponding path program 40 times [2018-10-10 15:13:11,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:11,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:12,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:12,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:13:12,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:13:12,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:13:12,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:13:12,311 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 44 states. [2018-10-10 15:13:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:13,676 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:13:13,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:13:13,677 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 275 [2018-10-10 15:13:13,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:13,678 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:13:13,678 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:13:13,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:13:13,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:13:13,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-10 15:13:13,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 15:13:13,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-10 15:13:13,683 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-10 15:13:13,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:13,683 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-10 15:13:13,683 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:13:13,683 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-10 15:13:13,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-10 15:13:13,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:13,685 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:13,685 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:13,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:13,686 INFO L82 PathProgramCache]: Analyzing trace with hash 111503506, now seen corresponding path program 41 times [2018-10-10 15:13:13,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:13,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:14,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:14,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:14,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:13:14,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:13:14,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:13:14,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:13:14,738 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 45 states. [2018-10-10 15:13:16,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:16,246 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-10 15:13:16,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:13:16,247 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 278 [2018-10-10 15:13:16,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:16,248 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:13:16,248 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:13:16,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:13:16,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:13:16,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-10 15:13:16,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:13:16,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-10 15:13:16,253 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-10 15:13:16,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:16,253 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-10 15:13:16,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:13:16,253 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-10 15:13:16,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-10 15:13:16,255 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:16,255 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:16,255 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:16,255 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:16,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1017237324, now seen corresponding path program 42 times [2018-10-10 15:13:16,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:17,556 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:17,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:17,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:13:17,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:13:17,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:13:17,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:13:17,558 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 46 states. [2018-10-10 15:13:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:19,087 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-10 15:13:19,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:13:19,087 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 281 [2018-10-10 15:13:19,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:19,088 INFO L225 Difference]: With dead ends: 287 [2018-10-10 15:13:19,088 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 15:13:19,089 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:13:19,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 15:13:19,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-10 15:13:19,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 15:13:19,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-10 15:13:19,094 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 281 [2018-10-10 15:13:19,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:19,094 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-10 15:13:19,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:13:19,094 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-10 15:13:19,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 15:13:19,096 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:19,096 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:19,097 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:19,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:19,097 INFO L82 PathProgramCache]: Analyzing trace with hash -2036343470, now seen corresponding path program 43 times [2018-10-10 15:13:19,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:19,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:20,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:20,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:20,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:13:20,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:13:20,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:13:20,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:13:20,304 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 47 states. [2018-10-10 15:13:21,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:21,846 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-10 15:13:21,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:13:21,847 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 284 [2018-10-10 15:13:21,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:21,848 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:13:21,848 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:13:21,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:13:21,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:13:21,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-10 15:13:21,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:13:21,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-10-10 15:13:21,852 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 284 [2018-10-10 15:13:21,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:21,852 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-10-10 15:13:21,852 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:13:21,853 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-10-10 15:13:21,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 15:13:21,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:21,854 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:21,855 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:21,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:21,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1103723532, now seen corresponding path program 44 times [2018-10-10 15:13:21,856 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:23,130 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:23,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:23,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:13:23,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:13:23,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:13:23,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:13:23,131 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 48 states. [2018-10-10 15:13:24,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:24,605 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-10 15:13:24,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:13:24,605 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 287 [2018-10-10 15:13:24,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:24,606 INFO L225 Difference]: With dead ends: 293 [2018-10-10 15:13:24,607 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 15:13:24,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:13:24,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 15:13:24,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-10 15:13:24,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 15:13:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-10 15:13:24,610 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 287 [2018-10-10 15:13:24,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:24,610 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-10 15:13:24,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:13:24,610 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-10 15:13:24,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-10 15:13:24,612 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:24,612 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:24,612 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:24,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:24,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1566588398, now seen corresponding path program 45 times [2018-10-10 15:13:24,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:25,793 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:25,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:25,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:13:25,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:13:25,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:13:25,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:13:25,794 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 49 states. [2018-10-10 15:13:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:27,571 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-10 15:13:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:13:27,571 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 290 [2018-10-10 15:13:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:27,572 INFO L225 Difference]: With dead ends: 296 [2018-10-10 15:13:27,572 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 15:13:27,573 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:13:27,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 15:13:27,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-10 15:13:27,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 15:13:27,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-10-10 15:13:27,576 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 290 [2018-10-10 15:13:27,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:27,576 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-10-10 15:13:27,576 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:13:27,576 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-10-10 15:13:27,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-10 15:13:27,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:27,577 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:27,577 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:27,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:27,578 INFO L82 PathProgramCache]: Analyzing trace with hash 366176052, now seen corresponding path program 46 times [2018-10-10 15:13:27,578 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:27,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:28,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:28,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:28,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:13:28,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:13:28,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:13:28,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:13:28,790 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 50 states. [2018-10-10 15:13:30,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:30,604 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-10 15:13:30,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:13:30,605 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 293 [2018-10-10 15:13:30,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:30,606 INFO L225 Difference]: With dead ends: 299 [2018-10-10 15:13:30,606 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 15:13:30,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:13:30,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 15:13:30,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-10 15:13:30,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:13:30,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-10 15:13:30,609 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 293 [2018-10-10 15:13:30,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:30,610 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-10 15:13:30,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:13:30,610 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-10 15:13:30,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-10 15:13:30,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:30,611 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:30,612 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:30,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:30,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1020335826, now seen corresponding path program 47 times [2018-10-10 15:13:30,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:30,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:31,835 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:31,835 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:31,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:13:31,836 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:13:31,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:13:31,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:13:31,837 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 51 states. [2018-10-10 15:13:33,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:33,867 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-10 15:13:33,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:13:33,867 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 296 [2018-10-10 15:13:33,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:33,868 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:13:33,869 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:13:33,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:13:33,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:13:33,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-10 15:13:33,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 15:13:33,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-10 15:13:33,873 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 296 [2018-10-10 15:13:33,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:33,874 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-10 15:13:33,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:13:33,874 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-10 15:13:33,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-10 15:13:33,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:33,876 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:33,876 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:33,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:33,876 INFO L82 PathProgramCache]: Analyzing trace with hash -1467426188, now seen corresponding path program 48 times [2018-10-10 15:13:33,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:33,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:35,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:35,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:35,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:13:35,152 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:13:35,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:13:35,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:13:35,153 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 52 states. [2018-10-10 15:13:37,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:37,175 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-10 15:13:37,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:13:37,175 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 299 [2018-10-10 15:13:37,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:37,176 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:13:37,177 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:13:37,177 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:13:37,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:13:37,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-10 15:13:37,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 15:13:37,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-10 15:13:37,181 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 299 [2018-10-10 15:13:37,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:37,181 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-10 15:13:37,181 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:13:37,181 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-10 15:13:37,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-10 15:13:37,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:37,183 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:37,183 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:37,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:37,183 INFO L82 PathProgramCache]: Analyzing trace with hash -429925486, now seen corresponding path program 49 times [2018-10-10 15:13:37,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:37,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:38,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:38,777 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:38,778 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:13:38,778 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:13:38,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:13:38,778 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:13:38,779 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 53 states. [2018-10-10 15:13:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:40,688 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-10 15:13:40,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:13:40,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 302 [2018-10-10 15:13:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:40,689 INFO L225 Difference]: With dead ends: 308 [2018-10-10 15:13:40,689 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 15:13:40,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:13:40,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 15:13:40,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-10 15:13:40,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 15:13:40,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-10 15:13:40,699 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 302 [2018-10-10 15:13:40,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:40,699 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-10 15:13:40,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:13:40,700 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-10 15:13:40,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-10 15:13:40,701 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:40,701 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:40,702 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:40,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:40,702 INFO L82 PathProgramCache]: Analyzing trace with hash 1168825780, now seen corresponding path program 50 times [2018-10-10 15:13:40,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:40,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:42,142 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:42,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:42,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:13:42,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:13:42,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:13:42,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:13:42,143 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 54 states. [2018-10-10 15:13:44,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:44,331 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-10 15:13:44,332 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:13:44,332 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 305 [2018-10-10 15:13:44,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:44,333 INFO L225 Difference]: With dead ends: 311 [2018-10-10 15:13:44,333 INFO L226 Difference]: Without dead ends: 311 [2018-10-10 15:13:44,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:13:44,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-10 15:13:44,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-10 15:13:44,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 15:13:44,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-10 15:13:44,337 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 305 [2018-10-10 15:13:44,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:44,338 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-10 15:13:44,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:13:44,338 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-10 15:13:44,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-10 15:13:44,341 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:44,341 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:44,341 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:44,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:44,342 INFO L82 PathProgramCache]: Analyzing trace with hash -1619521454, now seen corresponding path program 51 times [2018-10-10 15:13:44,342 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:44,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:45,814 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:45,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:45,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:13:45,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:13:45,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:13:45,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:13:45,816 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 55 states. [2018-10-10 15:13:48,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:48,195 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-10 15:13:48,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:13:48,195 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 308 [2018-10-10 15:13:48,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:48,196 INFO L225 Difference]: With dead ends: 314 [2018-10-10 15:13:48,196 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 15:13:48,197 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:13:48,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 15:13:48,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-10 15:13:48,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-10 15:13:48,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-10 15:13:48,200 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 308 [2018-10-10 15:13:48,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:48,200 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-10 15:13:48,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:13:48,201 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-10 15:13:48,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-10 15:13:48,202 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:48,202 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:48,202 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:48,202 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:48,202 INFO L82 PathProgramCache]: Analyzing trace with hash -309497612, now seen corresponding path program 52 times [2018-10-10 15:13:48,203 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:48,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:49,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:49,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:49,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:13:49,851 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:13:49,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:13:49,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:13:49,852 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 56 states. [2018-10-10 15:13:51,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:51,985 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-10 15:13:51,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:13:51,986 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 311 [2018-10-10 15:13:51,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:51,987 INFO L225 Difference]: With dead ends: 317 [2018-10-10 15:13:51,987 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 15:13:51,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:13:51,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 15:13:51,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-10 15:13:51,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:13:51,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-10 15:13:51,991 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 311 [2018-10-10 15:13:51,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:51,991 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-10 15:13:51,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:13:51,992 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-10 15:13:51,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-10 15:13:51,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:51,993 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:51,993 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:51,993 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:51,994 INFO L82 PathProgramCache]: Analyzing trace with hash -1757039342, now seen corresponding path program 53 times [2018-10-10 15:13:51,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:53,783 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:53,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:53,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:13:53,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:13:53,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:13:53,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:13:53,785 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 57 states. [2018-10-10 15:13:55,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:55,911 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-10 15:13:55,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:13:55,911 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 314 [2018-10-10 15:13:55,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:55,913 INFO L225 Difference]: With dead ends: 320 [2018-10-10 15:13:55,913 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 15:13:55,914 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:13:55,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 15:13:55,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-10 15:13:55,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:13:55,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-10 15:13:55,917 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 314 [2018-10-10 15:13:55,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:55,918 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-10 15:13:55,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:13:55,918 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-10 15:13:55,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-10 15:13:55,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:55,919 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:55,920 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:55,920 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:55,920 INFO L82 PathProgramCache]: Analyzing trace with hash 293901364, now seen corresponding path program 54 times [2018-10-10 15:13:55,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:55,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:57,518 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:57,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:57,518 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:13:57,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:13:57,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:13:57,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:13:57,519 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 58 states. [2018-10-10 15:13:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:59,850 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-10 15:13:59,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:13:59,851 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 317 [2018-10-10 15:13:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:59,852 INFO L225 Difference]: With dead ends: 323 [2018-10-10 15:13:59,852 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 15:13:59,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:13:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 15:13:59,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-10 15:13:59,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 15:13:59,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-10 15:13:59,855 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 317 [2018-10-10 15:13:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:59,856 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-10 15:13:59,856 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:13:59,856 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-10 15:13:59,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-10 15:13:59,857 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:59,857 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:13:59,857 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:59,857 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:59,857 INFO L82 PathProgramCache]: Analyzing trace with hash -336279086, now seen corresponding path program 55 times [2018-10-10 15:13:59,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:59,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:01,365 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:01,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:01,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:14:01,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:14:01,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:14:01,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:14:01,366 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 59 states. [2018-10-10 15:14:03,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:03,892 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-10 15:14:03,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:14:03,892 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 320 [2018-10-10 15:14:03,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:03,893 INFO L225 Difference]: With dead ends: 326 [2018-10-10 15:14:03,893 INFO L226 Difference]: Without dead ends: 326 [2018-10-10 15:14:03,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:14:03,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-10 15:14:03,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-10 15:14:03,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 15:14:03,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-10 15:14:03,897 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 320 [2018-10-10 15:14:03,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:03,897 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-10 15:14:03,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:14:03,897 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-10 15:14:03,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-10 15:14:03,898 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:03,898 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:03,899 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:03,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:03,899 INFO L82 PathProgramCache]: Analyzing trace with hash -740014220, now seen corresponding path program 56 times [2018-10-10 15:14:03,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:03,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:05,498 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:05,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:05,498 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:14:05,499 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:14:05,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:14:05,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:14:05,500 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 60 states. [2018-10-10 15:14:08,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:08,013 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-10 15:14:08,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:14:08,013 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 323 [2018-10-10 15:14:08,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:08,015 INFO L225 Difference]: With dead ends: 329 [2018-10-10 15:14:08,015 INFO L226 Difference]: Without dead ends: 329 [2018-10-10 15:14:08,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:14:08,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-10 15:14:08,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2018-10-10 15:14:08,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-10 15:14:08,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-10 15:14:08,018 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 323 [2018-10-10 15:14:08,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:08,019 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-10 15:14:08,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:14:08,019 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-10 15:14:08,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-10 15:14:08,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:08,020 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:08,020 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:08,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:08,020 INFO L82 PathProgramCache]: Analyzing trace with hash 1790004882, now seen corresponding path program 57 times [2018-10-10 15:14:08,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:08,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:09,918 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:09,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:09,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:14:09,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:14:09,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:14:09,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:14:09,920 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 61 states. [2018-10-10 15:14:12,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:12,311 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-10 15:14:12,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:14:12,311 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 326 [2018-10-10 15:14:12,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:12,313 INFO L225 Difference]: With dead ends: 332 [2018-10-10 15:14:12,313 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 15:14:12,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:14:12,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 15:14:12,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-10 15:14:12,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-10 15:14:12,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-10 15:14:12,316 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 326 [2018-10-10 15:14:12,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:12,317 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-10 15:14:12,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:14:12,317 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-10 15:14:12,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-10 15:14:12,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:12,318 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:12,318 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:12,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash 1207995060, now seen corresponding path program 58 times [2018-10-10 15:14:12,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:12,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:14,252 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:14,252 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:14,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:14:14,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:14:14,253 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:14:14,253 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:14:14,253 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 62 states. [2018-10-10 15:14:16,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:16,990 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-10 15:14:16,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:14:16,991 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 329 [2018-10-10 15:14:16,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:16,992 INFO L225 Difference]: With dead ends: 335 [2018-10-10 15:14:16,992 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 15:14:16,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:14:16,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 15:14:16,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2018-10-10 15:14:16,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 15:14:16,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-10 15:14:16,996 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 329 [2018-10-10 15:14:16,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:16,996 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-10 15:14:16,996 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:14:16,996 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-10 15:14:16,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-10 15:14:16,997 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:16,997 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:16,998 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:16,998 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:16,998 INFO L82 PathProgramCache]: Analyzing trace with hash 1336361810, now seen corresponding path program 59 times [2018-10-10 15:14:16,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:18,974 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:18,974 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:18,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:14:18,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:14:18,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:14:18,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:14:18,976 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 63 states. [2018-10-10 15:14:21,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:21,747 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-10 15:14:21,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:14:21,747 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 332 [2018-10-10 15:14:21,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:21,749 INFO L225 Difference]: With dead ends: 338 [2018-10-10 15:14:21,749 INFO L226 Difference]: Without dead ends: 338 [2018-10-10 15:14:21,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:14:21,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-10 15:14:21,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-10-10 15:14:21,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-10 15:14:21,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-10-10 15:14:21,753 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 332 [2018-10-10 15:14:21,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:21,753 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-10-10 15:14:21,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:14:21,753 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-10-10 15:14:21,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-10 15:14:21,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:21,755 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:21,755 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:21,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:21,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1305649676, now seen corresponding path program 60 times [2018-10-10 15:14:21,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:21,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:23,980 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:23,980 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:23,980 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:14:23,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:14:23,981 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:14:23,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:14:23,982 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 64 states. [2018-10-10 15:14:26,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:26,549 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-10 15:14:26,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:14:26,550 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 335 [2018-10-10 15:14:26,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:26,551 INFO L225 Difference]: With dead ends: 341 [2018-10-10 15:14:26,551 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 15:14:26,552 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:14:26,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 15:14:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2018-10-10 15:14:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:14:26,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 15:14:26,555 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 335 [2018-10-10 15:14:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:26,555 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 15:14:26,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:14:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 15:14:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 15:14:26,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:26,556 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:26,557 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:26,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash 100837394, now seen corresponding path program 61 times [2018-10-10 15:14:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:28,410 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:28,411 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:28,411 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:14:28,411 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:14:28,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:14:28,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:14:28,412 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 65 states. [2018-10-10 15:14:31,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:31,335 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-10 15:14:31,336 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:14:31,336 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 338 [2018-10-10 15:14:31,336 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:31,337 INFO L225 Difference]: With dead ends: 344 [2018-10-10 15:14:31,337 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 15:14:31,338 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:14:31,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 15:14:31,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-10-10 15:14:31,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-10 15:14:31,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-10-10 15:14:31,341 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 338 [2018-10-10 15:14:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:31,341 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-10-10 15:14:31,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:14:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-10-10 15:14:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-10 15:14:31,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:31,343 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:31,343 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:31,343 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:31,343 INFO L82 PathProgramCache]: Analyzing trace with hash -943800012, now seen corresponding path program 62 times [2018-10-10 15:14:31,344 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:31,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:33,262 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:33,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:33,263 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:14:33,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:14:33,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:14:33,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:14:33,264 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 66 states. [2018-10-10 15:14:36,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:36,356 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-10 15:14:36,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:14:36,356 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 341 [2018-10-10 15:14:36,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:36,358 INFO L225 Difference]: With dead ends: 347 [2018-10-10 15:14:36,358 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 15:14:36,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:14:36,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 15:14:36,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-10-10 15:14:36,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 15:14:36,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-10 15:14:36,362 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 341 [2018-10-10 15:14:36,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:36,362 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-10 15:14:36,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:14:36,362 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-10 15:14:36,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-10 15:14:36,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:36,363 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:36,364 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:36,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:36,364 INFO L82 PathProgramCache]: Analyzing trace with hash -403735342, now seen corresponding path program 63 times [2018-10-10 15:14:36,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:38,306 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:38,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:38,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:14:38,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:14:38,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:14:38,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:14:38,309 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 67 states. [2018-10-10 15:14:41,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:41,414 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-10-10 15:14:41,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:14:41,414 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 344 [2018-10-10 15:14:41,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:41,415 INFO L225 Difference]: With dead ends: 350 [2018-10-10 15:14:41,415 INFO L226 Difference]: Without dead ends: 350 [2018-10-10 15:14:41,417 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:14:41,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-10 15:14:41,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-10 15:14:41,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 15:14:41,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-10 15:14:41,420 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 344 [2018-10-10 15:14:41,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:41,420 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-10 15:14:41,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:14:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-10 15:14:41,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-10 15:14:41,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:41,422 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:41,423 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:41,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:41,423 INFO L82 PathProgramCache]: Analyzing trace with hash -284642188, now seen corresponding path program 64 times [2018-10-10 15:14:41,423 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:43,433 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:43,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:43,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:14:43,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:14:43,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:14:43,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:14:43,435 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 68 states. [2018-10-10 15:14:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:46,622 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-10 15:14:46,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:14:46,622 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 347 [2018-10-10 15:14:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:46,623 INFO L225 Difference]: With dead ends: 353 [2018-10-10 15:14:46,624 INFO L226 Difference]: Without dead ends: 353 [2018-10-10 15:14:46,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:14:46,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-10 15:14:46,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2018-10-10 15:14:46,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-10 15:14:46,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-10-10 15:14:46,627 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 347 [2018-10-10 15:14:46,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:46,628 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-10-10 15:14:46,628 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:14:46,628 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-10-10 15:14:46,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-10 15:14:46,629 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:46,629 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:46,629 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:46,630 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:46,630 INFO L82 PathProgramCache]: Analyzing trace with hash -23477870, now seen corresponding path program 65 times [2018-10-10 15:14:46,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:49,029 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:49,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:49,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:14:49,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:14:49,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:14:49,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:14:49,031 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 69 states. [2018-10-10 15:14:52,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:52,337 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-10 15:14:52,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:14:52,338 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 350 [2018-10-10 15:14:52,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:52,339 INFO L225 Difference]: With dead ends: 356 [2018-10-10 15:14:52,339 INFO L226 Difference]: Without dead ends: 356 [2018-10-10 15:14:52,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:14:52,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-10 15:14:52,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2018-10-10 15:14:52,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-10 15:14:52,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 354 transitions. [2018-10-10 15:14:52,343 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 354 transitions. Word has length 350 [2018-10-10 15:14:52,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:52,344 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 354 transitions. [2018-10-10 15:14:52,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:14:52,344 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 354 transitions. [2018-10-10 15:14:52,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-10 15:14:52,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:52,345 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:52,345 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:52,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:52,346 INFO L82 PathProgramCache]: Analyzing trace with hash 2136946612, now seen corresponding path program 66 times [2018-10-10 15:14:52,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:52,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:54,757 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:54,757 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:54,757 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:14:54,758 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:14:54,758 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:14:54,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:14:54,758 INFO L87 Difference]: Start difference. First operand 354 states and 354 transitions. Second operand 70 states. [2018-10-10 15:14:57,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:57,909 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-10 15:14:57,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:14:57,909 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 353 [2018-10-10 15:14:57,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:57,910 INFO L225 Difference]: With dead ends: 359 [2018-10-10 15:14:57,910 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 15:14:57,912 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:14:57,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 15:14:57,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2018-10-10 15:14:57,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-10 15:14:57,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-10-10 15:14:57,914 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 353 [2018-10-10 15:14:57,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:57,915 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-10-10 15:14:57,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:14:57,915 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-10-10 15:14:57,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-10 15:14:57,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:57,916 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:14:57,916 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:57,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:57,917 INFO L82 PathProgramCache]: Analyzing trace with hash -1037207982, now seen corresponding path program 67 times [2018-10-10 15:14:57,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:00,272 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:00,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:00,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:15:00,273 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:15:00,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:15:00,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:15:00,274 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 71 states. [2018-10-10 15:15:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:03,513 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-10-10 15:15:03,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:15:03,513 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 356 [2018-10-10 15:15:03,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:03,514 INFO L225 Difference]: With dead ends: 362 [2018-10-10 15:15:03,514 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 15:15:03,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:15:03,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 15:15:03,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-10-10 15:15:03,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-10 15:15:03,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-10 15:15:03,518 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 356 [2018-10-10 15:15:03,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:03,518 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-10 15:15:03,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:15:03,519 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-10 15:15:03,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-10 15:15:03,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:03,520 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:03,520 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:03,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:03,520 INFO L82 PathProgramCache]: Analyzing trace with hash 18238196, now seen corresponding path program 68 times [2018-10-10 15:15:03,521 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:03,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:06,196 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:06,197 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:06,197 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:15:06,197 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:15:06,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:15:06,198 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:15:06,198 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 72 states. [2018-10-10 15:15:09,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:09,370 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 15:15:09,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:15:09,371 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 359 [2018-10-10 15:15:09,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:09,372 INFO L225 Difference]: With dead ends: 365 [2018-10-10 15:15:09,372 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 15:15:09,373 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:15:09,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 15:15:09,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 363. [2018-10-10 15:15:09,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-10 15:15:09,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-10 15:15:09,376 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 359 [2018-10-10 15:15:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:09,376 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-10 15:15:09,376 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:15:09,376 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-10 15:15:09,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-10 15:15:09,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:09,377 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:09,378 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:09,378 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:09,378 INFO L82 PathProgramCache]: Analyzing trace with hash -640247022, now seen corresponding path program 69 times [2018-10-10 15:15:09,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:09,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:11,954 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:11,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:11,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:15:11,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:15:11,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:15:11,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:15:11,955 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 73 states. [2018-10-10 15:15:15,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:15,481 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-10 15:15:15,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:15:15,481 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 362 [2018-10-10 15:15:15,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:15,482 INFO L225 Difference]: With dead ends: 368 [2018-10-10 15:15:15,482 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 15:15:15,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:15:15,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 15:15:15,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2018-10-10 15:15:15,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-10 15:15:15,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-10-10 15:15:15,487 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 362 [2018-10-10 15:15:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:15,487 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-10-10 15:15:15,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:15:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-10-10 15:15:15,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-10 15:15:15,488 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:15,488 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:15,488 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash 1837231668, now seen corresponding path program 70 times [2018-10-10 15:15:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:15,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:17,846 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:17,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:17,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:15:17,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:15:17,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:15:17,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:15:17,847 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 74 states. [2018-10-10 15:15:21,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:21,576 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-10 15:15:21,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:15:21,576 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 365 [2018-10-10 15:15:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:21,578 INFO L225 Difference]: With dead ends: 371 [2018-10-10 15:15:21,578 INFO L226 Difference]: Without dead ends: 371 [2018-10-10 15:15:21,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:15:21,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-10 15:15:21,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-10-10 15:15:21,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-10 15:15:21,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-10-10 15:15:21,582 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 365 [2018-10-10 15:15:21,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:21,582 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-10-10 15:15:21,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:15:21,582 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-10-10 15:15:21,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-10 15:15:21,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:21,584 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:21,584 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:21,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:21,584 INFO L82 PathProgramCache]: Analyzing trace with hash -608096302, now seen corresponding path program 71 times [2018-10-10 15:15:21,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:21,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:24,334 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:24,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:24,335 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:15:24,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:15:24,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:15:24,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:15:24,336 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 75 states. [2018-10-10 15:15:28,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:28,258 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-10 15:15:28,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:15:28,259 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 368 [2018-10-10 15:15:28,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:28,260 INFO L225 Difference]: With dead ends: 374 [2018-10-10 15:15:28,260 INFO L226 Difference]: Without dead ends: 374 [2018-10-10 15:15:28,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:15:28,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-10 15:15:28,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2018-10-10 15:15:28,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-10 15:15:28,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-10-10 15:15:28,264 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 368 [2018-10-10 15:15:28,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:28,264 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-10-10 15:15:28,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:15:28,264 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-10-10 15:15:28,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-10 15:15:28,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:28,266 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:28,266 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:28,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:28,266 INFO L82 PathProgramCache]: Analyzing trace with hash 1861624180, now seen corresponding path program 72 times [2018-10-10 15:15:28,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:28,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:30,976 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:30,977 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:30,977 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:15:30,977 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:15:30,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:15:30,978 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:15:30,978 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 76 states. [2018-10-10 15:15:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:34,730 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-10 15:15:34,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:15:34,731 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 371 [2018-10-10 15:15:34,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:34,732 INFO L225 Difference]: With dead ends: 377 [2018-10-10 15:15:34,732 INFO L226 Difference]: Without dead ends: 377 [2018-10-10 15:15:34,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:15:34,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-10 15:15:34,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2018-10-10 15:15:34,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 15:15:34,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-10 15:15:34,736 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 371 [2018-10-10 15:15:34,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:34,736 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-10 15:15:34,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:15:34,737 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-10 15:15:34,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-10 15:15:34,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:34,738 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:34,738 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:34,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:34,738 INFO L82 PathProgramCache]: Analyzing trace with hash 219755666, now seen corresponding path program 73 times [2018-10-10 15:15:34,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:34,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:37,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:37,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:37,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:15:37,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:15:37,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:15:37,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:15:37,546 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 77 states. [2018-10-10 15:15:41,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:41,443 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-10-10 15:15:41,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:15:41,443 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 374 [2018-10-10 15:15:41,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:41,444 INFO L225 Difference]: With dead ends: 380 [2018-10-10 15:15:41,444 INFO L226 Difference]: Without dead ends: 380 [2018-10-10 15:15:41,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:15:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-10 15:15:41,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2018-10-10 15:15:41,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-10 15:15:41,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-10-10 15:15:41,448 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 374 [2018-10-10 15:15:41,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:41,448 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-10-10 15:15:41,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:15:41,448 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-10-10 15:15:41,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-10 15:15:41,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:41,450 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:41,450 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:41,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:41,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1597578060, now seen corresponding path program 74 times [2018-10-10 15:15:41,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:44,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:44,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:44,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:15:44,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:15:44,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:15:44,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:15:44,243 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 78 states. [2018-10-10 15:15:48,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:48,070 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-10 15:15:48,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:15:48,070 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 377 [2018-10-10 15:15:48,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:48,072 INFO L225 Difference]: With dead ends: 383 [2018-10-10 15:15:48,072 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 15:15:48,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:15:48,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 15:15:48,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2018-10-10 15:15:48,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-10 15:15:48,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-10 15:15:48,076 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 377 [2018-10-10 15:15:48,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:48,076 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-10 15:15:48,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:15:48,077 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-10 15:15:48,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-10 15:15:48,078 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:48,078 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:48,078 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:48,079 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:48,079 INFO L82 PathProgramCache]: Analyzing trace with hash 571124050, now seen corresponding path program 75 times [2018-10-10 15:15:48,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:50,914 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:50,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:50,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:15:50,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:15:50,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:15:50,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:15:50,915 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 79 states. [2018-10-10 15:15:54,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:54,814 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-10 15:15:54,814 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:15:54,814 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 380 [2018-10-10 15:15:54,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:54,816 INFO L225 Difference]: With dead ends: 386 [2018-10-10 15:15:54,816 INFO L226 Difference]: Without dead ends: 386 [2018-10-10 15:15:54,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:15:54,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-10 15:15:54,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-10 15:15:54,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-10 15:15:54,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 384 transitions. [2018-10-10 15:15:54,820 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 384 transitions. Word has length 380 [2018-10-10 15:15:54,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:54,820 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 384 transitions. [2018-10-10 15:15:54,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:15:54,820 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 384 transitions. [2018-10-10 15:15:54,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-10 15:15:54,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:54,821 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:15:54,822 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:54,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:54,822 INFO L82 PathProgramCache]: Analyzing trace with hash -817350668, now seen corresponding path program 76 times [2018-10-10 15:15:54,822 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:54,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:57,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:57,713 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:57,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:15:57,714 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:15:57,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:15:57,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:15:57,714 INFO L87 Difference]: Start difference. First operand 384 states and 384 transitions. Second operand 80 states. [2018-10-10 15:16:02,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:02,043 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-10 15:16:02,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:16:02,043 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 383 [2018-10-10 15:16:02,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:02,044 INFO L225 Difference]: With dead ends: 389 [2018-10-10 15:16:02,045 INFO L226 Difference]: Without dead ends: 389 [2018-10-10 15:16:02,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:16:02,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-10 15:16:02,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2018-10-10 15:16:02,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-10 15:16:02,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-10 15:16:02,048 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 383 [2018-10-10 15:16:02,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:02,049 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-10 15:16:02,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:16:02,049 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-10 15:16:02,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-10 15:16:02,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:02,050 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:02,050 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:02,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:02,051 INFO L82 PathProgramCache]: Analyzing trace with hash -37646830, now seen corresponding path program 77 times [2018-10-10 15:16:02,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:02,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:04,910 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:04,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:04,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:16:04,911 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:16:04,911 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:16:04,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:16:04,912 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 81 states. [2018-10-10 15:16:09,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:09,341 INFO L93 Difference]: Finished difference Result 392 states and 392 transitions. [2018-10-10 15:16:09,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:16:09,342 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 386 [2018-10-10 15:16:09,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:09,343 INFO L225 Difference]: With dead ends: 392 [2018-10-10 15:16:09,343 INFO L226 Difference]: Without dead ends: 392 [2018-10-10 15:16:09,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:16:09,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-10 15:16:09,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2018-10-10 15:16:09,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-10 15:16:09,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-10 15:16:09,348 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 386 [2018-10-10 15:16:09,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:09,348 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-10 15:16:09,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:16:09,348 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-10 15:16:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-10 15:16:09,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:09,350 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:09,350 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:09,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:09,350 INFO L82 PathProgramCache]: Analyzing trace with hash 936254260, now seen corresponding path program 78 times [2018-10-10 15:16:09,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:12,462 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:12,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:12,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:16:12,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:16:12,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:16:12,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:16:12,464 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 82 states. [2018-10-10 15:16:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:16,884 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-10 15:16:16,884 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:16:16,884 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 389 [2018-10-10 15:16:16,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:16,885 INFO L225 Difference]: With dead ends: 395 [2018-10-10 15:16:16,885 INFO L226 Difference]: Without dead ends: 395 [2018-10-10 15:16:16,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:16:16,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-10 15:16:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2018-10-10 15:16:16,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-10 15:16:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-10 15:16:16,890 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 389 [2018-10-10 15:16:16,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:16,890 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-10 15:16:16,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:16:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-10 15:16:16,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-10 15:16:16,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:16,891 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:16,892 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:16,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:16,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1919541970, now seen corresponding path program 79 times [2018-10-10 15:16:16,892 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:19,831 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:19,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:19,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:16:19,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:16:19,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:16:19,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:16:19,833 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 83 states. [2018-10-10 15:16:24,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:24,450 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-10 15:16:24,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:16:24,451 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 392 [2018-10-10 15:16:24,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:24,452 INFO L225 Difference]: With dead ends: 398 [2018-10-10 15:16:24,452 INFO L226 Difference]: Without dead ends: 398 [2018-10-10 15:16:24,453 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:16:24,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-10 15:16:24,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2018-10-10 15:16:24,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-10 15:16:24,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-10-10 15:16:24,457 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 392 [2018-10-10 15:16:24,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:24,457 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-10-10 15:16:24,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:16:24,457 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-10-10 15:16:24,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-10 15:16:24,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:24,459 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:24,459 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:24,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:24,459 INFO L82 PathProgramCache]: Analyzing trace with hash -928215436, now seen corresponding path program 80 times [2018-10-10 15:16:24,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:24,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:27,717 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:27,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:27,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:16:27,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:16:27,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:16:27,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:16:27,718 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 84 states. [2018-10-10 15:16:32,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:32,327 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-10 15:16:32,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:16:32,328 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 395 [2018-10-10 15:16:32,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:32,329 INFO L225 Difference]: With dead ends: 401 [2018-10-10 15:16:32,329 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 15:16:32,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:16:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 15:16:32,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2018-10-10 15:16:32,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-10 15:16:32,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-10-10 15:16:32,332 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 395 [2018-10-10 15:16:32,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:32,333 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-10-10 15:16:32,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:16:32,333 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-10-10 15:16:32,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-10 15:16:32,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:32,334 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:32,334 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:32,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:32,335 INFO L82 PathProgramCache]: Analyzing trace with hash 19900306, now seen corresponding path program 81 times [2018-10-10 15:16:32,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:32,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:35,486 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:35,487 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:35,487 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:16:35,487 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:16:35,488 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:16:35,488 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:16:35,488 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 85 states. [2018-10-10 15:16:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:40,160 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-10 15:16:40,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:16:40,161 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 398 [2018-10-10 15:16:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:40,162 INFO L225 Difference]: With dead ends: 404 [2018-10-10 15:16:40,162 INFO L226 Difference]: Without dead ends: 404 [2018-10-10 15:16:40,163 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:16:40,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-10 15:16:40,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2018-10-10 15:16:40,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-10 15:16:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-10-10 15:16:40,167 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 398 [2018-10-10 15:16:40,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:40,167 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-10-10 15:16:40,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:16:40,167 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-10-10 15:16:40,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-10 15:16:40,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:40,169 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:40,169 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:40,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:40,169 INFO L82 PathProgramCache]: Analyzing trace with hash 1631031732, now seen corresponding path program 82 times [2018-10-10 15:16:40,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:43,493 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:43,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:43,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:16:43,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:16:43,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:16:43,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:16:43,495 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 86 states. [2018-10-10 15:16:48,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:48,045 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-10 15:16:48,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:16:48,046 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 401 [2018-10-10 15:16:48,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:48,047 INFO L225 Difference]: With dead ends: 407 [2018-10-10 15:16:48,047 INFO L226 Difference]: Without dead ends: 407 [2018-10-10 15:16:48,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:16:48,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-10 15:16:48,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-10-10 15:16:48,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 15:16:48,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-10-10 15:16:48,051 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 401 [2018-10-10 15:16:48,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:48,052 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-10-10 15:16:48,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:16:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-10-10 15:16:48,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-10 15:16:48,053 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:48,053 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:48,054 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:48,054 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:48,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1707156398, now seen corresponding path program 83 times [2018-10-10 15:16:48,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:48,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:51,308 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:51,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:51,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:16:51,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:16:51,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:16:51,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:16:51,310 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 87 states. [2018-10-10 15:16:56,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:56,058 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-10-10 15:16:56,058 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:16:56,059 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 404 [2018-10-10 15:16:56,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:56,060 INFO L225 Difference]: With dead ends: 410 [2018-10-10 15:16:56,060 INFO L226 Difference]: Without dead ends: 410 [2018-10-10 15:16:56,061 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:16:56,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-10 15:16:56,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-10-10 15:16:56,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-10 15:16:56,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-10-10 15:16:56,064 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 404 [2018-10-10 15:16:56,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:56,065 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-10-10 15:16:56,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:16:56,065 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-10-10 15:16:56,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-10 15:16:56,066 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:56,066 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:16:56,067 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:56,067 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:56,067 INFO L82 PathProgramCache]: Analyzing trace with hash 298001652, now seen corresponding path program 84 times [2018-10-10 15:16:56,067 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:59,692 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:59,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:59,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:16:59,693 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:16:59,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:16:59,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:16:59,694 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 88 states. [2018-10-10 15:17:04,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:04,728 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-10 15:17:04,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:17:04,728 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 407 [2018-10-10 15:17:04,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:04,729 INFO L225 Difference]: With dead ends: 413 [2018-10-10 15:17:04,730 INFO L226 Difference]: Without dead ends: 413 [2018-10-10 15:17:04,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:17:04,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-10 15:17:04,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2018-10-10 15:17:04,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-10 15:17:04,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-10 15:17:04,734 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 407 [2018-10-10 15:17:04,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:04,735 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-10 15:17:04,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:17:04,735 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-10 15:17:04,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-10 15:17:04,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:04,737 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:04,738 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:04,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:04,738 INFO L82 PathProgramCache]: Analyzing trace with hash 1556316434, now seen corresponding path program 85 times [2018-10-10 15:17:04,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:08,406 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:08,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:08,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:17:08,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:17:08,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:17:08,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:17:08,408 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 89 states. [2018-10-10 15:17:13,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:13,451 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-10 15:17:13,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:17:13,452 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 410 [2018-10-10 15:17:13,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:13,453 INFO L225 Difference]: With dead ends: 416 [2018-10-10 15:17:13,453 INFO L226 Difference]: Without dead ends: 416 [2018-10-10 15:17:13,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:17:13,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-10 15:17:13,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2018-10-10 15:17:13,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-10 15:17:13,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-10 15:17:13,458 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 410 [2018-10-10 15:17:13,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:13,459 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-10 15:17:13,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:17:13,459 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-10 15:17:13,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-10 15:17:13,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:13,461 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:13,461 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:13,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:13,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1537427508, now seen corresponding path program 86 times [2018-10-10 15:17:13,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:16,913 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:16,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:16,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:17:16,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:17:16,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:17:16,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:17:16,916 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 90 states. [2018-10-10 15:17:22,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:22,235 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-10-10 15:17:22,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:17:22,236 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 413 [2018-10-10 15:17:22,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:22,237 INFO L225 Difference]: With dead ends: 419 [2018-10-10 15:17:22,237 INFO L226 Difference]: Without dead ends: 419 [2018-10-10 15:17:22,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:17:22,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-10 15:17:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-10 15:17:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-10 15:17:22,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-10 15:17:22,242 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 413 [2018-10-10 15:17:22,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:22,243 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-10 15:17:22,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:17:22,243 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-10 15:17:22,244 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-10 15:17:22,244 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:22,244 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:22,245 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:22,245 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:22,245 INFO L82 PathProgramCache]: Analyzing trace with hash 1458148818, now seen corresponding path program 87 times [2018-10-10 15:17:22,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:22,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:26,063 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:26,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:26,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:17:26,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:17:26,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:17:26,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:17:26,065 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 91 states. [2018-10-10 15:17:31,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:31,280 INFO L93 Difference]: Finished difference Result 422 states and 422 transitions. [2018-10-10 15:17:31,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:17:31,280 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 416 [2018-10-10 15:17:31,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:31,281 INFO L225 Difference]: With dead ends: 422 [2018-10-10 15:17:31,281 INFO L226 Difference]: Without dead ends: 422 [2018-10-10 15:17:31,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:17:31,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-10 15:17:31,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-10-10 15:17:31,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-10 15:17:31,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 420 transitions. [2018-10-10 15:17:31,286 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 420 transitions. Word has length 416 [2018-10-10 15:17:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:31,286 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 420 transitions. [2018-10-10 15:17:31,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:17:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 420 transitions. [2018-10-10 15:17:31,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 420 [2018-10-10 15:17:31,288 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:31,288 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:31,288 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:31,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:31,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1898707828, now seen corresponding path program 88 times [2018-10-10 15:17:31,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:31,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:35,127 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:35,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:35,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:17:35,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:17:35,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:17:35,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:17:35,129 INFO L87 Difference]: Start difference. First operand 420 states and 420 transitions. Second operand 92 states. [2018-10-10 15:17:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:40,654 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-10 15:17:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:17:40,655 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 419 [2018-10-10 15:17:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:40,656 INFO L225 Difference]: With dead ends: 425 [2018-10-10 15:17:40,656 INFO L226 Difference]: Without dead ends: 425 [2018-10-10 15:17:40,657 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:17:40,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-10 15:17:40,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2018-10-10 15:17:40,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 15:17:40,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-10 15:17:40,661 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 419 [2018-10-10 15:17:40,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:40,661 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-10 15:17:40,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:17:40,661 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-10 15:17:40,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-10 15:17:40,663 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:40,663 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:40,663 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:40,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:40,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1172118162, now seen corresponding path program 89 times [2018-10-10 15:17:40,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:17:44,671 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:17:44,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:17:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:17:44,672 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 93 states. [2018-10-10 15:17:50,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:50,337 INFO L93 Difference]: Finished difference Result 428 states and 428 transitions. [2018-10-10 15:17:50,337 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:17:50,337 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 422 [2018-10-10 15:17:50,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:50,339 INFO L225 Difference]: With dead ends: 428 [2018-10-10 15:17:50,339 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 15:17:50,340 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:17:50,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 15:17:50,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-10-10 15:17:50,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-10 15:17:50,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 426 transitions. [2018-10-10 15:17:50,344 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 426 transitions. Word has length 422 [2018-10-10 15:17:50,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:50,344 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 426 transitions. [2018-10-10 15:17:50,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:17:50,345 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 426 transitions. [2018-10-10 15:17:50,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2018-10-10 15:17:50,346 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:50,347 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:50,347 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:50,347 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash 1974550196, now seen corresponding path program 90 times [2018-10-10 15:17:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:50,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:54,296 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:54,296 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:54,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:17:54,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:17:54,297 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:17:54,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:17:54,298 INFO L87 Difference]: Start difference. First operand 426 states and 426 transitions. Second operand 94 states. [2018-10-10 15:17:59,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:59,850 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-10-10 15:17:59,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:17:59,850 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 425 [2018-10-10 15:17:59,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:59,852 INFO L225 Difference]: With dead ends: 431 [2018-10-10 15:17:59,852 INFO L226 Difference]: Without dead ends: 431 [2018-10-10 15:17:59,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:17:59,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-10 15:17:59,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2018-10-10 15:17:59,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-10 15:17:59,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 429 transitions. [2018-10-10 15:17:59,856 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 429 transitions. Word has length 425 [2018-10-10 15:17:59,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:59,856 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 429 transitions. [2018-10-10 15:17:59,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:17:59,857 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 429 transitions. [2018-10-10 15:17:59,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 429 [2018-10-10 15:17:59,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:59,858 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:17:59,858 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:59,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:59,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1439305554, now seen corresponding path program 91 times [2018-10-10 15:17:59,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:59,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:03,642 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:03,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:03,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:18:03,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:18:03,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:18:03,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:18:03,644 INFO L87 Difference]: Start difference. First operand 429 states and 429 transitions. Second operand 95 states. [2018-10-10 15:18:09,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:09,411 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-10 15:18:09,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:18:09,411 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 428 [2018-10-10 15:18:09,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:09,413 INFO L225 Difference]: With dead ends: 434 [2018-10-10 15:18:09,413 INFO L226 Difference]: Without dead ends: 434 [2018-10-10 15:18:09,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:18:09,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-10 15:18:09,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2018-10-10 15:18:09,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-10 15:18:09,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-10-10 15:18:09,417 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 428 [2018-10-10 15:18:09,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:09,417 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-10-10 15:18:09,417 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:18:09,417 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-10-10 15:18:09,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-10-10 15:18:09,419 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:09,419 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:09,419 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:09,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:09,420 INFO L82 PathProgramCache]: Analyzing trace with hash -1115221516, now seen corresponding path program 92 times [2018-10-10 15:18:09,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:09,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:13,309 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:13,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:13,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:18:13,310 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:18:13,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:18:13,311 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:18:13,311 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 96 states. [2018-10-10 15:18:18,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:18,888 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-10-10 15:18:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:18:18,888 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 431 [2018-10-10 15:18:18,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:18,890 INFO L225 Difference]: With dead ends: 437 [2018-10-10 15:18:18,890 INFO L226 Difference]: Without dead ends: 437 [2018-10-10 15:18:18,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:18:18,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-10 15:18:18,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2018-10-10 15:18:18,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 15:18:18,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 435 transitions. [2018-10-10 15:18:18,894 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 435 transitions. Word has length 431 [2018-10-10 15:18:18,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:18,895 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 435 transitions. [2018-10-10 15:18:18,895 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:18:18,895 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 435 transitions. [2018-10-10 15:18:18,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 435 [2018-10-10 15:18:18,896 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:18,897 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:18,897 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:18,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:18,897 INFO L82 PathProgramCache]: Analyzing trace with hash -505646062, now seen corresponding path program 93 times [2018-10-10 15:18:18,898 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:23,164 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:23,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:23,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:18:23,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:18:23,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:18:23,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:18:23,166 INFO L87 Difference]: Start difference. First operand 435 states and 435 transitions. Second operand 97 states. [2018-10-10 15:18:28,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:28,890 INFO L93 Difference]: Finished difference Result 438 states and 438 transitions. [2018-10-10 15:18:28,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:18:28,890 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 434 [2018-10-10 15:18:28,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:28,891 INFO L225 Difference]: With dead ends: 438 [2018-10-10 15:18:28,892 INFO L226 Difference]: Without dead ends: 438 [2018-10-10 15:18:28,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:18:28,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2018-10-10 15:18:28,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 438. [2018-10-10 15:18:28,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-10 15:18:28,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 438 transitions. [2018-10-10 15:18:28,897 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 438 transitions. Word has length 434 [2018-10-10 15:18:28,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:28,897 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 438 transitions. [2018-10-10 15:18:28,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:18:28,897 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 438 transitions. [2018-10-10 15:18:28,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2018-10-10 15:18:28,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:28,899 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:28,899 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:28,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:28,899 INFO L82 PathProgramCache]: Analyzing trace with hash 234976564, now seen corresponding path program 94 times [2018-10-10 15:18:28,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:28,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:30,624 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:18:30,624 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:18:30,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2018-10-10 15:18:30,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:18:30,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:18:30,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:18:30,626 INFO L87 Difference]: Start difference. First operand 438 states and 438 transitions. Second operand 15 states. [2018-10-10 15:18:32,007 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 39 [2018-10-10 15:18:32,342 WARN L178 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 53 [2018-10-10 15:18:32,823 WARN L178 SmtUtils]: Spent 289.00 ms on a formula simplification that was a NOOP. DAG size: 45 [2018-10-10 15:18:32,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:32,912 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2018-10-10 15:18:32,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:18:32,912 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 437 [2018-10-10 15:18:32,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:32,913 INFO L225 Difference]: With dead ends: 436 [2018-10-10 15:18:32,913 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:18:32,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=153, Invalid=399, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:18:32,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:18:32,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:18:32,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:18:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:18:32,914 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 437 [2018-10-10 15:18:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:32,914 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:18:32,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:18:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:18:32,915 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:18:32,919 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_44.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:18:32 BoogieIcfgContainer [2018-10-10 15:18:32,919 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:18:32,920 INFO L168 Benchmark]: Toolchain (without parser) took 381842.23 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 80.7 MB). Free memory was 1.5 GB in the beginning and 923.2 MB in the end (delta: 551.4 MB). Peak memory consumption was 632.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:32,921 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 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-10-10 15:18:32,921 INFO L168 Benchmark]: Boogie Preprocessor took 86.48 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-10-10 15:18:32,921 INFO L168 Benchmark]: RCFGBuilder took 1154.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:32,922 INFO L168 Benchmark]: TraceAbstraction took 380597.11 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 80.7 MB). Free memory was 1.4 GB in the beginning and 923.2 MB in the end (delta: 509.1 MB). Peak memory consumption was 589.8 MB. Max. memory is 7.1 GB. [2018-10-10 15:18:32,925 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.19 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 86.48 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 1154.27 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 380597.11 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 80.7 MB). Free memory was 1.4 GB in the beginning and 923.2 MB in the end (delta: 509.1 MB). Peak memory consumption was 589.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 228]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 160 locations, 1 error locations. SAFE Result, 380.5s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 213.5s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 14378 SDtfs, 31348 SDslu, 475351 SDs, 0 SdLazy, 30169 SolverSat, 4646 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 29.4s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9143 GetRequests, 190 SyntacticMatches, 1 SemanticMatches, 8952 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138463 ImplicationChecksByTransitivity, 324.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=438occurred in iteration=94, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.4s SatisfiabilityAnalysisTime, 155.5s InterpolantComputationTime, 28120 NumberOfCodeBlocks, 28120 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 28025 ConstructedInterpolants, 0 QuantifiedInterpolants, 30018179 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 95 InterpolantComputations, 2 PerfectInterpolantSequences, 13207/419710 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_44.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-18-32-934.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_44.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-18-32-934.csv Received shutdown request...