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_35.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:10:52,940 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:10:52,942 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:10:52,953 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:10:52,954 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:10:52,955 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:10:52,956 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:10:52,958 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:10:52,960 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:10:52,960 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:10:52,961 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:10:52,962 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:10:52,963 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:10:52,963 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:10:52,965 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:10:52,965 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:10:52,966 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:10:52,968 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:10:52,970 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:10:52,972 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:10:52,973 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:10:52,974 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:10:52,977 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:10:52,977 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:10:52,978 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:10:52,979 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:10:52,980 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:10:52,981 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:10:52,981 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:10:52,983 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:10:52,983 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:10:52,984 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:10:52,984 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:10:52,984 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:10:52,985 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:10:52,986 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:10:52,986 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:10:53,003 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:10:53,004 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:10:53,005 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:10:53,005 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:10:53,006 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:10:53,006 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:10:53,007 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:10:53,007 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:10:53,007 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:10:53,007 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:10:53,008 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:10:53,008 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:10:53,008 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:10:53,009 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:10:53,010 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:10:53,078 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:10:53,094 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:10:53,102 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:10:53,103 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:10:53,104 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:10:53,105 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_35.bpl [2018-10-10 15:10:53,105 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_35.bpl' [2018-10-10 15:10:53,183 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:10:53,185 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:10:53,185 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,186 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:10:53,186 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:10:53,214 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,240 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,250 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,264 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,270 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,275 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/1) ... [2018-10-10 15:10:53,278 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:10:53,279 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:10:53,280 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:10:53,280 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:10:53,281 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (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:10:53,341 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:10:53,341 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:10:53,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:10:54,252 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:10:54,253 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54 BoogieIcfgContainer [2018-10-10 15:10:54,253 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:10:54,255 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:10:54,255 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:10:54,258 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:10:54,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:10:53" (1/2) ... [2018-10-10 15:10:54,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33d60ef2 and model type 20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:10:54, skipping insertion in model container [2018-10-10 15:10:54,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:10:54" (2/2) ... [2018-10-10 15:10:54,262 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_35.bpl [2018-10-10 15:10:54,272 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:10:54,283 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:10:54,301 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:10:54,333 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:10:54,334 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:10:54,334 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:10:54,334 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:10:54,334 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:10:54,334 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:10:54,335 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:10:54,335 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:10:54,335 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:10:54,358 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states. [2018-10-10 15:10:54,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:10:54,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:54,376 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] [2018-10-10 15:10:54,377 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:54,384 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:54,384 INFO L82 PathProgramCache]: Analyzing trace with hash 1780292200, now seen corresponding path program 1 times [2018-10-10 15:10:54,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:54,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:54,855 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:10:54,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:10:54,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:10:54,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:10:54,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:10:54,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:10:54,885 INFO L87 Difference]: Start difference. First operand 136 states. Second operand 4 states. [2018-10-10 15:10:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,006 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:10:55,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:10:55,008 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 131 [2018-10-10 15:10:55,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,024 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:10:55,024 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:10:55,028 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:10:55,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:10:55,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2018-10-10 15:10:55,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-10 15:10:55,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-10 15:10:55,100 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 131 [2018-10-10 15:10:55,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,100 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-10 15:10:55,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:10:55,101 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-10 15:10:55,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-10 15:10:55,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,107 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] [2018-10-10 15:10:55,108 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,108 INFO L82 PathProgramCache]: Analyzing trace with hash -71175802, now seen corresponding path program 1 times [2018-10-10 15:10:55,110 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,332 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:10:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:10:55,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:10:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:10:55,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:10:55,336 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 5 states. [2018-10-10 15:10:55,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,472 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-10 15:10:55,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:10:55,472 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 134 [2018-10-10 15:10:55,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,475 INFO L225 Difference]: With dead ends: 140 [2018-10-10 15:10:55,475 INFO L226 Difference]: Without dead ends: 140 [2018-10-10 15:10:55,476 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-10 15:10:55,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 138. [2018-10-10 15:10:55,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:10:55,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:10:55,491 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 134 [2018-10-10 15:10:55,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,492 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:10:55,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:10:55,495 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:10:55,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:10:55,498 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,498 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] [2018-10-10 15:10:55,500 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,501 INFO L82 PathProgramCache]: Analyzing trace with hash -1184408152, now seen corresponding path program 2 times [2018-10-10 15:10:55,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:55,731 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:10:55,732 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:55,732 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:10:55,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:10:55,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:10:55,733 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:10:55,734 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 6 states. [2018-10-10 15:10:55,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:55,882 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:10:55,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:10:55,889 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 137 [2018-10-10 15:10:55,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:55,891 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:10:55,891 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:10:55,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:55,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:10:55,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 141. [2018-10-10 15:10:55,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-10 15:10:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-10 15:10:55,906 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 137 [2018-10-10 15:10:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:55,907 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-10 15:10:55,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:10:55,907 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-10 15:10:55,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-10 15:10:55,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:55,917 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] [2018-10-10 15:10:55,917 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:55,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:55,918 INFO L82 PathProgramCache]: Analyzing trace with hash 248112710, now seen corresponding path program 3 times [2018-10-10 15:10:55,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:56,306 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:10:56,306 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:56,306 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:10:56,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:10:56,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:10:56,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:10:56,308 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 7 states. [2018-10-10 15:10:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:56,782 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-10 15:10:56,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:10:56,786 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 140 [2018-10-10 15:10:56,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:56,788 INFO L225 Difference]: With dead ends: 146 [2018-10-10 15:10:56,788 INFO L226 Difference]: Without dead ends: 146 [2018-10-10 15:10:56,789 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:56,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-10 15:10:56,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 144. [2018-10-10 15:10:56,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:10:56,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:10:56,812 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 140 [2018-10-10 15:10:56,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:56,813 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:10:56,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:10:56,813 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:10:56,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:10:56,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:56,816 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] [2018-10-10 15:10:56,818 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:56,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:56,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1682059496, now seen corresponding path program 4 times [2018-10-10 15:10:56,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,224 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:10:57,225 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:10:57,226 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:10:57,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:10:57,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:10:57,226 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 8 states. [2018-10-10 15:10:57,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,423 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:10:57,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:10:57,427 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 143 [2018-10-10 15:10:57,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,429 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:10:57,429 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:10:57,429 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:10:57,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:10:57,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 147. [2018-10-10 15:10:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-10 15:10:57,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-10 15:10:57,447 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 143 [2018-10-10 15:10:57,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,447 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-10 15:10:57,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:10:57,448 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-10 15:10:57,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-10 15:10:57,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,450 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] [2018-10-10 15:10:57,451 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1648932090, now seen corresponding path program 5 times [2018-10-10 15:10:57,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:57,750 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:10:57,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:57,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:10:57,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:10:57,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:10:57,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:10:57,752 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 9 states. [2018-10-10 15:10:57,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:57,901 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-10 15:10:57,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:10:57,902 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 146 [2018-10-10 15:10:57,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:57,903 INFO L225 Difference]: With dead ends: 152 [2018-10-10 15:10:57,904 INFO L226 Difference]: Without dead ends: 152 [2018-10-10 15:10:57,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:10:57,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-10 15:10:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 150. [2018-10-10 15:10:57,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:10:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:10:57,911 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 146 [2018-10-10 15:10:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:57,911 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:10:57,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:10:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:10:57,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:10:57,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:57,914 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] [2018-10-10 15:10:57,914 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:57,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:57,915 INFO L82 PathProgramCache]: Analyzing trace with hash 103464, now seen corresponding path program 6 times [2018-10-10 15:10:57,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:57,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,123 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:10:58,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,123 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:10:58,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:10:58,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:10:58,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:10:58,125 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 10 states. [2018-10-10 15:10:58,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,320 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:10:58,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:10:58,326 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2018-10-10 15:10:58,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,328 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:10:58,328 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:10:58,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:10:58,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:10:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 153. [2018-10-10 15:10:58,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-10 15:10:58,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-10 15:10:58,334 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 149 [2018-10-10 15:10:58,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,335 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-10 15:10:58,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:10:58,335 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-10 15:10:58,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-10 15:10:58,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,337 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] [2018-10-10 15:10:58,337 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,338 INFO L82 PathProgramCache]: Analyzing trace with hash 582361030, now seen corresponding path program 7 times [2018-10-10 15:10:58,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:58,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:58,658 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:10:58,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:58,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:10:58,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:10:58,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:10:58,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:10:58,660 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 11 states. [2018-10-10 15:10:58,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:58,975 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-10 15:10:58,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:10:58,985 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 152 [2018-10-10 15:10:58,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:58,987 INFO L225 Difference]: With dead ends: 158 [2018-10-10 15:10:58,987 INFO L226 Difference]: Without dead ends: 158 [2018-10-10 15:10:58,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:10:58,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-10 15:10:58,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 156. [2018-10-10 15:10:58,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:10:58,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:10:58,993 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 152 [2018-10-10 15:10:58,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:58,994 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:10:58,994 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:10:58,994 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:10:58,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:10:58,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:58,996 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] [2018-10-10 15:10:58,996 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:58,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:58,997 INFO L82 PathProgramCache]: Analyzing trace with hash -755398808, now seen corresponding path program 8 times [2018-10-10 15:10:58,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:10:59,480 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:10:59,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:10:59,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:10:59,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:10:59,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:10:59,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:10:59,482 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 12 states. [2018-10-10 15:10:59,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:10:59,733 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:10:59,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:10:59,737 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 155 [2018-10-10 15:10:59,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:10:59,738 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:10:59,739 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:10:59,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:10:59,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:10:59,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 159. [2018-10-10 15:10:59,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-10 15:10:59,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-10 15:10:59,743 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 155 [2018-10-10 15:10:59,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:10:59,744 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-10 15:10:59,744 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:10:59,744 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-10 15:10:59,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-10 15:10:59,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:10:59,746 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] [2018-10-10 15:10:59,746 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:10:59,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:10:59,747 INFO L82 PathProgramCache]: Analyzing trace with hash -957193082, now seen corresponding path program 9 times [2018-10-10 15:10:59,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:10:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:00,073 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:11:00,074 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:00,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:11:00,074 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:11:00,075 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:11:00,075 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:11:00,075 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 13 states. [2018-10-10 15:11:00,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:00,305 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-10 15:11:00,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:11:00,306 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 158 [2018-10-10 15:11:00,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:00,307 INFO L225 Difference]: With dead ends: 164 [2018-10-10 15:11:00,307 INFO L226 Difference]: Without dead ends: 164 [2018-10-10 15:11:00,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:00,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-10 15:11:00,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2018-10-10 15:11:00,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:11:00,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:11:00,311 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 158 [2018-10-10 15:11:00,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:00,312 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:11:00,312 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:11:00,312 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:11:00,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:11:00,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:00,314 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] [2018-10-10 15:11:00,314 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:00,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:00,315 INFO L82 PathProgramCache]: Analyzing trace with hash 343804584, now seen corresponding path program 10 times [2018-10-10 15:11:00,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:01,109 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:11:01,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:01,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:11:01,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:11:01,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:11:01,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:11:01,111 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 14 states. [2018-10-10 15:11:01,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:01,493 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:11:01,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:11:01,494 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 161 [2018-10-10 15:11:01,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:01,495 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:11:01,495 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:11:01,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:01,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:11:01,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 165. [2018-10-10 15:11:01,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-10 15:11:01,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-10 15:11:01,500 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 161 [2018-10-10 15:11:01,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:01,500 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-10 15:11:01,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:11:01,501 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-10 15:11:01,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-10 15:11:01,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:01,502 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] [2018-10-10 15:11:01,502 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:01,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:01,503 INFO L82 PathProgramCache]: Analyzing trace with hash 580393286, now seen corresponding path program 11 times [2018-10-10 15:11:01,504 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:01,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:02,333 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:11:02,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:02,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:11:02,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:11:02,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:11:02,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:11:02,335 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 15 states. [2018-10-10 15:11:02,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:02,572 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-10 15:11:02,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:11:02,575 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 164 [2018-10-10 15:11:02,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:02,576 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:11:02,576 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:11:02,577 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:02,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:11:02,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:11:02,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:11:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:11:02,581 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 164 [2018-10-10 15:11:02,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:02,581 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:11:02,581 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:11:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:11:02,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:11:02,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:02,582 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] [2018-10-10 15:11:02,583 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:02,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:02,583 INFO L82 PathProgramCache]: Analyzing trace with hash 753081832, now seen corresponding path program 12 times [2018-10-10 15:11:02,584 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:02,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:03,059 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:11:03,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:03,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:11:03,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:11:03,061 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:11:03,061 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:11:03,062 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 16 states. [2018-10-10 15:11:03,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:03,355 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:11:03,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:11:03,355 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 167 [2018-10-10 15:11:03,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:03,357 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:11:03,357 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:11:03,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:03,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:11:03,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:11:03,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:11:03,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-10 15:11:03,365 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 167 [2018-10-10 15:11:03,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:03,370 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-10 15:11:03,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:11:03,371 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-10 15:11:03,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-10 15:11:03,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:03,372 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] [2018-10-10 15:11:03,372 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:03,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:03,373 INFO L82 PathProgramCache]: Analyzing trace with hash -53264890, now seen corresponding path program 13 times [2018-10-10 15:11:03,373 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:03,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,120 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:11:04,121 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,121 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:11:04,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:11:04,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:11:04,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:11:04,122 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 17 states. [2018-10-10 15:11:04,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:04,482 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-10 15:11:04,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:11:04,482 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 170 [2018-10-10 15:11:04,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:04,483 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:11:04,483 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:11:04,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:04,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:11:04,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:11:04,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:11:04,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:11:04,488 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 170 [2018-10-10 15:11:04,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:04,489 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:11:04,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:11:04,489 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:11:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:11:04,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:04,491 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] [2018-10-10 15:11:04,491 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:04,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:04,491 INFO L82 PathProgramCache]: Analyzing trace with hash -176373464, now seen corresponding path program 14 times [2018-10-10 15:11:04,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:04,845 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:11:04,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:04,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:11:04,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:11:04,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:11:04,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:11:04,847 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 18 states. [2018-10-10 15:11:05,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:05,344 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:11:05,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:11:05,345 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 173 [2018-10-10 15:11:05,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:05,346 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:11:05,346 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:11:05,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:05,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:11:05,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:11:05,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:11:05,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-10 15:11:05,351 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 173 [2018-10-10 15:11:05,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:05,351 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-10 15:11:05,351 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:11:05,352 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-10 15:11:05,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-10 15:11:05,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:05,353 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] [2018-10-10 15:11:05,353 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:05,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:05,353 INFO L82 PathProgramCache]: Analyzing trace with hash 198169286, now seen corresponding path program 15 times [2018-10-10 15:11:05,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:05,898 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:11:05,898 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:05,898 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:11:05,899 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:11:05,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:11:05,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:11:05,900 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 19 states. [2018-10-10 15:11:06,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:06,349 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-10 15:11:06,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:11:06,349 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 176 [2018-10-10 15:11:06,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:06,350 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:11:06,351 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:11:06,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:06,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:11:06,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:11:06,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:11:06,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:11:06,355 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 176 [2018-10-10 15:11:06,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:06,355 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:11:06,356 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:11:06,356 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:11:06,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:11:06,357 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:06,357 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] [2018-10-10 15:11:06,357 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:06,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:06,358 INFO L82 PathProgramCache]: Analyzing trace with hash -123800472, now seen corresponding path program 16 times [2018-10-10 15:11:06,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:06,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:06,896 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:11:06,897 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:06,897 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:11:06,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:11:06,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:11:06,898 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:11:06,898 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 20 states. [2018-10-10 15:11:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:07,289 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:11:07,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:11:07,291 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 179 [2018-10-10 15:11:07,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:07,292 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:11:07,292 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:11:07,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:07,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:11:07,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:11:07,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:11:07,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-10 15:11:07,297 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 179 [2018-10-10 15:11:07,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:07,298 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-10 15:11:07,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:11:07,298 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-10 15:11:07,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-10 15:11:07,299 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:07,299 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] [2018-10-10 15:11:07,299 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:07,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:07,300 INFO L82 PathProgramCache]: Analyzing trace with hash -1262889082, now seen corresponding path program 17 times [2018-10-10 15:11:07,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:07,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:07,630 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:11:07,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:07,631 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:11:07,631 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:11:07,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:11:07,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:11:07,632 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 21 states. [2018-10-10 15:11:08,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:08,283 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-10 15:11:08,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:11:08,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 182 [2018-10-10 15:11:08,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:08,285 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:11:08,285 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:11:08,286 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:08,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:11:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:11:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:11:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:11:08,289 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 182 [2018-10-10 15:11:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:08,290 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:11:08,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:11:08,290 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:11:08,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:11:08,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:08,291 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] [2018-10-10 15:11:08,291 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:08,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:08,292 INFO L82 PathProgramCache]: Analyzing trace with hash -1315063896, now seen corresponding path program 18 times [2018-10-10 15:11:08,293 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:08,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:08,702 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:11:08,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:08,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:11:08,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:11:08,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:11:08,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:11:08,704 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 22 states. [2018-10-10 15:11:09,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:09,405 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:11:09,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:11:09,408 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 185 [2018-10-10 15:11:09,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:09,409 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:11:09,409 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:11:09,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:09,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:11:09,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:11:09,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:11:09,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-10 15:11:09,414 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 185 [2018-10-10 15:11:09,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:09,414 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-10 15:11:09,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:11:09,414 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-10 15:11:09,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-10 15:11:09,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:09,415 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] [2018-10-10 15:11:09,416 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:09,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:09,416 INFO L82 PathProgramCache]: Analyzing trace with hash -876786618, now seen corresponding path program 19 times [2018-10-10 15:11:09,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:09,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:10,685 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:11:10,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:10,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:11:10,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:11:10,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:11:10,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:11:10,687 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 23 states. [2018-10-10 15:11:11,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:11,114 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:11:11,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:11:11,115 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 188 [2018-10-10 15:11:11,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:11,116 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:11:11,116 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:11:11,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:11,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:11:11,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:11:11,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:11:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:11:11,121 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 188 [2018-10-10 15:11:11,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:11,121 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:11:11,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:11:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:11:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:11:11,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:11,123 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] [2018-10-10 15:11:11,123 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:11,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:11,123 INFO L82 PathProgramCache]: Analyzing trace with hash -858977560, now seen corresponding path program 20 times [2018-10-10 15:11:11,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:11,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:12,603 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:11:12,603 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:12,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:11:12,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:11:12,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:11:12,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:11:12,605 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 24 states. [2018-10-10 15:11:13,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:13,102 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-10 15:11:13,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:11:13,102 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 191 [2018-10-10 15:11:13,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:13,103 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:11:13,103 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:11:13,104 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:13,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:11:13,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:11:13,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:11:13,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-10 15:11:13,107 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 191 [2018-10-10 15:11:13,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:13,108 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-10 15:11:13,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:11:13,108 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-10 15:11:13,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-10 15:11:13,109 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:13,109 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] [2018-10-10 15:11:13,110 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:13,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:13,110 INFO L82 PathProgramCache]: Analyzing trace with hash 1409691910, now seen corresponding path program 21 times [2018-10-10 15:11:13,111 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:13,816 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:11:13,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:13,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:11:13,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:11:13,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:11:13,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:11:13,817 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 25 states. [2018-10-10 15:11:15,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:15,128 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-10 15:11:15,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:11:15,129 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 194 [2018-10-10 15:11:15,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:15,130 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:11:15,130 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:11:15,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:15,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:11:15,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:11:15,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:11:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 198 transitions. [2018-10-10 15:11:15,134 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 198 transitions. Word has length 194 [2018-10-10 15:11:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:15,134 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 198 transitions. [2018-10-10 15:11:15,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:11:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 198 transitions. [2018-10-10 15:11:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2018-10-10 15:11:15,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:15,135 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] [2018-10-10 15:11:15,136 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:15,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:15,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1736502824, now seen corresponding path program 22 times [2018-10-10 15:11:15,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:15,625 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:11:15,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:15,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:11:15,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:11:15,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:11:15,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:11:15,627 INFO L87 Difference]: Start difference. First operand 198 states and 198 transitions. Second operand 26 states. [2018-10-10 15:11:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:16,262 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-10 15:11:16,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:11:16,262 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 197 [2018-10-10 15:11:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:16,263 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:11:16,263 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:11:16,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:11:16,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:11:16,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:11:16,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:11:16,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-10 15:11:16,268 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 197 [2018-10-10 15:11:16,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:16,268 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-10 15:11:16,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:11:16,268 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-10 15:11:16,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-10 15:11:16,270 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:16,270 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] [2018-10-10 15:11:16,270 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:16,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:16,271 INFO L82 PathProgramCache]: Analyzing trace with hash 1069581766, now seen corresponding path program 23 times [2018-10-10 15:11:16,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:16,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:16,995 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:11:16,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:16,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:11:16,996 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:11:16,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:11:16,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:11:16,997 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 27 states. [2018-10-10 15:11:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:17,859 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-10 15:11:17,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:11:17,861 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 200 [2018-10-10 15:11:17,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:17,862 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:11:17,862 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:11:17,863 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:11:17,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:11:17,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:11:17,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:11:17,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 204 transitions. [2018-10-10 15:11:17,867 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 204 transitions. Word has length 200 [2018-10-10 15:11:17,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:17,867 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 204 transitions. [2018-10-10 15:11:17,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:11:17,867 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 204 transitions. [2018-10-10 15:11:17,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2018-10-10 15:11:17,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:17,869 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] [2018-10-10 15:11:17,869 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:17,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:17,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1343054184, now seen corresponding path program 24 times [2018-10-10 15:11:17,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:17,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:18,951 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:11:18,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:18,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:11:18,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:11:18,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:11:18,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:11:18,953 INFO L87 Difference]: Start difference. First operand 204 states and 204 transitions. Second operand 28 states. [2018-10-10 15:11:19,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:19,849 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-10 15:11:19,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:11:19,850 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 203 [2018-10-10 15:11:19,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:19,851 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:11:19,851 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:11:19,852 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:11:19,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:11:19,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:11:19,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:11:19,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-10 15:11:19,856 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 203 [2018-10-10 15:11:19,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:19,857 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-10 15:11:19,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:11:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-10 15:11:19,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-10 15:11:19,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:19,858 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] [2018-10-10 15:11:19,858 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:19,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:19,859 INFO L82 PathProgramCache]: Analyzing trace with hash 806898310, now seen corresponding path program 25 times [2018-10-10 15:11:19,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:20,892 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:11:20,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:20,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:11:20,893 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:11:20,894 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:11:20,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:11:20,894 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 29 states. [2018-10-10 15:11:21,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:21,571 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-10 15:11:21,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:11:21,577 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 206 [2018-10-10 15:11:21,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:21,578 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:11:21,578 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:11:21,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:11:21,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:11:21,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:11:21,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:11:21,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 210 transitions. [2018-10-10 15:11:21,583 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 210 transitions. Word has length 206 [2018-10-10 15:11:21,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:21,584 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 210 transitions. [2018-10-10 15:11:21,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:11:21,584 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 210 transitions. [2018-10-10 15:11:21,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2018-10-10 15:11:21,585 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:21,585 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] [2018-10-10 15:11:21,585 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:21,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:21,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1170629800, now seen corresponding path program 26 times [2018-10-10 15:11:21,586 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:21,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:22,206 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:11:22,206 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:22,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:11:22,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:11:22,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:11:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:11:22,208 INFO L87 Difference]: Start difference. First operand 210 states and 210 transitions. Second operand 30 states. [2018-10-10 15:11:22,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:22,937 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-10 15:11:22,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:11:22,938 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 209 [2018-10-10 15:11:22,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:22,939 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:11:22,939 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:11:22,940 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:11:22,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:11:22,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:11:22,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:11:22,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-10 15:11:22,943 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 209 [2018-10-10 15:11:22,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:22,943 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-10 15:11:22,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:11:22,943 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-10 15:11:22,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-10 15:11:22,944 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:22,945 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] [2018-10-10 15:11:22,945 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:22,945 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:22,945 INFO L82 PathProgramCache]: Analyzing trace with hash 892960582, now seen corresponding path program 27 times [2018-10-10 15:11:22,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:22,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:23,565 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:11:23,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:23,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:11:23,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:11:23,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:11:23,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:11:23,567 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 31 states. [2018-10-10 15:11:24,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:24,626 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-10 15:11:24,626 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:11:24,626 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 212 [2018-10-10 15:11:24,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:24,627 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:11:24,627 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:11:24,628 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:11:24,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:11:24,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:11:24,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:11:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-10 15:11:24,632 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 212 [2018-10-10 15:11:24,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:24,632 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-10 15:11:24,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:11:24,632 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-10 15:11:24,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-10 15:11:24,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:24,634 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] [2018-10-10 15:11:24,634 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:24,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:24,634 INFO L82 PathProgramCache]: Analyzing trace with hash 956299240, now seen corresponding path program 28 times [2018-10-10 15:11:24,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:24,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:25,827 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:11:25,827 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:25,827 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:11:25,828 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:11:25,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:11:25,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:11:25,829 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 32 states. [2018-10-10 15:11:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:26,689 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-10 15:11:26,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:11:26,689 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 215 [2018-10-10 15:11:26,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:26,690 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:11:26,690 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:11:26,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:11:26,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:11:26,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:11:26,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:11:26,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-10 15:11:26,697 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 215 [2018-10-10 15:11:26,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:26,697 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-10 15:11:26,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:11:26,697 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-10 15:11:26,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-10 15:11:26,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:26,699 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] [2018-10-10 15:11:26,699 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:26,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:26,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1907350522, now seen corresponding path program 29 times [2018-10-10 15:11:26,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:27,435 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:11:27,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:27,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:11:27,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:11:27,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:11:27,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:11:27,436 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 33 states. [2018-10-10 15:11:28,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:28,350 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-10 15:11:28,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:11:28,351 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 218 [2018-10-10 15:11:28,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:28,352 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:11:28,352 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:11:28,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:11:28,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:11:28,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:11:28,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:11:28,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-10 15:11:28,358 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 218 [2018-10-10 15:11:28,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:28,359 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-10 15:11:28,359 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:11:28,359 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-10 15:11:28,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-10 15:11:28,360 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:28,360 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] [2018-10-10 15:11:28,361 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:28,361 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:28,361 INFO L82 PathProgramCache]: Analyzing trace with hash -1962009816, now seen corresponding path program 30 times [2018-10-10 15:11:28,362 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:29,149 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:11:29,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:29,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:11:29,150 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:11:29,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:11:29,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:11:29,151 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 34 states. [2018-10-10 15:11:30,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:30,270 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-10 15:11:30,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:11:30,271 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 221 [2018-10-10 15:11:30,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:30,272 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:11:30,272 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:11:30,274 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:11:30,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:11:30,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:11:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:11:30,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-10 15:11:30,277 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 221 [2018-10-10 15:11:30,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:30,278 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-10 15:11:30,278 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:11:30,278 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-10 15:11:30,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-10 15:11:30,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:30,280 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] [2018-10-10 15:11:30,280 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:30,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:30,280 INFO L82 PathProgramCache]: Analyzing trace with hash 1770535110, now seen corresponding path program 31 times [2018-10-10 15:11:30,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:30,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:30,961 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:11:30,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:30,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:11:30,962 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:11:30,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:11:30,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:11:30,963 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 35 states. [2018-10-10 15:11:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:32,019 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-10 15:11:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:11:32,019 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 224 [2018-10-10 15:11:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:32,020 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:11:32,020 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:11:32,022 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:11:32,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:11:32,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:11:32,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:11:32,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 228 transitions. [2018-10-10 15:11:32,025 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 228 transitions. Word has length 224 [2018-10-10 15:11:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:32,026 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 228 transitions. [2018-10-10 15:11:32,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:11:32,026 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 228 transitions. [2018-10-10 15:11:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2018-10-10 15:11:32,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:32,027 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] [2018-10-10 15:11:32,027 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:32,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1313132136, now seen corresponding path program 32 times [2018-10-10 15:11:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:32,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:32,965 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:11:32,965 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:32,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:11:32,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:11:32,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:11:32,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:11:32,967 INFO L87 Difference]: Start difference. First operand 228 states and 228 transitions. Second operand 36 states. [2018-10-10 15:11:34,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:34,013 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-10 15:11:34,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:11:34,013 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 227 [2018-10-10 15:11:34,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:34,015 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:11:34,015 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:11:34,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:11:34,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:11:34,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:11:34,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:11:34,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-10 15:11:34,020 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 227 [2018-10-10 15:11:34,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:34,020 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-10 15:11:34,020 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:11:34,020 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-10 15:11:34,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-10 15:11:34,021 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:34,021 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] [2018-10-10 15:11:34,022 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:34,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:34,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1542603386, now seen corresponding path program 33 times [2018-10-10 15:11:34,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:34,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:35,073 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:11:35,073 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:35,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:11:35,073 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:11:35,074 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:11:35,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:11:35,074 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 37 states. [2018-10-10 15:11:36,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:36,365 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-10 15:11:36,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:11:36,365 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 230 [2018-10-10 15:11:36,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:36,366 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:11:36,366 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:11:36,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:11:36,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:11:36,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:11:36,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:11:36,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 234 transitions. [2018-10-10 15:11:36,370 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 234 transitions. Word has length 230 [2018-10-10 15:11:36,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:36,370 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 234 transitions. [2018-10-10 15:11:36,370 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:11:36,370 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 234 transitions. [2018-10-10 15:11:36,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2018-10-10 15:11:36,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:36,371 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] [2018-10-10 15:11:36,371 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:36,372 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:36,372 INFO L82 PathProgramCache]: Analyzing trace with hash -2047340120, now seen corresponding path program 34 times [2018-10-10 15:11:36,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:36,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:37,209 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:11:37,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:11:37,210 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:11:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:11:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:11:37,210 INFO L87 Difference]: Start difference. First operand 234 states and 234 transitions. Second operand 38 states. [2018-10-10 15:11:38,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:38,211 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-10 15:11:38,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:11:38,212 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 233 [2018-10-10 15:11:38,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:38,213 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:11:38,213 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:11:38,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:11:38,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:11:38,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:11:38,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:11:38,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-10 15:11:38,216 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 233 [2018-10-10 15:11:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:38,216 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-10 15:11:38,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:11:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-10 15:11:38,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-10 15:11:38,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:38,218 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] [2018-10-10 15:11:38,218 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:38,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:38,219 INFO L82 PathProgramCache]: Analyzing trace with hash -1978879418, now seen corresponding path program 35 times [2018-10-10 15:11:38,219 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:38,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:39,140 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:11:39,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:39,140 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:11:39,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:11:39,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:11:39,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:11:39,141 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 39 states. [2018-10-10 15:11:40,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:40,922 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-10 15:11:40,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:11:40,923 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 236 [2018-10-10 15:11:40,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:40,924 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:11:40,924 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:11:40,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:11:40,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:11:40,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:11:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:11:40,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 240 transitions. [2018-10-10 15:11:40,929 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 240 transitions. Word has length 236 [2018-10-10 15:11:40,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:40,929 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 240 transitions. [2018-10-10 15:11:40,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:11:40,929 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 240 transitions. [2018-10-10 15:11:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 240 [2018-10-10 15:11:40,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:40,931 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] [2018-10-10 15:11:40,931 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:40,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:40,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1719395560, now seen corresponding path program 36 times [2018-10-10 15:11:40,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:40,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:41,785 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:11:41,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:41,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:11:41,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:11:41,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:11:41,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:11:41,787 INFO L87 Difference]: Start difference. First operand 240 states and 240 transitions. Second operand 40 states. [2018-10-10 15:11:42,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:42,911 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-10 15:11:42,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:11:42,912 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 239 [2018-10-10 15:11:42,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:42,913 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:11:42,913 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:11:42,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:11:42,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:11:42,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:11:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:11:42,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-10 15:11:42,917 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 239 [2018-10-10 15:11:42,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:42,917 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-10 15:11:42,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:11:42,917 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-10 15:11:42,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-10 15:11:42,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:42,919 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] [2018-10-10 15:11:42,919 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:42,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:42,919 INFO L82 PathProgramCache]: Analyzing trace with hash -1766779130, now seen corresponding path program 37 times [2018-10-10 15:11:42,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:43,857 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:11:43,857 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:43,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:11:43,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:11:43,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:11:43,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:11:43,859 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 41 states. [2018-10-10 15:11:45,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:45,211 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-10 15:11:45,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:11:45,212 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 242 [2018-10-10 15:11:45,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:45,213 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:11:45,213 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:11:45,213 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:11:45,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:11:45,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:11:45,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:11:45,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-10 15:11:45,217 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 242 [2018-10-10 15:11:45,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:45,217 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-10 15:11:45,217 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:11:45,217 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-10 15:11:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-10 15:11:45,219 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:45,219 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] [2018-10-10 15:11:45,219 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:45,219 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:45,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1792784344, now seen corresponding path program 38 times [2018-10-10 15:11:45,220 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:45,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:46,367 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:11:46,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:46,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:11:46,368 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:11:46,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:11:46,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:11:46,369 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 42 states. [2018-10-10 15:11:47,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:47,618 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-10 15:11:47,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:11:47,618 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 245 [2018-10-10 15:11:47,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:47,619 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:11:47,619 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:11:47,620 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:11:47,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:11:47,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:11:47,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:11:47,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-10 15:11:47,623 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 245 [2018-10-10 15:11:47,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:47,624 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-10 15:11:47,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:11:47,624 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-10 15:11:47,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-10 15:11:47,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:47,625 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] [2018-10-10 15:11:47,626 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:47,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:47,626 INFO L82 PathProgramCache]: Analyzing trace with hash 874965958, now seen corresponding path program 39 times [2018-10-10 15:11:47,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:47,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:48,857 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:11:48,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:48,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:11:48,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:11:48,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:11:48,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:11:48,859 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 43 states. [2018-10-10 15:11:50,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:50,430 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-10 15:11:50,431 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:11:50,431 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 248 [2018-10-10 15:11:50,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:50,432 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:11:50,432 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:11:50,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:11:50,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:11:50,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:11:50,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:11:50,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 252 transitions. [2018-10-10 15:11:50,444 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 252 transitions. Word has length 248 [2018-10-10 15:11:50,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:50,444 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 252 transitions. [2018-10-10 15:11:50,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:11:50,444 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 252 transitions. [2018-10-10 15:11:50,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2018-10-10 15:11:50,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:50,446 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] [2018-10-10 15:11:50,447 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:50,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:50,447 INFO L82 PathProgramCache]: Analyzing trace with hash 1749367656, now seen corresponding path program 40 times [2018-10-10 15:11:50,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:51,655 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:11:51,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:51,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:11:51,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:11:51,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:11:51,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:11:51,656 INFO L87 Difference]: Start difference. First operand 252 states and 252 transitions. Second operand 44 states. [2018-10-10 15:11:52,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:52,902 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-10 15:11:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:11:52,902 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 251 [2018-10-10 15:11:52,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:52,903 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:11:52,904 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:11:52,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:11:52,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:11:52,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:11:52,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:11:52,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-10 15:11:52,907 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 251 [2018-10-10 15:11:52,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:52,907 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-10 15:11:52,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:11:52,908 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-10 15:11:52,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-10 15:11:52,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:52,909 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] [2018-10-10 15:11:52,909 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:52,909 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:52,909 INFO L82 PathProgramCache]: Analyzing trace with hash 2073702534, now seen corresponding path program 41 times [2018-10-10 15:11:52,910 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:54,659 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:11:54,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:54,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:11:54,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:11:54,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:11:54,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:11:54,661 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 45 states. [2018-10-10 15:11:56,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:56,421 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-10 15:11:56,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:11:56,421 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 254 [2018-10-10 15:11:56,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:56,422 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:11:56,422 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:11:56,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:11:56,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:11:56,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-10 15:11:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-10 15:11:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 258 transitions. [2018-10-10 15:11:56,426 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 258 transitions. Word has length 254 [2018-10-10 15:11:56,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:56,426 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 258 transitions. [2018-10-10 15:11:56,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:11:56,426 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 258 transitions. [2018-10-10 15:11:56,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2018-10-10 15:11:56,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:56,427 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] [2018-10-10 15:11:56,428 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:56,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:56,428 INFO L82 PathProgramCache]: Analyzing trace with hash 657637032, now seen corresponding path program 42 times [2018-10-10 15:11:56,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:56,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:11:57,692 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:11:57,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:11:57,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:11:57,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:11:57,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:11:57,693 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:11:57,693 INFO L87 Difference]: Start difference. First operand 258 states and 258 transitions. Second operand 46 states. [2018-10-10 15:11:59,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:11:59,056 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-10 15:11:59,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:11:59,056 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 257 [2018-10-10 15:11:59,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:11:59,057 INFO L225 Difference]: With dead ends: 263 [2018-10-10 15:11:59,057 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 15:11:59,058 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:11:59,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 15:11:59,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-10 15:11:59,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-10 15:11:59,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-10 15:11:59,063 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 257 [2018-10-10 15:11:59,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:11:59,063 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-10 15:11:59,063 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:11:59,063 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-10 15:11:59,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-10 15:11:59,064 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:11:59,065 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] [2018-10-10 15:11:59,065 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:11:59,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:11:59,065 INFO L82 PathProgramCache]: Analyzing trace with hash -180951738, now seen corresponding path program 43 times [2018-10-10 15:11:59,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:11:59,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:00,382 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:12:00,382 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:00,382 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:12:00,383 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:12:00,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:12:00,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:12:00,383 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 47 states. [2018-10-10 15:12:01,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:01,835 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-10 15:12:01,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:12:01,835 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 260 [2018-10-10 15:12:01,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:01,836 INFO L225 Difference]: With dead ends: 266 [2018-10-10 15:12:01,836 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:12:01,837 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:12:01,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:12:01,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-10 15:12:01,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 15:12:01,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-10 15:12:01,841 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 260 [2018-10-10 15:12:01,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:01,841 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-10 15:12:01,841 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:12:01,841 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-10 15:12:01,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-10 15:12:01,842 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:01,843 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] [2018-10-10 15:12:01,843 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:01,843 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:01,843 INFO L82 PathProgramCache]: Analyzing trace with hash 1245762024, now seen corresponding path program 44 times [2018-10-10 15:12:01,844 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:03,084 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:12:03,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:03,085 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:12:03,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:12:03,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:12:03,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:03,086 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 48 states. [2018-10-10 15:12:04,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:04,680 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-10 15:12:04,680 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:12:04,681 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 263 [2018-10-10 15:12:04,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:04,682 INFO L225 Difference]: With dead ends: 269 [2018-10-10 15:12:04,682 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 15:12:04,683 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:12:04,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 15:12:04,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-10 15:12:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 15:12:04,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-10 15:12:04,686 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 263 [2018-10-10 15:12:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:04,686 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-10 15:12:04,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:12:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-10 15:12:04,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-10 15:12:04,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:04,688 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] [2018-10-10 15:12:04,688 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:04,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:04,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1479084550, now seen corresponding path program 45 times [2018-10-10 15:12:04,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:04,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:06,058 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:12:06,058 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:06,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:12:06,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:12:06,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:12:06,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:12:06,059 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 49 states. [2018-10-10 15:12:07,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:07,586 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-10 15:12:07,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:12:07,586 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 266 [2018-10-10 15:12:07,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:07,587 INFO L225 Difference]: With dead ends: 272 [2018-10-10 15:12:07,587 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 15:12:07,588 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:12:07,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 15:12:07,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-10 15:12:07,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:12:07,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 270 transitions. [2018-10-10 15:12:07,592 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 270 transitions. Word has length 266 [2018-10-10 15:12:07,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:07,592 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 270 transitions. [2018-10-10 15:12:07,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:12:07,592 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 270 transitions. [2018-10-10 15:12:07,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2018-10-10 15:12:07,594 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:07,594 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] [2018-10-10 15:12:07,594 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:07,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:07,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1161595608, now seen corresponding path program 46 times [2018-10-10 15:12:07,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:07,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:08,770 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:12:08,770 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:08,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:12:08,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:12:08,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:12:08,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:08,771 INFO L87 Difference]: Start difference. First operand 270 states and 270 transitions. Second operand 50 states. [2018-10-10 15:12:10,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:10,700 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-10 15:12:10,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:12:10,701 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 269 [2018-10-10 15:12:10,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:10,702 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:12:10,702 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:12:10,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:12:10,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:12:10,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-10 15:12:10,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 15:12:10,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-10 15:12:10,705 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 269 [2018-10-10 15:12:10,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:10,706 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-10 15:12:10,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:12:10,706 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-10 15:12:10,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-10 15:12:10,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:10,707 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] [2018-10-10 15:12:10,707 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:10,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:10,707 INFO L82 PathProgramCache]: Analyzing trace with hash 1251778246, now seen corresponding path program 47 times [2018-10-10 15:12:10,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:10,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:11,878 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:12:11,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:11,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:12:11,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:12:11,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:12:11,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:12:11,880 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 51 states. [2018-10-10 15:12:13,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:13,725 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-10 15:12:13,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:12:13,725 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 272 [2018-10-10 15:12:13,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:13,726 INFO L225 Difference]: With dead ends: 278 [2018-10-10 15:12:13,726 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 15:12:13,727 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:12:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 15:12:13,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-10 15:12:13,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:12:13,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 276 transitions. [2018-10-10 15:12:13,730 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 276 transitions. Word has length 272 [2018-10-10 15:12:13,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:13,731 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 276 transitions. [2018-10-10 15:12:13,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:12:13,731 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 276 transitions. [2018-10-10 15:12:13,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2018-10-10 15:12:13,732 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:13,733 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] [2018-10-10 15:12:13,733 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:13,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:13,733 INFO L82 PathProgramCache]: Analyzing trace with hash 319727720, now seen corresponding path program 48 times [2018-10-10 15:12:13,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:13,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:15,207 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:12:15,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:15,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:12:15,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:12:15,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:12:15,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:15,209 INFO L87 Difference]: Start difference. First operand 276 states and 276 transitions. Second operand 52 states. [2018-10-10 15:12:17,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:17,114 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-10 15:12:17,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:12:17,115 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 275 [2018-10-10 15:12:17,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:17,116 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:12:17,116 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:12:17,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:12:17,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:12:17,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-10 15:12:17,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 15:12:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-10 15:12:17,120 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 275 [2018-10-10 15:12:17,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:17,121 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-10 15:12:17,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:12:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-10 15:12:17,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-10 15:12:17,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:17,122 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] [2018-10-10 15:12:17,122 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:17,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:17,123 INFO L82 PathProgramCache]: Analyzing trace with hash 566076294, now seen corresponding path program 49 times [2018-10-10 15:12:17,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:17,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:18,539 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:12:18,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:18,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:12:18,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:12:18,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:12:18,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:12:18,540 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 53 states. [2018-10-10 15:12:20,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:20,423 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-10 15:12:20,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:12:20,423 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 278 [2018-10-10 15:12:20,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:20,424 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:12:20,424 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:12:20,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:12:20,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:12:20,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-10 15:12:20,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:12:20,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 282 transitions. [2018-10-10 15:12:20,435 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 282 transitions. Word has length 278 [2018-10-10 15:12:20,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:20,436 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 282 transitions. [2018-10-10 15:12:20,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:12:20,436 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 282 transitions. [2018-10-10 15:12:20,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2018-10-10 15:12:20,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:20,437 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] [2018-10-10 15:12:20,437 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:20,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:20,438 INFO L82 PathProgramCache]: Analyzing trace with hash -562664536, now seen corresponding path program 50 times [2018-10-10 15:12:20,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:20,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:21,953 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:12:21,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:21,954 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:12:21,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:12:21,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:12:21,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:12:21,955 INFO L87 Difference]: Start difference. First operand 282 states and 282 transitions. Second operand 54 states. [2018-10-10 15:12:23,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:23,902 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-10 15:12:23,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:12:23,902 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 281 [2018-10-10 15:12:23,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:23,903 INFO L225 Difference]: With dead ends: 287 [2018-10-10 15:12:23,904 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 15:12:23,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:12:23,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 15:12:23,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-10 15:12:23,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 15:12:23,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-10 15:12:23,908 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 281 [2018-10-10 15:12:23,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:23,908 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-10 15:12:23,908 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:12:23,908 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-10 15:12:23,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-10 15:12:23,910 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:23,910 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] [2018-10-10 15:12:23,910 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:23,910 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:23,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1581770682, now seen corresponding path program 51 times [2018-10-10 15:12:23,911 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:23,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:25,559 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:12:25,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:25,559 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:12:25,559 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:12:25,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:12:25,560 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:12:25,560 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 55 states. [2018-10-10 15:12:27,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:27,673 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-10 15:12:27,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:12:27,674 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 284 [2018-10-10 15:12:27,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:27,675 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:12:27,675 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:12:27,676 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:12:27,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:12:27,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-10 15:12:27,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:12:27,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 288 transitions. [2018-10-10 15:12:27,679 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 288 transitions. Word has length 284 [2018-10-10 15:12:27,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:27,679 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 288 transitions. [2018-10-10 15:12:27,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:12:27,679 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 288 transitions. [2018-10-10 15:12:27,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2018-10-10 15:12:27,681 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:27,681 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] [2018-10-10 15:12:27,681 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:27,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:27,682 INFO L82 PathProgramCache]: Analyzing trace with hash -649150744, now seen corresponding path program 52 times [2018-10-10 15:12:27,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:29,064 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:12:29,064 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:29,064 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:12:29,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:12:29,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:12:29,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:12:29,065 INFO L87 Difference]: Start difference. First operand 288 states and 288 transitions. Second operand 56 states. [2018-10-10 15:12:31,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:31,391 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-10 15:12:31,391 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:12:31,392 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 287 [2018-10-10 15:12:31,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:31,393 INFO L225 Difference]: With dead ends: 293 [2018-10-10 15:12:31,393 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 15:12:31,395 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:12:31,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 15:12:31,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-10 15:12:31,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 15:12:31,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-10 15:12:31,399 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 287 [2018-10-10 15:12:31,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:31,399 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-10 15:12:31,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:12:31,400 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-10 15:12:31,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-10 15:12:31,401 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:31,406 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] [2018-10-10 15:12:31,406 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:31,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:31,406 INFO L82 PathProgramCache]: Analyzing trace with hash -1112015610, now seen corresponding path program 53 times [2018-10-10 15:12:31,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:32,805 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:12:32,805 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:32,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:12:32,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:12:32,806 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:12:32,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:12:32,806 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 57 states. [2018-10-10 15:12:34,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:34,927 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-10 15:12:34,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:12:34,928 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 290 [2018-10-10 15:12:34,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:34,929 INFO L225 Difference]: With dead ends: 296 [2018-10-10 15:12:34,929 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 15:12:34,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:12:34,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 15:12:34,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-10 15:12:34,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 15:12:34,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 294 transitions. [2018-10-10 15:12:34,933 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 294 transitions. Word has length 290 [2018-10-10 15:12:34,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:34,933 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 294 transitions. [2018-10-10 15:12:34,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:12:34,933 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 294 transitions. [2018-10-10 15:12:34,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2018-10-10 15:12:34,935 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:34,935 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] [2018-10-10 15:12:34,935 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:34,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:34,936 INFO L82 PathProgramCache]: Analyzing trace with hash 820748840, now seen corresponding path program 54 times [2018-10-10 15:12:34,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:34,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:36,707 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:12:36,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:12:36,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:12:36,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:12:36,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:12:36,708 INFO L87 Difference]: Start difference. First operand 294 states and 294 transitions. Second operand 58 states. [2018-10-10 15:12:38,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:38,895 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-10 15:12:38,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:12:38,895 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 293 [2018-10-10 15:12:38,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:38,896 INFO L225 Difference]: With dead ends: 299 [2018-10-10 15:12:38,897 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 15:12:38,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:12:38,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 15:12:38,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-10 15:12:38,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:12:38,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-10 15:12:38,900 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 293 [2018-10-10 15:12:38,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:38,900 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-10 15:12:38,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:12:38,900 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-10 15:12:38,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-10 15:12:38,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:38,902 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] [2018-10-10 15:12:38,902 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:38,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:38,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1474908614, now seen corresponding path program 55 times [2018-10-10 15:12:38,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:38,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:40,436 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:12:40,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:40,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:12:40,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:12:40,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:12:40,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:12:40,438 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 59 states. [2018-10-10 15:12:42,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:42,918 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-10 15:12:42,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:12:42,918 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 296 [2018-10-10 15:12:42,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:42,919 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:12:42,919 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:12:42,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:12:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:12:42,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-10 15:12:42,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 15:12:42,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 300 transitions. [2018-10-10 15:12:42,922 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 300 transitions. Word has length 296 [2018-10-10 15:12:42,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:42,922 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 300 transitions. [2018-10-10 15:12:42,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:12:42,923 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 300 transitions. [2018-10-10 15:12:42,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2018-10-10 15:12:42,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:42,924 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] [2018-10-10 15:12:42,924 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:42,924 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:42,924 INFO L82 PathProgramCache]: Analyzing trace with hash -1012853400, now seen corresponding path program 56 times [2018-10-10 15:12:42,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:44,473 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:12:44,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:44,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:12:44,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:12:44,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:12:44,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:12:44,475 INFO L87 Difference]: Start difference. First operand 300 states and 300 transitions. Second operand 60 states. [2018-10-10 15:12:47,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:47,207 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-10 15:12:47,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:12:47,208 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 299 [2018-10-10 15:12:47,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:47,209 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:12:47,209 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:12:47,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:12:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:12:47,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-10 15:12:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 15:12:47,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-10 15:12:47,213 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 299 [2018-10-10 15:12:47,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:47,213 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-10 15:12:47,213 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:12:47,213 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-10 15:12:47,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-10 15:12:47,214 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:47,214 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] [2018-10-10 15:12:47,214 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:47,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:47,215 INFO L82 PathProgramCache]: Analyzing trace with hash 24647302, now seen corresponding path program 57 times [2018-10-10 15:12:47,215 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:47,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:49,081 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:12:49,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:49,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:12:49,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:12:49,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:12:49,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:12:49,082 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 61 states. [2018-10-10 15:12:51,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:51,767 INFO L93 Difference]: Finished difference Result 308 states and 308 transitions. [2018-10-10 15:12:51,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:12:51,768 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 302 [2018-10-10 15:12:51,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:51,769 INFO L225 Difference]: With dead ends: 308 [2018-10-10 15:12:51,769 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 15:12:51,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:12:51,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 15:12:51,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-10 15:12:51,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 15:12:51,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-10 15:12:51,772 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 302 [2018-10-10 15:12:51,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:51,773 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-10 15:12:51,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:12:51,773 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-10 15:12:51,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-10 15:12:51,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:51,774 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] [2018-10-10 15:12:51,774 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:51,775 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:51,775 INFO L82 PathProgramCache]: Analyzing trace with hash 1623398568, now seen corresponding path program 58 times [2018-10-10 15:12:51,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:51,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:53,506 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:12:53,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:53,507 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:12:53,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:12:53,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:12:53,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:12:53,508 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 62 states. [2018-10-10 15:12:56,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:56,220 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-10 15:12:56,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:12:56,221 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 305 [2018-10-10 15:12:56,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:56,222 INFO L225 Difference]: With dead ends: 311 [2018-10-10 15:12:56,222 INFO L226 Difference]: Without dead ends: 311 [2018-10-10 15:12:56,223 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:12:56,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-10 15:12:56,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-10 15:12:56,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 15:12:56,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 309 transitions. [2018-10-10 15:12:56,226 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 309 transitions. Word has length 305 [2018-10-10 15:12:56,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:56,226 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 309 transitions. [2018-10-10 15:12:56,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:12:56,226 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 309 transitions. [2018-10-10 15:12:56,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 309 [2018-10-10 15:12:56,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:56,228 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] [2018-10-10 15:12:56,228 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:56,228 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:56,228 INFO L82 PathProgramCache]: Analyzing trace with hash -1164948666, now seen corresponding path program 59 times [2018-10-10 15:12:56,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:56,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:58,184 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:12:58,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:58,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:12:58,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:12:58,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:12:58,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:12:58,186 INFO L87 Difference]: Start difference. First operand 309 states and 309 transitions. Second operand 63 states. [2018-10-10 15:13:00,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:00,613 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-10 15:13:00,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:13:00,613 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 308 [2018-10-10 15:13:00,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:00,614 INFO L225 Difference]: With dead ends: 314 [2018-10-10 15:13:00,614 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 15:13:00,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:13:00,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 15:13:00,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-10 15:13:00,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-10 15:13:00,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 312 transitions. [2018-10-10 15:13:00,618 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 312 transitions. Word has length 308 [2018-10-10 15:13:00,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:00,619 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 312 transitions. [2018-10-10 15:13:00,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:13:00,619 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 312 transitions. [2018-10-10 15:13:00,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2018-10-10 15:13:00,620 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:00,620 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] [2018-10-10 15:13:00,620 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:00,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:00,621 INFO L82 PathProgramCache]: Analyzing trace with hash 145075176, now seen corresponding path program 60 times [2018-10-10 15:13:00,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:02,696 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:13:02,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:02,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:13:02,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:13:02,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:13:02,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:13:02,698 INFO L87 Difference]: Start difference. First operand 312 states and 312 transitions. Second operand 64 states. [2018-10-10 15:13:05,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:05,300 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-10 15:13:05,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:13:05,301 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 311 [2018-10-10 15:13:05,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:05,302 INFO L225 Difference]: With dead ends: 317 [2018-10-10 15:13:05,302 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 15:13:05,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:13:05,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 15:13:05,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-10 15:13:05,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:13:05,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 315 transitions. [2018-10-10 15:13:05,306 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 315 transitions. Word has length 311 [2018-10-10 15:13:05,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:05,306 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 315 transitions. [2018-10-10 15:13:05,306 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:13:05,306 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 315 transitions. [2018-10-10 15:13:05,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-10 15:13:05,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:05,307 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] [2018-10-10 15:13:05,308 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:05,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:05,308 INFO L82 PathProgramCache]: Analyzing trace with hash -1302466554, now seen corresponding path program 61 times [2018-10-10 15:13:05,309 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:05,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:07,202 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:13:07,203 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:07,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:13:07,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:13:07,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:13:07,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:13:07,204 INFO L87 Difference]: Start difference. First operand 315 states and 315 transitions. Second operand 65 states. [2018-10-10 15:13:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:09,939 INFO L93 Difference]: Finished difference Result 320 states and 320 transitions. [2018-10-10 15:13:09,939 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:13:09,939 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 314 [2018-10-10 15:13:09,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:09,940 INFO L225 Difference]: With dead ends: 320 [2018-10-10 15:13:09,940 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 15:13:09,941 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:13:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 15:13:09,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-10 15:13:09,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:13:09,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 318 transitions. [2018-10-10 15:13:09,944 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 318 transitions. Word has length 314 [2018-10-10 15:13:09,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:09,944 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 318 transitions. [2018-10-10 15:13:09,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:13:09,945 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 318 transitions. [2018-10-10 15:13:09,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 318 [2018-10-10 15:13:09,946 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:09,946 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] [2018-10-10 15:13:09,946 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:09,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:09,946 INFO L82 PathProgramCache]: Analyzing trace with hash 748474152, now seen corresponding path program 62 times [2018-10-10 15:13:09,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:11,832 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:13:11,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:11,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:13:11,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:13:11,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:13:11,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:13:11,834 INFO L87 Difference]: Start difference. First operand 318 states and 318 transitions. Second operand 66 states. [2018-10-10 15:13:14,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:14,654 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-10 15:13:14,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:13:14,654 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 317 [2018-10-10 15:13:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:14,655 INFO L225 Difference]: With dead ends: 323 [2018-10-10 15:13:14,655 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 15:13:14,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:13:14,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 15:13:14,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-10 15:13:14,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 15:13:14,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 321 transitions. [2018-10-10 15:13:14,659 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 321 transitions. Word has length 317 [2018-10-10 15:13:14,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:14,659 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 321 transitions. [2018-10-10 15:13:14,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:13:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 321 transitions. [2018-10-10 15:13:14,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-10 15:13:14,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:14,660 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] [2018-10-10 15:13:14,661 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:14,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:14,661 INFO L82 PathProgramCache]: Analyzing trace with hash 118293702, now seen corresponding path program 63 times [2018-10-10 15:13:14,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:14,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:16,566 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:13:16,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:16,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:13:16,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:13:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:13:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:13:16,568 INFO L87 Difference]: Start difference. First operand 321 states and 321 transitions. Second operand 67 states. [2018-10-10 15:13:19,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:19,645 INFO L93 Difference]: Finished difference Result 326 states and 326 transitions. [2018-10-10 15:13:19,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:13:19,646 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 320 [2018-10-10 15:13:19,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:19,647 INFO L225 Difference]: With dead ends: 326 [2018-10-10 15:13:19,647 INFO L226 Difference]: Without dead ends: 326 [2018-10-10 15:13:19,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:13:19,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-10 15:13:19,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-10 15:13:19,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 15:13:19,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 324 transitions. [2018-10-10 15:13:19,652 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 324 transitions. Word has length 320 [2018-10-10 15:13:19,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:19,652 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 324 transitions. [2018-10-10 15:13:19,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:13:19,652 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 324 transitions. [2018-10-10 15:13:19,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 324 [2018-10-10 15:13:19,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:19,654 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] [2018-10-10 15:13:19,654 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:19,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:19,654 INFO L82 PathProgramCache]: Analyzing trace with hash -285441432, now seen corresponding path program 64 times [2018-10-10 15:13:19,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:19,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:21,654 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:13:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:13:21,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:13:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:13:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:13:21,656 INFO L87 Difference]: Start difference. First operand 324 states and 324 transitions. Second operand 68 states. [2018-10-10 15:13:24,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:24,790 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-10 15:13:24,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:13:24,791 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 323 [2018-10-10 15:13:24,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:24,792 INFO L225 Difference]: With dead ends: 329 [2018-10-10 15:13:24,792 INFO L226 Difference]: Without dead ends: 329 [2018-10-10 15:13:24,793 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:13:24,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-10 15:13:24,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2018-10-10 15:13:24,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-10 15:13:24,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 327 transitions. [2018-10-10 15:13:24,796 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 327 transitions. Word has length 323 [2018-10-10 15:13:24,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:24,796 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 327 transitions. [2018-10-10 15:13:24,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:13:24,797 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 327 transitions. [2018-10-10 15:13:24,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-10 15:13:24,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:24,798 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] [2018-10-10 15:13:24,798 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:24,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:24,798 INFO L82 PathProgramCache]: Analyzing trace with hash -2050389626, now seen corresponding path program 65 times [2018-10-10 15:13:24,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:24,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:26,902 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:13:26,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:26,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:13:26,903 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:13:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:13:26,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:13:26,904 INFO L87 Difference]: Start difference. First operand 327 states and 327 transitions. Second operand 69 states. [2018-10-10 15:13:29,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:29,946 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-10 15:13:29,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:13:29,947 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 326 [2018-10-10 15:13:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:29,948 INFO L225 Difference]: With dead ends: 332 [2018-10-10 15:13:29,948 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 15:13:29,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:13:29,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 15:13:29,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-10 15:13:29,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-10 15:13:29,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-10 15:13:29,952 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 326 [2018-10-10 15:13:29,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:29,952 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-10 15:13:29,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:13:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-10 15:13:29,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-10 15:13:29,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:29,954 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] [2018-10-10 15:13:29,954 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:29,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:29,955 INFO L82 PathProgramCache]: Analyzing trace with hash 1662567848, now seen corresponding path program 66 times [2018-10-10 15:13:29,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:29,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:32,028 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:13:32,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:32,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:13:32,029 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:13:32,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:13:32,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:13:32,030 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 70 states. [2018-10-10 15:13:35,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:35,314 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-10 15:13:35,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:13:35,315 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 329 [2018-10-10 15:13:35,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:35,316 INFO L225 Difference]: With dead ends: 335 [2018-10-10 15:13:35,316 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 15:13:35,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:13:35,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 15:13:35,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2018-10-10 15:13:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 15:13:35,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-10 15:13:35,320 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 329 [2018-10-10 15:13:35,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:35,320 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-10 15:13:35,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:13:35,320 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-10 15:13:35,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-10 15:13:35,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:35,321 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] [2018-10-10 15:13:35,321 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:35,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:35,322 INFO L82 PathProgramCache]: Analyzing trace with hash 1790934598, now seen corresponding path program 67 times [2018-10-10 15:13:35,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:35,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:37,708 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:13:37,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:37,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:13:37,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:13:37,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:13:37,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:13:37,710 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 71 states. [2018-10-10 15:13:40,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:40,914 INFO L93 Difference]: Finished difference Result 338 states and 338 transitions. [2018-10-10 15:13:40,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:13:40,915 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 332 [2018-10-10 15:13:40,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:40,916 INFO L225 Difference]: With dead ends: 338 [2018-10-10 15:13:40,916 INFO L226 Difference]: Without dead ends: 338 [2018-10-10 15:13:40,917 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:13:40,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-10 15:13:40,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-10-10 15:13:40,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-10 15:13:40,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 336 transitions. [2018-10-10 15:13:40,920 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 336 transitions. Word has length 332 [2018-10-10 15:13:40,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:40,921 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 336 transitions. [2018-10-10 15:13:40,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:13:40,921 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 336 transitions. [2018-10-10 15:13:40,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2018-10-10 15:13:40,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:40,922 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] [2018-10-10 15:13:40,922 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:40,922 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:40,923 INFO L82 PathProgramCache]: Analyzing trace with hash -851076888, now seen corresponding path program 68 times [2018-10-10 15:13:40,923 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:40,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:43,660 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:13:43,660 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:43,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:13:43,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:13:43,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:13:43,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:13:43,661 INFO L87 Difference]: Start difference. First operand 336 states and 336 transitions. Second operand 72 states. [2018-10-10 15:13:46,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:46,977 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-10 15:13:46,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:13:46,977 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 335 [2018-10-10 15:13:46,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:46,979 INFO L225 Difference]: With dead ends: 341 [2018-10-10 15:13:46,979 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 15:13:46,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:13:46,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 15:13:46,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2018-10-10 15:13:46,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:13:46,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 339 transitions. [2018-10-10 15:13:46,982 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 339 transitions. Word has length 335 [2018-10-10 15:13:46,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:46,983 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 339 transitions. [2018-10-10 15:13:46,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:13:46,983 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 339 transitions. [2018-10-10 15:13:46,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 339 [2018-10-10 15:13:46,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:46,984 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] [2018-10-10 15:13:46,984 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:46,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:46,984 INFO L82 PathProgramCache]: Analyzing trace with hash 555410182, now seen corresponding path program 69 times [2018-10-10 15:13:46,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:47,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:49,621 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:13:49,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:49,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:13:49,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:13:49,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:13:49,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:13:49,622 INFO L87 Difference]: Start difference. First operand 339 states and 339 transitions. Second operand 73 states. [2018-10-10 15:13:53,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:53,215 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-10 15:13:53,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:13:53,215 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 338 [2018-10-10 15:13:53,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:53,217 INFO L225 Difference]: With dead ends: 344 [2018-10-10 15:13:53,217 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 15:13:53,218 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:13:53,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 15:13:53,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-10-10 15:13:53,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-10 15:13:53,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 342 transitions. [2018-10-10 15:13:53,221 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 342 transitions. Word has length 338 [2018-10-10 15:13:53,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:53,221 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 342 transitions. [2018-10-10 15:13:53,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:13:53,221 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 342 transitions. [2018-10-10 15:13:53,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 342 [2018-10-10 15:13:53,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:53,223 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] [2018-10-10 15:13:53,223 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:53,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:53,223 INFO L82 PathProgramCache]: Analyzing trace with hash -489227224, now seen corresponding path program 70 times [2018-10-10 15:13:53,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:53,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:55,528 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:13:55,528 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:55,528 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:13:55,529 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:13:55,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:13:55,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:13:55,530 INFO L87 Difference]: Start difference. First operand 342 states and 342 transitions. Second operand 74 states. [2018-10-10 15:13:59,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:59,222 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-10 15:13:59,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:13:59,222 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 341 [2018-10-10 15:13:59,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:59,223 INFO L225 Difference]: With dead ends: 347 [2018-10-10 15:13:59,224 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 15:13:59,225 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:13:59,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 15:13:59,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-10-10 15:13:59,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 15:13:59,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 345 transitions. [2018-10-10 15:13:59,227 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 345 transitions. Word has length 341 [2018-10-10 15:13:59,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:59,228 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 345 transitions. [2018-10-10 15:13:59,228 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:13:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 345 transitions. [2018-10-10 15:13:59,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 345 [2018-10-10 15:13:59,229 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:59,229 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] [2018-10-10 15:13:59,229 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:59,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:59,230 INFO L82 PathProgramCache]: Analyzing trace with hash 50837446, now seen corresponding path program 71 times [2018-10-10 15:13:59,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:01,884 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:14:01,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:01,884 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:14:01,884 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:14:01,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:14:01,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:14:01,885 INFO L87 Difference]: Start difference. First operand 345 states and 345 transitions. Second operand 75 states. [2018-10-10 15:14:05,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:05,787 INFO L93 Difference]: Finished difference Result 350 states and 350 transitions. [2018-10-10 15:14:05,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:14:05,788 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 344 [2018-10-10 15:14:05,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:05,789 INFO L225 Difference]: With dead ends: 350 [2018-10-10 15:14:05,789 INFO L226 Difference]: Without dead ends: 350 [2018-10-10 15:14:05,790 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:14:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-10 15:14:05,792 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-10 15:14:05,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 15:14:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-10 15:14:05,793 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 344 [2018-10-10 15:14:05,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:05,793 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-10 15:14:05,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:14:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-10 15:14:05,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-10 15:14:05,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:05,795 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] [2018-10-10 15:14:05,795 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:05,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:05,795 INFO L82 PathProgramCache]: Analyzing trace with hash 169930600, now seen corresponding path program 72 times [2018-10-10 15:14:05,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:05,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:08,678 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:14:08,679 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:08,679 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:14:08,679 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:14:08,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:14:08,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:14:08,680 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 76 states. [2018-10-10 15:14:12,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:12,304 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-10 15:14:12,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:14:12,305 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 347 [2018-10-10 15:14:12,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:12,306 INFO L225 Difference]: With dead ends: 353 [2018-10-10 15:14:12,306 INFO L226 Difference]: Without dead ends: 353 [2018-10-10 15:14:12,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:14:12,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-10 15:14:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2018-10-10 15:14:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-10 15:14:12,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 351 transitions. [2018-10-10 15:14:12,311 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 351 transitions. Word has length 347 [2018-10-10 15:14:12,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:12,311 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 351 transitions. [2018-10-10 15:14:12,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:14:12,311 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 351 transitions. [2018-10-10 15:14:12,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-10 15:14:12,312 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:12,312 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] [2018-10-10 15:14:12,313 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:12,313 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:12,313 INFO L82 PathProgramCache]: Analyzing trace with hash 431094918, now seen corresponding path program 73 times [2018-10-10 15:14:12,313 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:12,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:15,163 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:14:15,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:15,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:14:15,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:14:15,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:14:15,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:14:15,164 INFO L87 Difference]: Start difference. First operand 351 states and 351 transitions. Second operand 77 states. [2018-10-10 15:14:19,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:19,086 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-10 15:14:19,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:14:19,086 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 350 [2018-10-10 15:14:19,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:19,087 INFO L225 Difference]: With dead ends: 356 [2018-10-10 15:14:19,088 INFO L226 Difference]: Without dead ends: 356 [2018-10-10 15:14:19,088 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:14:19,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-10 15:14:19,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2018-10-10 15:14:19,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-10 15:14:19,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 354 transitions. [2018-10-10 15:14:19,091 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 354 transitions. Word has length 350 [2018-10-10 15:14:19,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:19,092 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 354 transitions. [2018-10-10 15:14:19,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:14:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 354 transitions. [2018-10-10 15:14:19,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2018-10-10 15:14:19,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:19,093 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] [2018-10-10 15:14:19,093 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:19,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:19,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1703447896, now seen corresponding path program 74 times [2018-10-10 15:14:19,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:19,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:21,654 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:14:21,655 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:21,655 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:14:21,655 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:14:21,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:14:21,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:14:21,656 INFO L87 Difference]: Start difference. First operand 354 states and 354 transitions. Second operand 78 states. [2018-10-10 15:14:25,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:25,484 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-10 15:14:25,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:14:25,485 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 353 [2018-10-10 15:14:25,485 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:25,486 INFO L225 Difference]: With dead ends: 359 [2018-10-10 15:14:25,486 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 15:14:25,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:14:25,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 15:14:25,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2018-10-10 15:14:25,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-10 15:14:25,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 357 transitions. [2018-10-10 15:14:25,490 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 357 transitions. Word has length 353 [2018-10-10 15:14:25,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:25,490 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 357 transitions. [2018-10-10 15:14:25,491 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:14:25,491 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 357 transitions. [2018-10-10 15:14:25,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2018-10-10 15:14:25,492 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:25,492 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] [2018-10-10 15:14:25,492 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:25,493 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:25,493 INFO L82 PathProgramCache]: Analyzing trace with hash -582635194, now seen corresponding path program 75 times [2018-10-10 15:14:25,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:25,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:28,130 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:14:28,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:28,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:14:28,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:14:28,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:14:28,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:14:28,132 INFO L87 Difference]: Start difference. First operand 357 states and 357 transitions. Second operand 79 states. [2018-10-10 15:14:32,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:32,184 INFO L93 Difference]: Finished difference Result 362 states and 362 transitions. [2018-10-10 15:14:32,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:14:32,185 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 356 [2018-10-10 15:14:32,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:32,186 INFO L225 Difference]: With dead ends: 362 [2018-10-10 15:14:32,186 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 15:14:32,187 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:14:32,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 15:14:32,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-10-10 15:14:32,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-10 15:14:32,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 360 transitions. [2018-10-10 15:14:32,189 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 360 transitions. Word has length 356 [2018-10-10 15:14:32,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:32,190 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 360 transitions. [2018-10-10 15:14:32,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:14:32,190 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 360 transitions. [2018-10-10 15:14:32,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2018-10-10 15:14:32,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:32,191 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] [2018-10-10 15:14:32,191 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:32,192 INFO L82 PathProgramCache]: Analyzing trace with hash 472810984, now seen corresponding path program 76 times [2018-10-10 15:14:32,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:32,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:35,145 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:14:35,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:35,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:14:35,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:14:35,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:14:35,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:14:35,146 INFO L87 Difference]: Start difference. First operand 360 states and 360 transitions. Second operand 80 states. [2018-10-10 15:14:39,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:39,389 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-10 15:14:39,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:14:39,389 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 359 [2018-10-10 15:14:39,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:39,391 INFO L225 Difference]: With dead ends: 365 [2018-10-10 15:14:39,391 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 15:14:39,392 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:14:39,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 15:14:39,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 363. [2018-10-10 15:14:39,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-10 15:14:39,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-10 15:14:39,395 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 359 [2018-10-10 15:14:39,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:39,395 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-10 15:14:39,395 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:14:39,395 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-10 15:14:39,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-10 15:14:39,396 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:39,397 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] [2018-10-10 15:14:39,397 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:39,397 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:39,397 INFO L82 PathProgramCache]: Analyzing trace with hash -185674234, now seen corresponding path program 77 times [2018-10-10 15:14:39,397 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:42,207 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:14:42,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:42,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:14:42,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:14:42,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:14:42,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:14:42,209 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 81 states. [2018-10-10 15:14:46,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:46,416 INFO L93 Difference]: Finished difference Result 368 states and 368 transitions. [2018-10-10 15:14:46,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:14:46,416 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 362 [2018-10-10 15:14:46,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:46,418 INFO L225 Difference]: With dead ends: 368 [2018-10-10 15:14:46,418 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 15:14:46,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:14:46,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 15:14:46,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2018-10-10 15:14:46,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-10 15:14:46,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 366 transitions. [2018-10-10 15:14:46,423 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 366 transitions. Word has length 362 [2018-10-10 15:14:46,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:46,423 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 366 transitions. [2018-10-10 15:14:46,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:14:46,423 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 366 transitions. [2018-10-10 15:14:46,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 366 [2018-10-10 15:14:46,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:46,425 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] [2018-10-10 15:14:46,425 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:46,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:46,425 INFO L82 PathProgramCache]: Analyzing trace with hash -2003162840, now seen corresponding path program 78 times [2018-10-10 15:14:46,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:46,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:49,583 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:14:49,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:49,584 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:14:49,584 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:14:49,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:14:49,585 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:14:49,585 INFO L87 Difference]: Start difference. First operand 366 states and 366 transitions. Second operand 82 states. [2018-10-10 15:14:53,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:53,467 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-10 15:14:53,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:14:53,468 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 365 [2018-10-10 15:14:53,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:53,469 INFO L225 Difference]: With dead ends: 371 [2018-10-10 15:14:53,469 INFO L226 Difference]: Without dead ends: 371 [2018-10-10 15:14:53,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:14:53,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-10 15:14:53,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-10-10 15:14:53,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-10 15:14:53,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 369 transitions. [2018-10-10 15:14:53,473 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 369 transitions. Word has length 365 [2018-10-10 15:14:53,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:53,473 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 369 transitions. [2018-10-10 15:14:53,473 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:14:53,473 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 369 transitions. [2018-10-10 15:14:53,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 369 [2018-10-10 15:14:53,475 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:53,475 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] [2018-10-10 15:14:53,475 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:53,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:53,475 INFO L82 PathProgramCache]: Analyzing trace with hash -153523514, now seen corresponding path program 79 times [2018-10-10 15:14:53,476 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:53,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:56,643 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:14:56,643 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:56,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:14:56,644 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:14:56,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:14:56,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:14:56,645 INFO L87 Difference]: Start difference. First operand 369 states and 369 transitions. Second operand 83 states. [2018-10-10 15:15:01,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:01,202 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-10 15:15:01,202 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:15:01,202 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 368 [2018-10-10 15:15:01,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:01,203 INFO L225 Difference]: With dead ends: 374 [2018-10-10 15:15:01,203 INFO L226 Difference]: Without dead ends: 374 [2018-10-10 15:15:01,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:15:01,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-10 15:15:01,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2018-10-10 15:15:01,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-10 15:15:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 372 transitions. [2018-10-10 15:15:01,208 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 372 transitions. Word has length 368 [2018-10-10 15:15:01,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:01,208 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 372 transitions. [2018-10-10 15:15:01,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:15:01,208 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 372 transitions. [2018-10-10 15:15:01,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-10 15:15:01,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:01,210 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] [2018-10-10 15:15:01,210 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:01,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:01,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1978770328, now seen corresponding path program 80 times [2018-10-10 15:15:01,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:04,189 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:15:04,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:04,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:15:04,190 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:15:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:15:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:15:04,191 INFO L87 Difference]: Start difference. First operand 372 states and 372 transitions. Second operand 84 states. [2018-10-10 15:15:08,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:08,689 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-10 15:15:08,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:15:08,689 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 371 [2018-10-10 15:15:08,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:08,690 INFO L225 Difference]: With dead ends: 377 [2018-10-10 15:15:08,690 INFO L226 Difference]: Without dead ends: 377 [2018-10-10 15:15:08,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:15:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-10 15:15:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2018-10-10 15:15:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 15:15:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-10 15:15:08,694 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 371 [2018-10-10 15:15:08,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:08,695 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-10 15:15:08,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:15:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-10 15:15:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-10 15:15:08,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:08,696 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] [2018-10-10 15:15:08,697 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:08,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:08,697 INFO L82 PathProgramCache]: Analyzing trace with hash 674328454, now seen corresponding path program 81 times [2018-10-10 15:15:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:08,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:11,922 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:15:11,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:11,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:15:11,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:15:11,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:15:11,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:15:11,924 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 85 states. [2018-10-10 15:15:16,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:16,441 INFO L93 Difference]: Finished difference Result 380 states and 380 transitions. [2018-10-10 15:15:16,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:15:16,441 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 374 [2018-10-10 15:15:16,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:16,443 INFO L225 Difference]: With dead ends: 380 [2018-10-10 15:15:16,443 INFO L226 Difference]: Without dead ends: 380 [2018-10-10 15:15:16,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:15:16,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-10 15:15:16,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2018-10-10 15:15:16,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-10 15:15:16,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 378 transitions. [2018-10-10 15:15:16,448 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 378 transitions. Word has length 374 [2018-10-10 15:15:16,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:16,448 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 378 transitions. [2018-10-10 15:15:16,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:15:16,448 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 378 transitions. [2018-10-10 15:15:16,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 378 [2018-10-10 15:15:16,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:16,449 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] [2018-10-10 15:15:16,450 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:16,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:16,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1143005272, now seen corresponding path program 82 times [2018-10-10 15:15:16,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:19,604 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:15:19,604 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:19,604 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:15:19,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:15:19,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:15:19,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:15:19,606 INFO L87 Difference]: Start difference. First operand 378 states and 378 transitions. Second operand 86 states. [2018-10-10 15:15:24,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:24,050 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-10 15:15:24,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:15:24,051 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 377 [2018-10-10 15:15:24,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:24,052 INFO L225 Difference]: With dead ends: 383 [2018-10-10 15:15:24,052 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 15:15:24,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-10 15:15:24,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 15:15:24,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2018-10-10 15:15:24,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-10 15:15:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 381 transitions. [2018-10-10 15:15:24,056 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 381 transitions. Word has length 377 [2018-10-10 15:15:24,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:24,056 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 381 transitions. [2018-10-10 15:15:24,056 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:15:24,057 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 381 transitions. [2018-10-10 15:15:24,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2018-10-10 15:15:24,058 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:24,058 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] [2018-10-10 15:15:24,058 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:24,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:24,059 INFO L82 PathProgramCache]: Analyzing trace with hash 1025696838, now seen corresponding path program 83 times [2018-10-10 15:15:24,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:24,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:27,522 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:15:27,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:27,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:15:27,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:15:27,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:15:27,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:15:27,524 INFO L87 Difference]: Start difference. First operand 381 states and 381 transitions. Second operand 87 states. [2018-10-10 15:15:32,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:32,157 INFO L93 Difference]: Finished difference Result 386 states and 386 transitions. [2018-10-10 15:15:32,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:15:32,158 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 380 [2018-10-10 15:15:32,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:32,159 INFO L225 Difference]: With dead ends: 386 [2018-10-10 15:15:32,159 INFO L226 Difference]: Without dead ends: 386 [2018-10-10 15:15:32,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:15:32,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-10 15:15:32,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-10 15:15:32,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-10 15:15:32,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 384 transitions. [2018-10-10 15:15:32,163 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 384 transitions. Word has length 380 [2018-10-10 15:15:32,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:32,163 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 384 transitions. [2018-10-10 15:15:32,163 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:15:32,164 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 384 transitions. [2018-10-10 15:15:32,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2018-10-10 15:15:32,165 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:32,165 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] [2018-10-10 15:15:32,165 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:32,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:32,166 INFO L82 PathProgramCache]: Analyzing trace with hash -362777880, now seen corresponding path program 84 times [2018-10-10 15:15:32,166 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:32,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:35,719 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:15:35,719 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:35,719 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:15:35,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:15:35,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:15:35,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:15:35,721 INFO L87 Difference]: Start difference. First operand 384 states and 384 transitions. Second operand 88 states. [2018-10-10 15:15:40,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:40,165 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-10 15:15:40,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:15:40,165 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 383 [2018-10-10 15:15:40,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:40,167 INFO L225 Difference]: With dead ends: 389 [2018-10-10 15:15:40,167 INFO L226 Difference]: Without dead ends: 389 [2018-10-10 15:15:40,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:15:40,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-10 15:15:40,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2018-10-10 15:15:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-10 15:15:40,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 387 transitions. [2018-10-10 15:15:40,172 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 387 transitions. Word has length 383 [2018-10-10 15:15:40,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:40,172 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 387 transitions. [2018-10-10 15:15:40,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:15:40,172 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 387 transitions. [2018-10-10 15:15:40,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 387 [2018-10-10 15:15:40,174 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:40,175 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] [2018-10-10 15:15:40,175 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:40,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:40,175 INFO L82 PathProgramCache]: Analyzing trace with hash 416925958, now seen corresponding path program 85 times [2018-10-10 15:15:40,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:43,726 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:15:43,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:43,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:15:43,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:15:43,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:15:43,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:15:43,728 INFO L87 Difference]: Start difference. First operand 387 states and 387 transitions. Second operand 89 states. [2018-10-10 15:15:48,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:48,537 INFO L93 Difference]: Finished difference Result 392 states and 392 transitions. [2018-10-10 15:15:48,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:15:48,537 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 386 [2018-10-10 15:15:48,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:48,538 INFO L225 Difference]: With dead ends: 392 [2018-10-10 15:15:48,539 INFO L226 Difference]: Without dead ends: 392 [2018-10-10 15:15:48,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:15:48,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-10 15:15:48,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2018-10-10 15:15:48,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-10 15:15:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-10 15:15:48,544 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 386 [2018-10-10 15:15:48,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:48,544 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-10 15:15:48,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:15:48,544 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-10 15:15:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-10 15:15:48,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:48,546 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] [2018-10-10 15:15:48,546 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:48,547 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:48,547 INFO L82 PathProgramCache]: Analyzing trace with hash 1390827048, now seen corresponding path program 86 times [2018-10-10 15:15:48,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:52,243 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:15:52,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:52,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:15:52,244 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:15:52,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:15:52,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:15:52,246 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 90 states. [2018-10-10 15:15:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:57,246 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-10 15:15:57,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:15:57,247 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 389 [2018-10-10 15:15:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:57,248 INFO L225 Difference]: With dead ends: 395 [2018-10-10 15:15:57,248 INFO L226 Difference]: Without dead ends: 395 [2018-10-10 15:15:57,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:15:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-10 15:15:57,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2018-10-10 15:15:57,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-10 15:15:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-10 15:15:57,252 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 389 [2018-10-10 15:15:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:57,252 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-10 15:15:57,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:15:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-10 15:15:57,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-10 15:15:57,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:57,254 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] [2018-10-10 15:15:57,254 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:57,255 INFO L82 PathProgramCache]: Analyzing trace with hash -1920852538, now seen corresponding path program 87 times [2018-10-10 15:15:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:57,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:00,805 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:16:00,806 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:00,806 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:16:00,806 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:16:00,807 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:16:00,807 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:16:00,807 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 91 states. [2018-10-10 15:16:05,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:05,876 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-10 15:16:05,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:16:05,876 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 392 [2018-10-10 15:16:05,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:05,877 INFO L225 Difference]: With dead ends: 398 [2018-10-10 15:16:05,877 INFO L226 Difference]: Without dead ends: 398 [2018-10-10 15:16:05,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:16:05,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-10 15:16:05,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2018-10-10 15:16:05,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-10 15:16:05,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 396 transitions. [2018-10-10 15:16:05,882 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 396 transitions. Word has length 392 [2018-10-10 15:16:05,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:05,882 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 396 transitions. [2018-10-10 15:16:05,882 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:16:05,882 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 396 transitions. [2018-10-10 15:16:05,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2018-10-10 15:16:05,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:05,884 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] [2018-10-10 15:16:05,885 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:05,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:05,885 INFO L82 PathProgramCache]: Analyzing trace with hash -473642648, now seen corresponding path program 88 times [2018-10-10 15:16:05,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:05,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:09,684 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:16:09,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:09,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:16:09,685 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:16:09,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:16:09,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:16:09,686 INFO L87 Difference]: Start difference. First operand 396 states and 396 transitions. Second operand 92 states. [2018-10-10 15:16:14,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:14,978 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-10 15:16:14,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:16:14,979 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 395 [2018-10-10 15:16:14,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:14,980 INFO L225 Difference]: With dead ends: 401 [2018-10-10 15:16:14,980 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 15:16:14,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:16:14,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 15:16:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2018-10-10 15:16:14,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-10 15:16:14,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 399 transitions. [2018-10-10 15:16:14,985 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 399 transitions. Word has length 395 [2018-10-10 15:16:14,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:14,985 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 399 transitions. [2018-10-10 15:16:14,986 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:16:14,986 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 399 transitions. [2018-10-10 15:16:14,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-10 15:16:14,987 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:14,987 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] [2018-10-10 15:16:14,987 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:14,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:14,987 INFO L82 PathProgramCache]: Analyzing trace with hash 474473094, now seen corresponding path program 89 times [2018-10-10 15:16:14,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:18,867 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:16:18,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:16:18,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:16:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:16:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:16:18,869 INFO L87 Difference]: Start difference. First operand 399 states and 399 transitions. Second operand 93 states. [2018-10-10 15:16:24,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:24,191 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-10 15:16:24,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:16:24,191 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 398 [2018-10-10 15:16:24,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:24,192 INFO L225 Difference]: With dead ends: 404 [2018-10-10 15:16:24,192 INFO L226 Difference]: Without dead ends: 404 [2018-10-10 15:16:24,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:16:24,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-10 15:16:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2018-10-10 15:16:24,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-10 15:16:24,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 402 transitions. [2018-10-10 15:16:24,197 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 402 transitions. Word has length 398 [2018-10-10 15:16:24,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:24,197 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 402 transitions. [2018-10-10 15:16:24,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:16:24,198 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 402 transitions. [2018-10-10 15:16:24,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 402 [2018-10-10 15:16:24,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:24,199 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] [2018-10-10 15:16:24,199 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:24,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:24,200 INFO L82 PathProgramCache]: Analyzing trace with hash 2085604520, now seen corresponding path program 90 times [2018-10-10 15:16:24,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:28,256 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:16:28,256 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:28,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:16:28,257 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:16:28,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:16:28,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:16:28,258 INFO L87 Difference]: Start difference. First operand 402 states and 402 transitions. Second operand 94 states. [2018-10-10 15:16:33,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:33,772 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-10 15:16:33,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:16:33,773 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 401 [2018-10-10 15:16:33,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:33,774 INFO L225 Difference]: With dead ends: 407 [2018-10-10 15:16:33,774 INFO L226 Difference]: Without dead ends: 407 [2018-10-10 15:16:33,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:16:33,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-10 15:16:33,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-10-10 15:16:33,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 15:16:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 405 transitions. [2018-10-10 15:16:33,780 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 405 transitions. Word has length 401 [2018-10-10 15:16:33,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:33,780 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 405 transitions. [2018-10-10 15:16:33,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:16:33,781 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 405 transitions. [2018-10-10 15:16:33,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-10 15:16:33,782 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:33,783 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] [2018-10-10 15:16:33,783 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:33,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:33,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1252583610, now seen corresponding path program 91 times [2018-10-10 15:16:33,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:33,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:37,862 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:16:37,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:37,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:16:37,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:16:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:16:37,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:16:37,864 INFO L87 Difference]: Start difference. First operand 405 states and 405 transitions. Second operand 95 states. [2018-10-10 15:16:43,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:43,354 INFO L93 Difference]: Finished difference Result 410 states and 410 transitions. [2018-10-10 15:16:43,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:16:43,354 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 404 [2018-10-10 15:16:43,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:43,356 INFO L225 Difference]: With dead ends: 410 [2018-10-10 15:16:43,356 INFO L226 Difference]: Without dead ends: 410 [2018-10-10 15:16:43,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:16:43,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-10 15:16:43,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-10-10 15:16:43,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-10 15:16:43,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 408 transitions. [2018-10-10 15:16:43,361 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 408 transitions. Word has length 404 [2018-10-10 15:16:43,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:43,361 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 408 transitions. [2018-10-10 15:16:43,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:16:43,361 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 408 transitions. [2018-10-10 15:16:43,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 408 [2018-10-10 15:16:43,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:43,363 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] [2018-10-10 15:16:43,363 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:43,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:43,364 INFO L82 PathProgramCache]: Analyzing trace with hash 752574440, now seen corresponding path program 92 times [2018-10-10 15:16:43,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:43,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:47,534 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:16:47,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:47,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:16:47,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:16:47,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:16:47,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:16:47,536 INFO L87 Difference]: Start difference. First operand 408 states and 408 transitions. Second operand 96 states. [2018-10-10 15:16:53,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:53,285 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-10 15:16:53,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:16:53,285 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 407 [2018-10-10 15:16:53,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:53,286 INFO L225 Difference]: With dead ends: 413 [2018-10-10 15:16:53,286 INFO L226 Difference]: Without dead ends: 413 [2018-10-10 15:16:53,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:16:53,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-10 15:16:53,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2018-10-10 15:16:53,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-10 15:16:53,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 411 transitions. [2018-10-10 15:16:53,291 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 411 transitions. Word has length 407 [2018-10-10 15:16:53,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:53,292 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 411 transitions. [2018-10-10 15:16:53,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:16:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 411 transitions. [2018-10-10 15:16:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-10 15:16:53,293 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:53,293 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] [2018-10-10 15:16:53,294 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:53,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 2010889222, now seen corresponding path program 93 times [2018-10-10 15:16:53,294 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:53,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:57,620 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:16:57,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:57,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:16:57,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:16:57,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:16:57,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:16:57,622 INFO L87 Difference]: Start difference. First operand 411 states and 411 transitions. Second operand 97 states. [2018-10-10 15:17:03,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:03,240 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-10-10 15:17:03,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:17:03,240 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 410 [2018-10-10 15:17:03,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:03,242 INFO L225 Difference]: With dead ends: 414 [2018-10-10 15:17:03,242 INFO L226 Difference]: Without dead ends: 414 [2018-10-10 15:17:03,244 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:17:03,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-10 15:17:03,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2018-10-10 15:17:03,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-10 15:17:03,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-10 15:17:03,247 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 410 [2018-10-10 15:17:03,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:03,248 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-10 15:17:03,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:17:03,248 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-10 15:17:03,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-10 15:17:03,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:03,250 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] [2018-10-10 15:17:03,250 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:03,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:03,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1992000296, now seen corresponding path program 94 times [2018-10-10 15:17:03,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:03,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:04,250 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:17:04,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:17:04,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-10-10 15:17:04,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:17:04,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:17:04,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:17:04,252 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 7 states. [2018-10-10 15:17:05,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:05,600 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-10 15:17:05,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:17:05,601 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 413 [2018-10-10 15:17:05,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:05,602 INFO L225 Difference]: With dead ends: 412 [2018-10-10 15:17:05,602 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:17:05,602 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:17:05,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:17:05,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:17:05,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:17:05,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:17:05,603 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 413 [2018-10-10 15:17:05,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:05,603 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:17:05,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:17:05,604 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:17:05,604 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:17:05,608 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_35.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:17:05 BoogieIcfgContainer [2018-10-10 15:17:05,608 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:17:05,609 INFO L168 Benchmark]: Toolchain (without parser) took 372425.45 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 70.3 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 343.8 MB). Peak memory consumption was 414.0 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:05,611 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 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:17:05,611 INFO L168 Benchmark]: Boogie Preprocessor took 93.44 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:17:05,611 INFO L168 Benchmark]: RCFGBuilder took 974.11 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:17:05,612 INFO L168 Benchmark]: TraceAbstraction took 371353.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 70.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 301.5 MB). Peak memory consumption was 371.7 MB. Max. memory is 7.1 GB. [2018-10-10 15:17:05,615 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.21 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 93.44 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 974.11 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 371353.73 ms. Allocated memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: 70.3 MB). Free memory was 1.4 GB in the beginning and 1.1 GB in the end (delta: 301.5 MB). Peak memory consumption was 371.7 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 204]: 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, 136 locations, 1 error locations. SAFE Result, 371.2s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 210.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 12150 SDtfs, 28334 SDslu, 376825 SDs, 0 SdLazy, 29208 SolverSat, 4610 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9136 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 8940 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138421 ImplicationChecksByTransitivity, 318.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=414occurred 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.3s SatisfiabilityAnalysisTime, 150.8s InterpolantComputationTime, 25840 NumberOfCodeBlocks, 25840 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 25745 ConstructedInterpolants, 0 QuantifiedInterpolants, 25024355 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_35.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-17-05-624.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_35.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-17-05-624.csv Received shutdown request...