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_25.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:38:03,806 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:38:03,808 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:38:03,820 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:38:03,820 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:38:03,821 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:38:03,822 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:38:03,824 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:38:03,826 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:38:03,827 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:38:03,828 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:38:03,828 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:38:03,829 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:38:03,830 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:38:03,831 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:38:03,832 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:38:03,833 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:38:03,835 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:38:03,837 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:38:03,839 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:38:03,840 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:38:03,841 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:38:03,844 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:38:03,844 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:38:03,845 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:38:03,846 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:38:03,847 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:38:03,848 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:38:03,849 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:38:03,850 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:38:03,850 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:38:03,851 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:38:03,851 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:38:03,851 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:38:03,852 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:38:03,853 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:38:03,854 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-12 20:38:03,864 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:38:03,864 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:38:03,865 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:38:03,865 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:38:03,866 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:38:03,866 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:38:03,866 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:38:03,867 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:38:03,867 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:38:03,867 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:38:03,867 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:38:03,867 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:38:03,868 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:38:03,869 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:38:03,869 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:38:03,925 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:38:03,938 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:38:03,942 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:38:03,944 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:38:03,944 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:38:03,945 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_25.bpl [2018-10-12 20:38:03,946 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_25.bpl' [2018-10-12 20:38:04,021 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:38:04,024 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:38:04,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:38:04,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:38:04,025 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:38:04,053 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,055 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,082 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,085 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,087 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/1) ... [2018-10-12 20:38:04,090 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:38:04,091 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:38:04,092 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:38:04,092 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:38:04,093 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (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-12 20:38:04,176 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:38:04,177 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:38:04,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:38:05,249 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:38:05,250 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:38:05 BoogieIcfgContainer [2018-10-12 20:38:05,250 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:38:05,251 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:38:05,252 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:38:05,255 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:38:05,256 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:38:04" (1/2) ... [2018-10-12 20:38:05,257 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6422c4c and model type 20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:38:05, skipping insertion in model container [2018-10-12 20:38:05,257 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:38:05" (2/2) ... [2018-10-12 20:38:05,259 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_25.bpl [2018-10-12 20:38:05,270 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:38:05,280 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:38:05,300 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:38:05,330 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:38:05,331 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:38:05,331 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:38:05,331 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:38:05,331 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:38:05,332 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:38:05,332 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:38:05,332 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:38:05,332 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:38:05,361 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2018-10-12 20:38:05,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-12 20:38:05,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:05,393 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] [2018-10-12 20:38:05,395 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:05,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:05,403 INFO L82 PathProgramCache]: Analyzing trace with hash 629509728, now seen corresponding path program 1 times [2018-10-12 20:38:05,471 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:05,844 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-12 20:38:05,848 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:38:05,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-12 20:38:05,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-12 20:38:05,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-12 20:38:05,874 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-12 20:38:05,877 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 4 states. [2018-10-12 20:38:05,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:05,983 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-12 20:38:05,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-12 20:38:05,985 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 115 [2018-10-12 20:38:05,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:06,000 INFO L225 Difference]: With dead ends: 121 [2018-10-12 20:38:06,000 INFO L226 Difference]: Without dead ends: 121 [2018-10-12 20:38:06,002 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-12 20:38:06,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-12 20:38:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2018-10-12 20:38:06,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-12 20:38:06,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-12 20:38:06,057 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 115 [2018-10-12 20:38:06,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:06,057 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-12 20:38:06,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-12 20:38:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-12 20:38:06,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-12 20:38:06,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:06,062 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] [2018-10-12 20:38:06,062 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:06,063 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:06,063 INFO L82 PathProgramCache]: Analyzing trace with hash 88629630, now seen corresponding path program 1 times [2018-10-12 20:38:06,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:06,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:06,253 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-12 20:38:06,254 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:06,254 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 20:38:06,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 20:38:06,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 20:38:06,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-12 20:38:06,258 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 5 states. [2018-10-12 20:38:06,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:06,420 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-12 20:38:06,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-12 20:38:06,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2018-10-12 20:38:06,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:06,424 INFO L225 Difference]: With dead ends: 124 [2018-10-12 20:38:06,424 INFO L226 Difference]: Without dead ends: 124 [2018-10-12 20:38:06,425 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:38:06,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-12 20:38:06,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 122. [2018-10-12 20:38:06,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-12 20:38:06,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-12 20:38:06,444 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 118 [2018-10-12 20:38:06,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:06,444 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-12 20:38:06,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 20:38:06,445 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-12 20:38:06,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-12 20:38:06,451 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:06,451 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] [2018-10-12 20:38:06,452 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:06,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:06,452 INFO L82 PathProgramCache]: Analyzing trace with hash 1446924704, now seen corresponding path program 2 times [2018-10-12 20:38:06,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:06,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:06,687 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-12 20:38:06,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:06,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-12 20:38:06,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-12 20:38:06,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-12 20:38:06,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-12 20:38:06,690 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 6 states. [2018-10-12 20:38:06,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:06,801 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-12 20:38:06,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 20:38:06,806 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 121 [2018-10-12 20:38:06,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:06,808 INFO L225 Difference]: With dead ends: 127 [2018-10-12 20:38:06,808 INFO L226 Difference]: Without dead ends: 127 [2018-10-12 20:38:06,809 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-12 20:38:06,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-12 20:38:06,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 125. [2018-10-12 20:38:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-12 20:38:06,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-12 20:38:06,819 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 121 [2018-10-12 20:38:06,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:06,820 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-12 20:38:06,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-12 20:38:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-12 20:38:06,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-12 20:38:06,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:06,822 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] [2018-10-12 20:38:06,823 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:06,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:06,823 INFO L82 PathProgramCache]: Analyzing trace with hash -766388674, now seen corresponding path program 3 times [2018-10-12 20:38:06,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:06,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:07,034 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-12 20:38:07,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:07,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 20:38:07,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 20:38:07,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 20:38:07,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 20:38:07,037 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 7 states. [2018-10-12 20:38:07,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:07,462 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-12 20:38:07,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-12 20:38:07,463 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 124 [2018-10-12 20:38:07,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:07,468 INFO L225 Difference]: With dead ends: 130 [2018-10-12 20:38:07,468 INFO L226 Difference]: Without dead ends: 130 [2018-10-12 20:38:07,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:38:07,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-12 20:38:07,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 128. [2018-10-12 20:38:07,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-12 20:38:07,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-12 20:38:07,488 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 124 [2018-10-12 20:38:07,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:07,489 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-12 20:38:07,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 20:38:07,489 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-12 20:38:07,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-12 20:38:07,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:07,496 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] [2018-10-12 20:38:07,496 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:07,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:07,497 INFO L82 PathProgramCache]: Analyzing trace with hash -1247304480, now seen corresponding path program 4 times [2018-10-12 20:38:07,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:07,792 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-12 20:38:07,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:07,792 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-12 20:38:07,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 20:38:07,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 20:38:07,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-12 20:38:07,794 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 8 states. [2018-10-12 20:38:08,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:08,267 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-12 20:38:08,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-12 20:38:08,273 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 127 [2018-10-12 20:38:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:08,274 INFO L225 Difference]: With dead ends: 133 [2018-10-12 20:38:08,275 INFO L226 Difference]: Without dead ends: 133 [2018-10-12 20:38:08,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:38:08,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-12 20:38:08,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2018-10-12 20:38:08,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-12 20:38:08,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-12 20:38:08,290 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 127 [2018-10-12 20:38:08,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:08,290 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-12 20:38:08,290 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 20:38:08,291 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-12 20:38:08,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-12 20:38:08,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:08,298 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] [2018-10-12 20:38:08,298 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:08,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:08,301 INFO L82 PathProgramCache]: Analyzing trace with hash -199181570, now seen corresponding path program 5 times [2018-10-12 20:38:08,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:08,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:08,548 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-12 20:38:08,549 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:08,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 20:38:08,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:38:08,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:38:08,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:38:08,550 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 9 states. [2018-10-12 20:38:08,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:08,725 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-12 20:38:08,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 20:38:08,725 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 130 [2018-10-12 20:38:08,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:08,727 INFO L225 Difference]: With dead ends: 136 [2018-10-12 20:38:08,727 INFO L226 Difference]: Without dead ends: 136 [2018-10-12 20:38:08,728 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-12 20:38:08,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-12 20:38:08,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 134. [2018-10-12 20:38:08,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-12 20:38:08,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-12 20:38:08,734 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 130 [2018-10-12 20:38:08,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:08,734 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-12 20:38:08,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:38:08,735 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-12 20:38:08,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-12 20:38:08,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:08,737 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] [2018-10-12 20:38:08,737 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:08,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:08,738 INFO L82 PathProgramCache]: Analyzing trace with hash 18188320, now seen corresponding path program 6 times [2018-10-12 20:38:08,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:08,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:08,950 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-12 20:38:08,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:08,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:38:08,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:38:08,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:38:08,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:38:08,952 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 10 states. [2018-10-12 20:38:09,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:09,166 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-12 20:38:09,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-12 20:38:09,166 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 133 [2018-10-12 20:38:09,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:09,168 INFO L225 Difference]: With dead ends: 139 [2018-10-12 20:38:09,168 INFO L226 Difference]: Without dead ends: 139 [2018-10-12 20:38:09,168 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-12 20:38:09,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-12 20:38:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 137. [2018-10-12 20:38:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-12 20:38:09,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-12 20:38:09,174 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 133 [2018-10-12 20:38:09,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:09,175 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-12 20:38:09,175 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:38:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-12 20:38:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-12 20:38:09,177 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:09,177 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] [2018-10-12 20:38:09,177 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:09,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:09,181 INFO L82 PathProgramCache]: Analyzing trace with hash -1126101058, now seen corresponding path program 7 times [2018-10-12 20:38:09,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:09,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:09,373 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-12 20:38:09,373 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:09,373 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 20:38:09,374 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 20:38:09,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 20:38:09,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-12 20:38:09,374 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 11 states. [2018-10-12 20:38:09,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:09,683 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-12 20:38:09,686 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-12 20:38:09,686 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 136 [2018-10-12 20:38:09,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:09,687 INFO L225 Difference]: With dead ends: 142 [2018-10-12 20:38:09,688 INFO L226 Difference]: Without dead ends: 142 [2018-10-12 20:38:09,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:38:09,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-12 20:38:09,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 140. [2018-10-12 20:38:09,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-12 20:38:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-12 20:38:09,696 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 136 [2018-10-12 20:38:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:09,696 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-12 20:38:09,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 20:38:09,697 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-12 20:38:09,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-12 20:38:09,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:09,702 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] [2018-10-12 20:38:09,702 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:09,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:09,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1495532704, now seen corresponding path program 8 times [2018-10-12 20:38:09,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:10,168 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-12 20:38:10,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:10,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:38:10,170 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:38:10,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:38:10,170 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:38:10,170 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 12 states. [2018-10-12 20:38:10,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:10,400 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-12 20:38:10,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:38:10,403 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 139 [2018-10-12 20:38:10,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:10,404 INFO L225 Difference]: With dead ends: 145 [2018-10-12 20:38:10,405 INFO L226 Difference]: Without dead ends: 145 [2018-10-12 20:38:10,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:38:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-12 20:38:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2018-10-12 20:38:10,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-12 20:38:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-12 20:38:10,410 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 139 [2018-10-12 20:38:10,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:10,410 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-12 20:38:10,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:38:10,411 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-12 20:38:10,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-12 20:38:10,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:10,413 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] [2018-10-12 20:38:10,413 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:10,413 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:10,413 INFO L82 PathProgramCache]: Analyzing trace with hash 767480958, now seen corresponding path program 9 times [2018-10-12 20:38:10,414 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:10,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:10,687 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-12 20:38:10,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:10,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 20:38:10,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 20:38:10,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 20:38:10,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-12 20:38:10,689 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 13 states. [2018-10-12 20:38:10,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:10,915 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-12 20:38:10,922 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 20:38:10,922 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 142 [2018-10-12 20:38:10,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:10,923 INFO L225 Difference]: With dead ends: 148 [2018-10-12 20:38:10,923 INFO L226 Difference]: Without dead ends: 148 [2018-10-12 20:38:10,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:38:10,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-12 20:38:10,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 146. [2018-10-12 20:38:10,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-12 20:38:10,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-12 20:38:10,927 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 142 [2018-10-12 20:38:10,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:10,928 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-12 20:38:10,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 20:38:10,928 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-12 20:38:10,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-12 20:38:10,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:10,929 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] [2018-10-12 20:38:10,930 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:10,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash 105840288, now seen corresponding path program 10 times [2018-10-12 20:38:10,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:10,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:11,245 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-12 20:38:11,245 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:11,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 20:38:11,246 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 20:38:11,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 20:38:11,246 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:38:11,246 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 14 states. [2018-10-12 20:38:11,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:11,528 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-12 20:38:11,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-12 20:38:11,528 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 145 [2018-10-12 20:38:11,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:11,529 INFO L225 Difference]: With dead ends: 151 [2018-10-12 20:38:11,530 INFO L226 Difference]: Without dead ends: 151 [2018-10-12 20:38:11,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:38:11,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-12 20:38:11,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 149. [2018-10-12 20:38:11,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-12 20:38:11,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-12 20:38:11,534 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 145 [2018-10-12 20:38:11,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:11,534 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-12 20:38:11,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 20:38:11,534 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-12 20:38:11,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-12 20:38:11,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:11,536 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] [2018-10-12 20:38:11,536 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:11,536 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:11,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1226438338, now seen corresponding path program 11 times [2018-10-12 20:38:11,537 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:11,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:11,852 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-12 20:38:11,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:11,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 20:38:11,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 20:38:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 20:38:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-12 20:38:11,854 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 15 states. [2018-10-12 20:38:12,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:12,625 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-12 20:38:12,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:38:12,632 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 148 [2018-10-12 20:38:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:12,633 INFO L225 Difference]: With dead ends: 154 [2018-10-12 20:38:12,633 INFO L226 Difference]: Without dead ends: 154 [2018-10-12 20:38:12,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:38:12,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-12 20:38:12,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 152. [2018-10-12 20:38:12,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-12 20:38:12,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-12 20:38:12,639 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 148 [2018-10-12 20:38:12,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:12,639 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-12 20:38:12,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 20:38:12,639 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-12 20:38:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-12 20:38:12,640 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:12,640 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] [2018-10-12 20:38:12,640 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:12,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:12,641 INFO L82 PathProgramCache]: Analyzing trace with hash -1346203168, now seen corresponding path program 12 times [2018-10-12 20:38:12,642 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:12,878 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-12 20:38:12,878 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:12,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:38:12,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:38:12,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:38:12,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:38:12,880 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 16 states. [2018-10-12 20:38:13,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:13,189 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-12 20:38:13,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 20:38:13,190 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 151 [2018-10-12 20:38:13,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:13,190 INFO L225 Difference]: With dead ends: 157 [2018-10-12 20:38:13,191 INFO L226 Difference]: Without dead ends: 157 [2018-10-12 20:38:13,191 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:38:13,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-12 20:38:13,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 155. [2018-10-12 20:38:13,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-12 20:38:13,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-12 20:38:13,195 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 151 [2018-10-12 20:38:13,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:13,195 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-12 20:38:13,196 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:38:13,196 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-12 20:38:13,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-12 20:38:13,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:13,197 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] [2018-10-12 20:38:13,197 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:13,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:13,197 INFO L82 PathProgramCache]: Analyzing trace with hash -142430722, now seen corresponding path program 13 times [2018-10-12 20:38:13,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:13,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:13,873 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-12 20:38:13,874 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:13,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-12 20:38:13,874 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-12 20:38:13,875 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-12 20:38:13,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-12 20:38:13,875 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 17 states. [2018-10-12 20:38:14,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:14,230 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-12 20:38:14,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 20:38:14,231 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 154 [2018-10-12 20:38:14,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:14,232 INFO L225 Difference]: With dead ends: 160 [2018-10-12 20:38:14,233 INFO L226 Difference]: Without dead ends: 160 [2018-10-12 20:38:14,233 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-12 20:38:14,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-12 20:38:14,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 158. [2018-10-12 20:38:14,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-12 20:38:14,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-12 20:38:14,238 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 154 [2018-10-12 20:38:14,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:14,238 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-12 20:38:14,238 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-12 20:38:14,238 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-12 20:38:14,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-12 20:38:14,239 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:14,239 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] [2018-10-12 20:38:14,240 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:14,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:14,241 INFO L82 PathProgramCache]: Analyzing trace with hash -1534413536, now seen corresponding path program 14 times [2018-10-12 20:38:14,242 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:15,525 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-12 20:38:15,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:15,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:38:15,526 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:38:15,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:38:15,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:38:15,527 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 18 states. [2018-10-12 20:38:15,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:15,973 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-12 20:38:15,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 20:38:15,974 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 157 [2018-10-12 20:38:15,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:15,974 INFO L225 Difference]: With dead ends: 163 [2018-10-12 20:38:15,975 INFO L226 Difference]: Without dead ends: 163 [2018-10-12 20:38:15,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:38:15,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-12 20:38:15,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 161. [2018-10-12 20:38:15,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-12 20:38:15,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-12 20:38:15,979 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 157 [2018-10-12 20:38:15,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:15,980 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-12 20:38:15,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:38:15,980 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-12 20:38:15,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-12 20:38:15,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:15,981 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] [2018-10-12 20:38:15,982 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:15,982 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:15,982 INFO L82 PathProgramCache]: Analyzing trace with hash 2109784766, now seen corresponding path program 15 times [2018-10-12 20:38:15,983 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:17,097 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-12 20:38:17,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:17,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 20:38:17,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 20:38:17,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 20:38:17,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-12 20:38:17,099 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 19 states. [2018-10-12 20:38:17,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:17,699 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-12 20:38:17,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 20:38:17,700 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 160 [2018-10-12 20:38:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:17,701 INFO L225 Difference]: With dead ends: 166 [2018-10-12 20:38:17,701 INFO L226 Difference]: Without dead ends: 166 [2018-10-12 20:38:17,702 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:38:17,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-12 20:38:17,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 164. [2018-10-12 20:38:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-12 20:38:17,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-12 20:38:17,705 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 160 [2018-10-12 20:38:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:17,706 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-12 20:38:17,706 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 20:38:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-12 20:38:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-12 20:38:17,707 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:17,707 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] [2018-10-12 20:38:17,707 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:17,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1761908640, now seen corresponding path program 16 times [2018-10-12 20:38:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:17,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:18,029 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-12 20:38:18,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:18,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:38:18,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:38:18,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:38:18,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:38:18,031 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 20 states. [2018-10-12 20:38:18,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:18,360 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-12 20:38:18,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-12 20:38:18,362 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 163 [2018-10-12 20:38:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:18,363 INFO L225 Difference]: With dead ends: 169 [2018-10-12 20:38:18,363 INFO L226 Difference]: Without dead ends: 169 [2018-10-12 20:38:18,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:38:18,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-12 20:38:18,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 167. [2018-10-12 20:38:18,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-12 20:38:18,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-12 20:38:18,366 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 163 [2018-10-12 20:38:18,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:18,367 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-12 20:38:18,367 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:38:18,367 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-12 20:38:18,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-12 20:38:18,368 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:18,368 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] [2018-10-12 20:38:18,368 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:18,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:18,369 INFO L82 PathProgramCache]: Analyzing trace with hash -2033432706, now seen corresponding path program 17 times [2018-10-12 20:38:18,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:18,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:18,914 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-12 20:38:18,914 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:18,914 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-12 20:38:18,914 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 20:38:18,915 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 20:38:18,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-12 20:38:18,915 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 21 states. [2018-10-12 20:38:19,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:19,351 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-12 20:38:19,352 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:38:19,352 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 166 [2018-10-12 20:38:19,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:19,353 INFO L225 Difference]: With dead ends: 172 [2018-10-12 20:38:19,353 INFO L226 Difference]: Without dead ends: 172 [2018-10-12 20:38:19,353 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:38:19,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-12 20:38:19,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 170. [2018-10-12 20:38:19,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-12 20:38:19,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-12 20:38:19,356 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 166 [2018-10-12 20:38:19,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:19,357 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-12 20:38:19,357 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 20:38:19,357 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-12 20:38:19,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-12 20:38:19,358 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:19,358 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] [2018-10-12 20:38:19,358 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:19,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:19,359 INFO L82 PathProgramCache]: Analyzing trace with hash 711502752, now seen corresponding path program 18 times [2018-10-12 20:38:19,360 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:19,674 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-12 20:38:19,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:19,674 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:38:19,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:38:19,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:38:19,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:38:19,676 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 22 states. [2018-10-12 20:38:20,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:20,226 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-12 20:38:20,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-12 20:38:20,226 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 169 [2018-10-12 20:38:20,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:20,227 INFO L225 Difference]: With dead ends: 175 [2018-10-12 20:38:20,227 INFO L226 Difference]: Without dead ends: 175 [2018-10-12 20:38:20,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:38:20,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-12 20:38:20,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 173. [2018-10-12 20:38:20,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-12 20:38:20,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-12 20:38:20,232 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 169 [2018-10-12 20:38:20,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:20,232 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-12 20:38:20,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:38:20,232 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-12 20:38:20,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-12 20:38:20,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:20,233 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] [2018-10-12 20:38:20,234 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:20,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:20,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1093583810, now seen corresponding path program 19 times [2018-10-12 20:38:20,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:20,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:21,423 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-12 20:38:21,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:21,424 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 20:38:21,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 20:38:21,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 20:38:21,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-12 20:38:21,425 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 23 states. [2018-10-12 20:38:21,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:21,994 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-12 20:38:21,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-12 20:38:21,995 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 172 [2018-10-12 20:38:21,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:21,996 INFO L225 Difference]: With dead ends: 178 [2018-10-12 20:38:21,997 INFO L226 Difference]: Without dead ends: 178 [2018-10-12 20:38:21,997 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-12 20:38:21,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-12 20:38:22,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2018-10-12 20:38:22,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-12 20:38:22,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-12 20:38:22,002 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 172 [2018-10-12 20:38:22,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:22,002 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-12 20:38:22,002 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 20:38:22,002 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-12 20:38:22,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-12 20:38:22,003 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:22,003 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] [2018-10-12 20:38:22,003 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:22,004 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:22,004 INFO L82 PathProgramCache]: Analyzing trace with hash 858160864, now seen corresponding path program 20 times [2018-10-12 20:38:22,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:22,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:23,109 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-12 20:38:23,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:23,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:38:23,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:38:23,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:38:23,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:38:23,111 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 24 states. [2018-10-12 20:38:23,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:23,630 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-12 20:38:23,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:38:23,630 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 175 [2018-10-12 20:38:23,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:23,631 INFO L225 Difference]: With dead ends: 181 [2018-10-12 20:38:23,631 INFO L226 Difference]: Without dead ends: 181 [2018-10-12 20:38:23,632 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:38:23,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-12 20:38:23,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2018-10-12 20:38:23,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-12 20:38:23,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-12 20:38:23,635 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 175 [2018-10-12 20:38:23,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:23,635 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-12 20:38:23,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:38:23,636 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-12 20:38:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-12 20:38:23,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:23,637 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] [2018-10-12 20:38:23,637 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:23,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 16490750, now seen corresponding path program 21 times [2018-10-12 20:38:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:23,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:24,319 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-12 20:38:24,319 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:24,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-12 20:38:24,320 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-12 20:38:24,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-12 20:38:24,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-12 20:38:24,320 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 25 states. [2018-10-12 20:38:24,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:24,842 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-12 20:38:24,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:38:24,843 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 178 [2018-10-12 20:38:24,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:24,844 INFO L225 Difference]: With dead ends: 184 [2018-10-12 20:38:24,844 INFO L226 Difference]: Without dead ends: 184 [2018-10-12 20:38:24,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:38:24,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-12 20:38:24,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 182. [2018-10-12 20:38:24,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-12 20:38:24,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-12 20:38:24,848 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 178 [2018-10-12 20:38:24,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:24,848 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-12 20:38:24,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-12 20:38:24,849 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-12 20:38:24,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-12 20:38:24,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:24,850 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] [2018-10-12 20:38:24,850 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:24,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:24,850 INFO L82 PathProgramCache]: Analyzing trace with hash -158801376, now seen corresponding path program 22 times [2018-10-12 20:38:24,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:25,771 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-12 20:38:25,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:25,772 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:38:25,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:38:25,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:38:25,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:38:25,773 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 26 states. [2018-10-12 20:38:26,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:26,326 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-12 20:38:26,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-12 20:38:26,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 181 [2018-10-12 20:38:26,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:26,327 INFO L225 Difference]: With dead ends: 187 [2018-10-12 20:38:26,327 INFO L226 Difference]: Without dead ends: 187 [2018-10-12 20:38:26,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:38:26,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-12 20:38:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 185. [2018-10-12 20:38:26,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-12 20:38:26,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-12 20:38:26,331 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 181 [2018-10-12 20:38:26,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:26,331 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-12 20:38:26,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:38:26,331 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-12 20:38:26,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-12 20:38:26,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:26,332 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] [2018-10-12 20:38:26,332 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:26,332 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:26,333 INFO L82 PathProgramCache]: Analyzing trace with hash 393704894, now seen corresponding path program 23 times [2018-10-12 20:38:26,333 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:26,790 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-12 20:38:26,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:26,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 20:38:26,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 20:38:26,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 20:38:26,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-12 20:38:26,792 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 27 states. [2018-10-12 20:38:28,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:28,186 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-12 20:38:28,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 20:38:28,186 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 184 [2018-10-12 20:38:28,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:28,187 INFO L225 Difference]: With dead ends: 190 [2018-10-12 20:38:28,187 INFO L226 Difference]: Without dead ends: 190 [2018-10-12 20:38:28,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:38:28,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-12 20:38:28,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 188. [2018-10-12 20:38:28,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-12 20:38:28,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-12 20:38:28,191 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 184 [2018-10-12 20:38:28,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:28,192 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-12 20:38:28,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 20:38:28,192 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-12 20:38:28,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-12 20:38:28,193 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:28,193 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] [2018-10-12 20:38:28,193 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:28,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:28,194 INFO L82 PathProgramCache]: Analyzing trace with hash 1793316192, now seen corresponding path program 24 times [2018-10-12 20:38:28,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:28,690 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-12 20:38:28,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:28,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:38:28,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:38:28,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:38:28,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:38:28,692 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 28 states. [2018-10-12 20:38:29,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:29,315 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-12 20:38:29,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-12 20:38:29,315 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 187 [2018-10-12 20:38:29,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:29,316 INFO L225 Difference]: With dead ends: 193 [2018-10-12 20:38:29,316 INFO L226 Difference]: Without dead ends: 193 [2018-10-12 20:38:29,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:38:29,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-12 20:38:29,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2018-10-12 20:38:29,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-12 20:38:29,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-12 20:38:29,320 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 187 [2018-10-12 20:38:29,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:29,320 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-12 20:38:29,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:38:29,321 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-12 20:38:29,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-12 20:38:29,322 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:29,322 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] [2018-10-12 20:38:29,322 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:29,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:29,322 INFO L82 PathProgramCache]: Analyzing trace with hash 2070985342, now seen corresponding path program 25 times [2018-10-12 20:38:29,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:29,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:30,292 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-12 20:38:30,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:30,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 20:38:30,293 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 20:38:30,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 20:38:30,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-12 20:38:30,294 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 29 states. [2018-10-12 20:38:30,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:30,984 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-12 20:38:30,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-12 20:38:30,991 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 190 [2018-10-12 20:38:30,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:30,992 INFO L225 Difference]: With dead ends: 196 [2018-10-12 20:38:30,992 INFO L226 Difference]: Without dead ends: 196 [2018-10-12 20:38:30,993 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-12 20:38:30,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-12 20:38:30,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2018-10-12 20:38:30,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-12 20:38:30,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-12 20:38:30,996 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 190 [2018-10-12 20:38:30,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:30,997 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-12 20:38:30,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 20:38:30,997 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-12 20:38:30,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-12 20:38:30,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:30,998 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] [2018-10-12 20:38:30,998 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:30,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:30,999 INFO L82 PathProgramCache]: Analyzing trace with hash 2005620896, now seen corresponding path program 26 times [2018-10-12 20:38:30,999 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:31,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:32,007 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-12 20:38:32,007 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:32,007 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:38:32,008 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:38:32,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:38:32,008 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:38:32,009 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 30 states. [2018-10-12 20:38:32,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:32,686 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-12 20:38:32,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 20:38:32,687 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 193 [2018-10-12 20:38:32,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:32,688 INFO L225 Difference]: With dead ends: 199 [2018-10-12 20:38:32,688 INFO L226 Difference]: Without dead ends: 199 [2018-10-12 20:38:32,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:38:32,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-12 20:38:32,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 197. [2018-10-12 20:38:32,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-12 20:38:32,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-12 20:38:32,692 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 193 [2018-10-12 20:38:32,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:32,692 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-12 20:38:32,693 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:38:32,693 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-12 20:38:32,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-12 20:38:32,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:32,694 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] [2018-10-12 20:38:32,694 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:32,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:32,694 INFO L82 PathProgramCache]: Analyzing trace with hash 353595198, now seen corresponding path program 27 times [2018-10-12 20:38:32,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:32,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:33,510 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-12 20:38:33,510 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:33,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 20:38:33,511 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 20:38:33,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 20:38:33,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-12 20:38:33,512 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 31 states. [2018-10-12 20:38:34,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:34,271 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-12 20:38:34,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 20:38:34,280 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 196 [2018-10-12 20:38:34,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:34,281 INFO L225 Difference]: With dead ends: 202 [2018-10-12 20:38:34,281 INFO L226 Difference]: Without dead ends: 202 [2018-10-12 20:38:34,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:38:34,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-12 20:38:34,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 200. [2018-10-12 20:38:34,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-12 20:38:34,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-12 20:38:34,286 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 196 [2018-10-12 20:38:34,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:34,286 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-12 20:38:34,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 20:38:34,286 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-12 20:38:34,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-12 20:38:34,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:34,287 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] [2018-10-12 20:38:34,288 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:34,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:34,288 INFO L82 PathProgramCache]: Analyzing trace with hash 886270944, now seen corresponding path program 28 times [2018-10-12 20:38:34,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:34,900 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-12 20:38:34,901 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:34,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:38:34,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:38:34,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:38:34,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:38:34,902 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 32 states. [2018-10-12 20:38:35,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:35,893 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-12 20:38:35,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-12 20:38:35,893 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 199 [2018-10-12 20:38:35,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:35,895 INFO L225 Difference]: With dead ends: 205 [2018-10-12 20:38:35,895 INFO L226 Difference]: Without dead ends: 205 [2018-10-12 20:38:35,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:38:35,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-12 20:38:35,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 203. [2018-10-12 20:38:35,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-12 20:38:35,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-12 20:38:35,901 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 199 [2018-10-12 20:38:35,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:35,901 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-12 20:38:35,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:38:35,901 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-12 20:38:35,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-12 20:38:35,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:35,903 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] [2018-10-12 20:38:35,903 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:35,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:35,903 INFO L82 PathProgramCache]: Analyzing trace with hash -74738690, now seen corresponding path program 29 times [2018-10-12 20:38:35,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:36,766 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-12 20:38:36,766 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:36,766 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 20:38:36,767 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 20:38:36,767 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 20:38:36,767 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 20:38:36,767 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 33 states. [2018-10-12 20:38:37,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:37,544 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-12 20:38:37,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 20:38:37,545 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 202 [2018-10-12 20:38:37,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:37,546 INFO L225 Difference]: With dead ends: 208 [2018-10-12 20:38:37,546 INFO L226 Difference]: Without dead ends: 208 [2018-10-12 20:38:37,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:38:37,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-12 20:38:37,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 206. [2018-10-12 20:38:37,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-12 20:38:37,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-12 20:38:37,550 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 202 [2018-10-12 20:38:37,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:37,550 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-12 20:38:37,550 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 20:38:37,550 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-12 20:38:37,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-12 20:38:37,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:37,551 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] [2018-10-12 20:38:37,551 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:37,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:37,552 INFO L82 PathProgramCache]: Analyzing trace with hash 739249952, now seen corresponding path program 30 times [2018-10-12 20:38:37,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:38,799 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-12 20:38:38,799 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:38,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:38:38,800 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:38:38,800 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:38:38,800 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:38:38,801 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 34 states. [2018-10-12 20:38:39,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:39,702 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-12 20:38:39,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 20:38:39,702 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 205 [2018-10-12 20:38:39,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:39,703 INFO L225 Difference]: With dead ends: 211 [2018-10-12 20:38:39,703 INFO L226 Difference]: Without dead ends: 211 [2018-10-12 20:38:39,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:38:39,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-10-12 20:38:39,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 209. [2018-10-12 20:38:39,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-12 20:38:39,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-12 20:38:39,707 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 205 [2018-10-12 20:38:39,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:39,708 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-12 20:38:39,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:38:39,708 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-12 20:38:39,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-12 20:38:39,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:39,709 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] [2018-10-12 20:38:39,709 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:39,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:39,709 INFO L82 PathProgramCache]: Analyzing trace with hash 889530558, now seen corresponding path program 31 times [2018-10-12 20:38:39,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:39,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:40,360 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-12 20:38:40,361 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:40,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 20:38:40,361 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 20:38:40,362 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 20:38:40,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 20:38:40,363 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 35 states. [2018-10-12 20:38:41,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:41,254 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-12 20:38:41,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 20:38:41,255 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 208 [2018-10-12 20:38:41,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:41,256 INFO L225 Difference]: With dead ends: 214 [2018-10-12 20:38:41,256 INFO L226 Difference]: Without dead ends: 214 [2018-10-12 20:38:41,258 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-12 20:38:41,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-12 20:38:41,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 212. [2018-10-12 20:38:41,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-12 20:38:41,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-12 20:38:41,261 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 208 [2018-10-12 20:38:41,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:41,261 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-12 20:38:41,261 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 20:38:41,262 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-12 20:38:41,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-12 20:38:41,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:41,263 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] [2018-10-12 20:38:41,263 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:41,263 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:41,263 INFO L82 PathProgramCache]: Analyzing trace with hash -1751825824, now seen corresponding path program 32 times [2018-10-12 20:38:41,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:41,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:42,593 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-12 20:38:42,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:42,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:38:42,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:38:42,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:38:42,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:38:42,595 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 36 states. [2018-10-12 20:38:43,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:43,791 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-10-12 20:38:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 20:38:43,791 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 211 [2018-10-12 20:38:43,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:43,792 INFO L225 Difference]: With dead ends: 217 [2018-10-12 20:38:43,792 INFO L226 Difference]: Without dead ends: 217 [2018-10-12 20:38:43,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:38:43,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-10-12 20:38:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 215. [2018-10-12 20:38:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-12 20:38:43,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-12 20:38:43,797 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 211 [2018-10-12 20:38:43,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:43,798 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-12 20:38:43,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:38:43,798 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-12 20:38:43,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-12 20:38:43,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:43,799 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] [2018-10-12 20:38:43,799 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:43,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:43,800 INFO L82 PathProgramCache]: Analyzing trace with hash 1990995326, now seen corresponding path program 33 times [2018-10-12 20:38:43,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:43,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:44,701 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-12 20:38:44,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:44,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 20:38:44,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 20:38:44,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 20:38:44,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 20:38:44,703 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 37 states. [2018-10-12 20:38:45,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:45,766 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-12 20:38:45,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 20:38:45,766 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 214 [2018-10-12 20:38:45,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:45,767 INFO L225 Difference]: With dead ends: 220 [2018-10-12 20:38:45,767 INFO L226 Difference]: Without dead ends: 220 [2018-10-12 20:38:45,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-12 20:38:45,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-12 20:38:45,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 218. [2018-10-12 20:38:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 20:38:45,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-12 20:38:45,771 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 214 [2018-10-12 20:38:45,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:45,772 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-12 20:38:45,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 20:38:45,772 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-12 20:38:45,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-12 20:38:45,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:45,773 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] [2018-10-12 20:38:45,773 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:45,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:45,774 INFO L82 PathProgramCache]: Analyzing trace with hash -1565063776, now seen corresponding path program 34 times [2018-10-12 20:38:45,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:46,613 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-12 20:38:46,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:46,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:38:46,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:38:46,614 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:38:46,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:38:46,615 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 38 states. [2018-10-12 20:38:47,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:47,595 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-10-12 20:38:47,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 20:38:47,595 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 217 [2018-10-12 20:38:47,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:47,596 INFO L225 Difference]: With dead ends: 223 [2018-10-12 20:38:47,596 INFO L226 Difference]: Without dead ends: 223 [2018-10-12 20:38:47,597 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-12 20:38:47,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-10-12 20:38:47,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2018-10-12 20:38:47,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-12 20:38:47,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-12 20:38:47,601 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 217 [2018-10-12 20:38:47,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:47,601 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-12 20:38:47,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:38:47,601 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-12 20:38:47,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-12 20:38:47,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:47,603 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] [2018-10-12 20:38:47,603 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:47,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:47,603 INFO L82 PathProgramCache]: Analyzing trace with hash -458448322, now seen corresponding path program 35 times [2018-10-12 20:38:47,604 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:47,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:48,644 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-12 20:38:48,644 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:48,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 20:38:48,645 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 20:38:48,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 20:38:48,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 20:38:48,645 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 39 states. [2018-10-12 20:38:49,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:49,842 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-12 20:38:49,843 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:38:49,843 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 220 [2018-10-12 20:38:49,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:49,844 INFO L225 Difference]: With dead ends: 226 [2018-10-12 20:38:49,844 INFO L226 Difference]: Without dead ends: 226 [2018-10-12 20:38:49,845 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 20:38:49,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-12 20:38:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 224. [2018-10-12 20:38:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-12 20:38:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-12 20:38:49,848 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 220 [2018-10-12 20:38:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:49,849 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-12 20:38:49,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 20:38:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-12 20:38:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-12 20:38:49,850 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:49,850 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] [2018-10-12 20:38:49,850 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:49,850 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:49,851 INFO L82 PathProgramCache]: Analyzing trace with hash -1446422304, now seen corresponding path program 36 times [2018-10-12 20:38:49,851 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:49,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:50,852 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-12 20:38:50,852 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:50,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:38:50,853 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:38:50,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:38:50,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:38:50,853 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 40 states. [2018-10-12 20:38:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:52,356 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-12 20:38:52,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-12 20:38:52,357 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 223 [2018-10-12 20:38:52,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:52,358 INFO L225 Difference]: With dead ends: 229 [2018-10-12 20:38:52,358 INFO L226 Difference]: Without dead ends: 229 [2018-10-12 20:38:52,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 20:38:52,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-12 20:38:52,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 227. [2018-10-12 20:38:52,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-12 20:38:52,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-12 20:38:52,361 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 223 [2018-10-12 20:38:52,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:52,361 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-12 20:38:52,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:38:52,361 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-12 20:38:52,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-12 20:38:52,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:52,363 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] [2018-10-12 20:38:52,363 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:52,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:52,363 INFO L82 PathProgramCache]: Analyzing trace with hash -768440578, now seen corresponding path program 37 times [2018-10-12 20:38:52,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:52,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:53,198 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-12 20:38:53,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:53,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-12 20:38:53,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-12 20:38:53,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-12 20:38:53,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 20:38:53,199 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 41 states. [2018-10-12 20:38:54,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:54,610 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-12 20:38:54,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-12 20:38:54,611 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 226 [2018-10-12 20:38:54,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:54,612 INFO L225 Difference]: With dead ends: 232 [2018-10-12 20:38:54,612 INFO L226 Difference]: Without dead ends: 232 [2018-10-12 20:38:54,613 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 20:38:54,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-12 20:38:54,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 230. [2018-10-12 20:38:54,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-12 20:38:54,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-12 20:38:54,616 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 226 [2018-10-12 20:38:54,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:54,616 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-12 20:38:54,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-12 20:38:54,616 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-12 20:38:54,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-12 20:38:54,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:54,618 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] [2018-10-12 20:38:54,618 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:54,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:54,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2048932896, now seen corresponding path program 38 times [2018-10-12 20:38:54,619 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:54,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:55,792 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-12 20:38:55,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:55,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:38:55,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:38:55,793 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:38:55,793 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:38:55,794 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 42 states. [2018-10-12 20:38:57,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:57,021 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-10-12 20:38:57,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 20:38:57,022 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 229 [2018-10-12 20:38:57,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:57,023 INFO L225 Difference]: With dead ends: 235 [2018-10-12 20:38:57,023 INFO L226 Difference]: Without dead ends: 235 [2018-10-12 20:38:57,023 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-12 20:38:57,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-10-12 20:38:57,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 233. [2018-10-12 20:38:57,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-12 20:38:57,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-12 20:38:57,027 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 229 [2018-10-12 20:38:57,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:57,027 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-12 20:38:57,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:38:57,028 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-12 20:38:57,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-12 20:38:57,029 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:57,029 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] [2018-10-12 20:38:57,029 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:57,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:57,030 INFO L82 PathProgramCache]: Analyzing trace with hash -2123768898, now seen corresponding path program 39 times [2018-10-12 20:38:57,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:57,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:38:58,235 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-12 20:38:58,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:38:58,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 20:38:58,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 20:38:58,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 20:38:58,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:38:58,236 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 43 states. [2018-10-12 20:38:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:38:59,748 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-12 20:38:59,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 20:38:59,748 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 232 [2018-10-12 20:38:59,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:38:59,749 INFO L225 Difference]: With dead ends: 238 [2018-10-12 20:38:59,749 INFO L226 Difference]: Without dead ends: 238 [2018-10-12 20:38:59,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 20:38:59,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-12 20:38:59,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 236. [2018-10-12 20:38:59,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-12 20:38:59,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-12 20:38:59,753 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 232 [2018-10-12 20:38:59,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:38:59,754 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-12 20:38:59,755 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 20:38:59,755 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-12 20:38:59,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-12 20:38:59,756 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:38:59,757 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] [2018-10-12 20:38:59,757 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:38:59,757 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:38:59,757 INFO L82 PathProgramCache]: Analyzing trace with hash -1844465824, now seen corresponding path program 40 times [2018-10-12 20:38:59,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:38:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:00,808 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-12 20:39:00,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:00,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:39:00,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:39:00,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:39:00,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:39:00,809 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 44 states. [2018-10-12 20:39:02,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:02,221 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-10-12 20:39:02,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-12 20:39:02,222 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 235 [2018-10-12 20:39:02,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:02,222 INFO L225 Difference]: With dead ends: 241 [2018-10-12 20:39:02,223 INFO L226 Difference]: Without dead ends: 241 [2018-10-12 20:39:02,223 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-12 20:39:02,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-10-12 20:39:02,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 239. [2018-10-12 20:39:02,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-12 20:39:02,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-12 20:39:02,225 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 235 [2018-10-12 20:39:02,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:02,226 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-12 20:39:02,226 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:39:02,226 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-12 20:39:02,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-12 20:39:02,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:02,227 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] [2018-10-12 20:39:02,227 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:02,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:02,227 INFO L82 PathProgramCache]: Analyzing trace with hash -478240642, now seen corresponding path program 41 times [2018-10-12 20:39:02,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:02,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:03,226 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-12 20:39:03,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:03,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-12 20:39:03,227 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-12 20:39:03,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-12 20:39:03,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 20:39:03,228 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 45 states. [2018-10-12 20:39:04,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:04,816 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-12 20:39:04,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:39:04,816 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 238 [2018-10-12 20:39:04,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:04,817 INFO L225 Difference]: With dead ends: 244 [2018-10-12 20:39:04,817 INFO L226 Difference]: Without dead ends: 244 [2018-10-12 20:39:04,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 20:39:04,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-12 20:39:04,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 242. [2018-10-12 20:39:04,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-12 20:39:04,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-12 20:39:04,821 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 238 [2018-10-12 20:39:04,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:04,822 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-12 20:39:04,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-12 20:39:04,822 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-12 20:39:04,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-12 20:39:04,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:04,823 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] [2018-10-12 20:39:04,823 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:04,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:04,824 INFO L82 PathProgramCache]: Analyzing trace with hash 1626059424, now seen corresponding path program 42 times [2018-10-12 20:39:04,824 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:04,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:05,837 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-12 20:39:05,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:05,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:39:05,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:39:05,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:39:05,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:39:05,839 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 46 states. [2018-10-12 20:39:07,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:07,353 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-12 20:39:07,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 20:39:07,353 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 241 [2018-10-12 20:39:07,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:07,354 INFO L225 Difference]: With dead ends: 247 [2018-10-12 20:39:07,354 INFO L226 Difference]: Without dead ends: 247 [2018-10-12 20:39:07,355 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 20:39:07,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-12 20:39:07,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 245. [2018-10-12 20:39:07,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-12 20:39:07,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-12 20:39:07,359 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 241 [2018-10-12 20:39:07,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:07,360 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-12 20:39:07,360 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:39:07,360 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-12 20:39:07,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-12 20:39:07,361 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:07,362 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] [2018-10-12 20:39:07,362 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:07,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:07,362 INFO L82 PathProgramCache]: Analyzing trace with hash 1486673214, now seen corresponding path program 43 times [2018-10-12 20:39:07,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:08,409 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-12 20:39:08,409 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:08,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 20:39:08,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 20:39:08,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 20:39:08,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 20:39:08,411 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 47 states. [2018-10-12 20:39:10,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:10,169 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-12 20:39:10,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-12 20:39:10,169 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 244 [2018-10-12 20:39:10,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:10,170 INFO L225 Difference]: With dead ends: 250 [2018-10-12 20:39:10,170 INFO L226 Difference]: Without dead ends: 250 [2018-10-12 20:39:10,171 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-12 20:39:10,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-12 20:39:10,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 248. [2018-10-12 20:39:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-12 20:39:10,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-12 20:39:10,174 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 244 [2018-10-12 20:39:10,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:10,174 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-12 20:39:10,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 20:39:10,174 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-12 20:39:10,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-12 20:39:10,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:10,175 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] [2018-10-12 20:39:10,175 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:10,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:10,175 INFO L82 PathProgramCache]: Analyzing trace with hash -2029500960, now seen corresponding path program 44 times [2018-10-12 20:39:10,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:11,266 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-12 20:39:11,266 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:11,266 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:39:11,266 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:39:11,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:39:11,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:39:11,267 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 48 states. [2018-10-12 20:39:12,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:12,880 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-10-12 20:39:12,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 20:39:12,880 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 247 [2018-10-12 20:39:12,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:12,881 INFO L225 Difference]: With dead ends: 253 [2018-10-12 20:39:12,881 INFO L226 Difference]: Without dead ends: 253 [2018-10-12 20:39:12,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 20:39:12,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-10-12 20:39:12,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 251. [2018-10-12 20:39:12,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-12 20:39:12,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-12 20:39:12,884 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 247 [2018-10-12 20:39:12,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:12,884 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-12 20:39:12,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:39:12,884 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-12 20:39:12,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-12 20:39:12,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:12,885 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] [2018-10-12 20:39:12,886 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:12,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:12,886 INFO L82 PathProgramCache]: Analyzing trace with hash 1878030846, now seen corresponding path program 45 times [2018-10-12 20:39:12,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:14,207 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-12 20:39:14,207 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:14,207 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 20:39:14,207 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 20:39:14,208 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 20:39:14,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 20:39:14,208 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 49 states. [2018-10-12 20:39:15,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:15,828 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-12 20:39:15,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-12 20:39:15,836 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 250 [2018-10-12 20:39:15,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:15,837 INFO L225 Difference]: With dead ends: 256 [2018-10-12 20:39:15,837 INFO L226 Difference]: Without dead ends: 256 [2018-10-12 20:39:15,838 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-12 20:39:15,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-12 20:39:15,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 254. [2018-10-12 20:39:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-12 20:39:15,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-12 20:39:15,842 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 250 [2018-10-12 20:39:15,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:15,842 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-12 20:39:15,842 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 20:39:15,842 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-12 20:39:15,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-12 20:39:15,843 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:15,843 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] [2018-10-12 20:39:15,844 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:15,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:15,844 INFO L82 PathProgramCache]: Analyzing trace with hash 364472608, now seen corresponding path program 46 times [2018-10-12 20:39:15,845 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:15,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:17,092 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-12 20:39:17,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:17,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:39:17,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:39:17,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:39:17,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:39:17,093 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 50 states. [2018-10-12 20:39:18,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:18,886 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-12 20:39:18,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-12 20:39:18,886 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 253 [2018-10-12 20:39:18,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:18,887 INFO L225 Difference]: With dead ends: 259 [2018-10-12 20:39:18,887 INFO L226 Difference]: Without dead ends: 259 [2018-10-12 20:39:18,888 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-12 20:39:18,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-12 20:39:18,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 257. [2018-10-12 20:39:18,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-12 20:39:18,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-12 20:39:18,891 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 253 [2018-10-12 20:39:18,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:18,891 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-12 20:39:18,891 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:39:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-12 20:39:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-12 20:39:18,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:18,893 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] [2018-10-12 20:39:18,893 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:18,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:18,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1482322242, now seen corresponding path program 47 times [2018-10-12 20:39:18,894 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:20,255 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-12 20:39:20,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:20,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 20:39:20,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 20:39:20,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 20:39:20,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 20:39:20,257 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 51 states. [2018-10-12 20:39:22,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:22,128 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-12 20:39:22,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 20:39:22,128 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 256 [2018-10-12 20:39:22,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:22,129 INFO L225 Difference]: With dead ends: 262 [2018-10-12 20:39:22,129 INFO L226 Difference]: Without dead ends: 262 [2018-10-12 20:39:22,130 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 20:39:22,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-12 20:39:22,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 260. [2018-10-12 20:39:22,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-12 20:39:22,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-12 20:39:22,133 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 256 [2018-10-12 20:39:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:22,134 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-12 20:39:22,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 20:39:22,134 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-12 20:39:22,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-12 20:39:22,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:22,136 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] [2018-10-12 20:39:22,136 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:22,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:22,136 INFO L82 PathProgramCache]: Analyzing trace with hash -816636832, now seen corresponding path program 48 times [2018-10-12 20:39:22,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:22,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:23,457 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-12 20:39:23,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:23,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:39:23,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:39:23,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:39:23,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:39:23,459 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 52 states. [2018-10-12 20:39:25,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:25,452 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-10-12 20:39:25,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 20:39:25,453 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 259 [2018-10-12 20:39:25,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:25,454 INFO L225 Difference]: With dead ends: 265 [2018-10-12 20:39:25,454 INFO L226 Difference]: Without dead ends: 265 [2018-10-12 20:39:25,455 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-12 20:39:25,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-10-12 20:39:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 263. [2018-10-12 20:39:25,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-12 20:39:25,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-12 20:39:25,458 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 259 [2018-10-12 20:39:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:25,458 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-12 20:39:25,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:39:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-12 20:39:25,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-12 20:39:25,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:25,460 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] [2018-10-12 20:39:25,460 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:25,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:25,460 INFO L82 PathProgramCache]: Analyzing trace with hash 753406846, now seen corresponding path program 49 times [2018-10-12 20:39:25,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:26,905 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-12 20:39:26,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:26,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 20:39:26,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 20:39:26,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 20:39:26,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:39:26,907 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 53 states. [2018-10-12 20:39:28,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:28,877 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-12 20:39:28,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 20:39:28,877 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 262 [2018-10-12 20:39:28,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:28,878 INFO L225 Difference]: With dead ends: 268 [2018-10-12 20:39:28,878 INFO L226 Difference]: Without dead ends: 268 [2018-10-12 20:39:28,879 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-12 20:39:28,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-12 20:39:28,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 266. [2018-10-12 20:39:28,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-12 20:39:28,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-12 20:39:28,887 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 262 [2018-10-12 20:39:28,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:28,887 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-12 20:39:28,888 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 20:39:28,888 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-12 20:39:28,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-12 20:39:28,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:28,889 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] [2018-10-12 20:39:28,889 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:28,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:28,890 INFO L82 PathProgramCache]: Analyzing trace with hash 1730764704, now seen corresponding path program 50 times [2018-10-12 20:39:28,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:28,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:30,442 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-12 20:39:30,442 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:30,442 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:39:30,443 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:39:30,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:39:30,443 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:39:30,444 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 54 states. [2018-10-12 20:39:32,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:32,427 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-10-12 20:39:32,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 20:39:32,428 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 265 [2018-10-12 20:39:32,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:32,429 INFO L225 Difference]: With dead ends: 271 [2018-10-12 20:39:32,429 INFO L226 Difference]: Without dead ends: 271 [2018-10-12 20:39:32,430 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-12 20:39:32,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-10-12 20:39:32,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 269. [2018-10-12 20:39:32,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-12 20:39:32,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-12 20:39:32,433 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 265 [2018-10-12 20:39:32,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:32,433 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-12 20:39:32,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:39:32,433 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-12 20:39:32,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-12 20:39:32,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:32,435 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] [2018-10-12 20:39:32,435 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:32,435 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:32,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1679554498, now seen corresponding path program 51 times [2018-10-12 20:39:32,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:32,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:33,903 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-12 20:39:33,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:33,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 20:39:33,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 20:39:33,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 20:39:33,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 20:39:33,905 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 55 states. [2018-10-12 20:39:36,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:36,141 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-12 20:39:36,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-12 20:39:36,141 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 268 [2018-10-12 20:39:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:36,142 INFO L225 Difference]: With dead ends: 274 [2018-10-12 20:39:36,142 INFO L226 Difference]: Without dead ends: 274 [2018-10-12 20:39:36,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-12 20:39:36,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-12 20:39:36,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 272. [2018-10-12 20:39:36,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-12 20:39:36,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-12 20:39:36,146 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 268 [2018-10-12 20:39:36,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:36,146 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-12 20:39:36,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 20:39:36,146 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-12 20:39:36,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-12 20:39:36,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:36,147 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] [2018-10-12 20:39:36,148 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:36,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:36,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1047514400, now seen corresponding path program 52 times [2018-10-12 20:39:36,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:37,685 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-12 20:39:37,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:37,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 20:39:37,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 20:39:37,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 20:39:37,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:39:37,686 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 56 states. [2018-10-12 20:39:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:40,013 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-10-12 20:39:40,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-12 20:39:40,013 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 271 [2018-10-12 20:39:40,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:40,015 INFO L225 Difference]: With dead ends: 277 [2018-10-12 20:39:40,015 INFO L226 Difference]: Without dead ends: 277 [2018-10-12 20:39:40,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-12 20:39:40,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-10-12 20:39:40,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 275. [2018-10-12 20:39:40,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-12 20:39:40,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-12 20:39:40,020 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 271 [2018-10-12 20:39:40,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:40,021 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-12 20:39:40,021 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 20:39:40,021 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-12 20:39:40,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-12 20:39:40,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:40,022 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] [2018-10-12 20:39:40,023 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:40,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:40,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1077580546, now seen corresponding path program 53 times [2018-10-12 20:39:40,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:40,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:41,453 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-12 20:39:41,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:41,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-12 20:39:41,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-12 20:39:41,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-12 20:39:41,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 20:39:41,454 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 57 states. [2018-10-12 20:39:43,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:43,595 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-12 20:39:43,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-12 20:39:43,595 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 274 [2018-10-12 20:39:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:43,596 INFO L225 Difference]: With dead ends: 280 [2018-10-12 20:39:43,596 INFO L226 Difference]: Without dead ends: 280 [2018-10-12 20:39:43,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-12 20:39:43,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-12 20:39:43,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 278. [2018-10-12 20:39:43,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-12 20:39:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-12 20:39:43,600 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 274 [2018-10-12 20:39:43,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:43,600 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-12 20:39:43,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-12 20:39:43,600 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-12 20:39:43,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-12 20:39:43,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:43,602 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] [2018-10-12 20:39:43,602 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:43,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:43,602 INFO L82 PathProgramCache]: Analyzing trace with hash 870028832, now seen corresponding path program 54 times [2018-10-12 20:39:43,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:45,422 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-12 20:39:45,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:45,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:39:45,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:39:45,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:39:45,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:39:45,424 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 58 states. [2018-10-12 20:39:47,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:47,636 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-12 20:39:47,636 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-12 20:39:47,637 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 277 [2018-10-12 20:39:47,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:47,638 INFO L225 Difference]: With dead ends: 283 [2018-10-12 20:39:47,638 INFO L226 Difference]: Without dead ends: 283 [2018-10-12 20:39:47,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-12 20:39:47,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2018-10-12 20:39:47,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 281. [2018-10-12 20:39:47,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-12 20:39:47,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-12 20:39:47,641 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 277 [2018-10-12 20:39:47,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:47,642 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-12 20:39:47,642 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:39:47,642 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-12 20:39:47,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-12 20:39:47,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:47,643 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] [2018-10-12 20:39:47,643 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:47,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:47,644 INFO L82 PathProgramCache]: Analyzing trace with hash 1387807166, now seen corresponding path program 55 times [2018-10-12 20:39:47,644 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:47,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:49,141 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-12 20:39:49,142 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:49,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-12 20:39:49,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-12 20:39:49,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-12 20:39:49,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 20:39:49,143 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 59 states. [2018-10-12 20:39:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:51,733 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-12 20:39:51,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-12 20:39:51,734 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 280 [2018-10-12 20:39:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:51,735 INFO L225 Difference]: With dead ends: 286 [2018-10-12 20:39:51,735 INFO L226 Difference]: Without dead ends: 286 [2018-10-12 20:39:51,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-12 20:39:51,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-12 20:39:51,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 284. [2018-10-12 20:39:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-12 20:39:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-12 20:39:51,738 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 280 [2018-10-12 20:39:51,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:51,739 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-12 20:39:51,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-12 20:39:51,739 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-12 20:39:51,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-12 20:39:51,740 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:51,740 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] [2018-10-12 20:39:51,740 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:51,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:51,740 INFO L82 PathProgramCache]: Analyzing trace with hash -1000371872, now seen corresponding path program 56 times [2018-10-12 20:39:51,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:53,388 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-12 20:39:53,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:53,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:39:53,389 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:39:53,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:39:53,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:39:53,390 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 60 states. [2018-10-12 20:39:56,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:39:56,001 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-12 20:39:56,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:39:56,001 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 283 [2018-10-12 20:39:56,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:39:56,003 INFO L225 Difference]: With dead ends: 289 [2018-10-12 20:39:56,003 INFO L226 Difference]: Without dead ends: 289 [2018-10-12 20:39:56,004 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-12 20:39:56,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-12 20:39:56,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 287. [2018-10-12 20:39:56,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-12 20:39:56,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-12 20:39:56,007 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 283 [2018-10-12 20:39:56,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:39:56,007 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-12 20:39:56,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:39:56,007 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-12 20:39:56,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-12 20:39:56,008 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:39:56,009 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] [2018-10-12 20:39:56,009 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:39:56,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:39:56,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1108834690, now seen corresponding path program 57 times [2018-10-12 20:39:56,010 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:39:56,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:39:57,585 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-12 20:39:57,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:39:57,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-12 20:39:57,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-12 20:39:57,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-12 20:39:57,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-12 20:39:57,586 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 61 states. [2018-10-12 20:40:00,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:00,243 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-12 20:40:00,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-12 20:40:00,243 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 286 [2018-10-12 20:40:00,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:00,244 INFO L225 Difference]: With dead ends: 292 [2018-10-12 20:40:00,244 INFO L226 Difference]: Without dead ends: 292 [2018-10-12 20:40:00,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-12 20:40:00,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-12 20:40:00,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 290. [2018-10-12 20:40:00,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-12 20:40:00,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-12 20:40:00,248 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 286 [2018-10-12 20:40:00,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:00,248 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-12 20:40:00,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-12 20:40:00,248 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-12 20:40:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-12 20:40:00,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:00,250 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] [2018-10-12 20:40:00,250 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:00,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1785728160, now seen corresponding path program 58 times [2018-10-12 20:40:00,251 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:00,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:01,868 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-12 20:40:01,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:01,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:40:01,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:40:01,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:40:01,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:40:01,870 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 62 states. [2018-10-12 20:40:04,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:04,419 INFO L93 Difference]: Finished difference Result 295 states and 295 transitions. [2018-10-12 20:40:04,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-12 20:40:04,419 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 289 [2018-10-12 20:40:04,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:04,420 INFO L225 Difference]: With dead ends: 295 [2018-10-12 20:40:04,420 INFO L226 Difference]: Without dead ends: 295 [2018-10-12 20:40:04,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-12 20:40:04,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2018-10-12 20:40:04,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 293. [2018-10-12 20:40:04,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-12 20:40:04,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-12 20:40:04,423 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 289 [2018-10-12 20:40:04,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:04,423 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-12 20:40:04,424 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 20:40:04,424 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-12 20:40:04,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-12 20:40:04,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:04,425 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] [2018-10-12 20:40:04,425 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:04,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:04,425 INFO L82 PathProgramCache]: Analyzing trace with hash -645776578, now seen corresponding path program 59 times [2018-10-12 20:40:04,426 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:04,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:06,410 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-12 20:40:06,410 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:06,410 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-12 20:40:06,410 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-12 20:40:06,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-12 20:40:06,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:40:06,411 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 63 states. [2018-10-12 20:40:08,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:08,923 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-12 20:40:08,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-12 20:40:08,923 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 292 [2018-10-12 20:40:08,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:08,924 INFO L225 Difference]: With dead ends: 298 [2018-10-12 20:40:08,924 INFO L226 Difference]: Without dead ends: 298 [2018-10-12 20:40:08,925 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-12 20:40:08,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-12 20:40:08,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 296. [2018-10-12 20:40:08,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-12 20:40:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-12 20:40:08,928 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 292 [2018-10-12 20:40:08,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:08,929 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-12 20:40:08,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-12 20:40:08,929 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-12 20:40:08,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-12 20:40:08,930 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:08,930 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] [2018-10-12 20:40:08,930 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:08,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:08,931 INFO L82 PathProgramCache]: Analyzing trace with hash 1314988000, now seen corresponding path program 60 times [2018-10-12 20:40:08,931 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:10,968 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-12 20:40:10,968 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:10,968 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 20:40:10,969 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 20:40:10,969 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 20:40:10,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:40:10,970 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 64 states. [2018-10-12 20:40:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:13,592 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-12 20:40:13,593 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-12 20:40:13,593 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 295 [2018-10-12 20:40:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:13,594 INFO L225 Difference]: With dead ends: 301 [2018-10-12 20:40:13,594 INFO L226 Difference]: Without dead ends: 301 [2018-10-12 20:40:13,595 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-12 20:40:13,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states. [2018-10-12 20:40:13,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 299. [2018-10-12 20:40:13,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-12 20:40:13,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-12 20:40:13,597 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 295 [2018-10-12 20:40:13,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:13,597 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-12 20:40:13,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 20:40:13,598 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-12 20:40:13,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-12 20:40:13,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:13,599 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] [2018-10-12 20:40:13,599 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:13,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:13,599 INFO L82 PathProgramCache]: Analyzing trace with hash -1397661698, now seen corresponding path program 61 times [2018-10-12 20:40:13,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:13,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:15,773 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-12 20:40:15,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:15,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-12 20:40:15,774 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-12 20:40:15,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-12 20:40:15,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 20:40:15,775 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 65 states. [2018-10-12 20:40:18,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:18,476 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-12 20:40:18,476 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-12 20:40:18,476 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 298 [2018-10-12 20:40:18,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:18,478 INFO L225 Difference]: With dead ends: 304 [2018-10-12 20:40:18,478 INFO L226 Difference]: Without dead ends: 304 [2018-10-12 20:40:18,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-12 20:40:18,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-12 20:40:18,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 302. [2018-10-12 20:40:18,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-12 20:40:18,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-12 20:40:18,482 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 298 [2018-10-12 20:40:18,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:18,482 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-12 20:40:18,482 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-12 20:40:18,482 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-12 20:40:18,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-12 20:40:18,483 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:18,483 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] [2018-10-12 20:40:18,483 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:18,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:18,483 INFO L82 PathProgramCache]: Analyzing trace with hash 159826720, now seen corresponding path program 62 times [2018-10-12 20:40:18,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:18,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:21,096 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-12 20:40:21,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:21,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 20:40:21,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 20:40:21,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 20:40:21,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 20:40:21,098 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 66 states. [2018-10-12 20:40:23,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:23,953 INFO L93 Difference]: Finished difference Result 307 states and 307 transitions. [2018-10-12 20:40:23,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 20:40:23,954 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 301 [2018-10-12 20:40:23,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:23,955 INFO L225 Difference]: With dead ends: 307 [2018-10-12 20:40:23,955 INFO L226 Difference]: Without dead ends: 307 [2018-10-12 20:40:23,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-12 20:40:23,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2018-10-12 20:40:23,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 305. [2018-10-12 20:40:23,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-12 20:40:23,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-12 20:40:23,958 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 301 [2018-10-12 20:40:23,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:23,958 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-12 20:40:23,958 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-12 20:40:23,958 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-12 20:40:23,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-12 20:40:23,959 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:23,959 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] [2018-10-12 20:40:23,960 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:23,960 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:23,960 INFO L82 PathProgramCache]: Analyzing trace with hash 765588670, now seen corresponding path program 63 times [2018-10-12 20:40:23,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:23,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:26,105 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-12 20:40:26,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:26,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-12 20:40:26,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-12 20:40:26,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-12 20:40:26,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 20:40:26,107 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 67 states. [2018-10-12 20:40:29,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:29,024 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-12 20:40:29,024 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-12 20:40:29,025 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 304 [2018-10-12 20:40:29,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:29,026 INFO L225 Difference]: With dead ends: 310 [2018-10-12 20:40:29,026 INFO L226 Difference]: Without dead ends: 310 [2018-10-12 20:40:29,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-12 20:40:29,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-12 20:40:29,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 308. [2018-10-12 20:40:29,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-12 20:40:29,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-12 20:40:29,030 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 304 [2018-10-12 20:40:29,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:29,030 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-12 20:40:29,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-12 20:40:29,030 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-12 20:40:29,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-12 20:40:29,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:29,032 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] [2018-10-12 20:40:29,032 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:29,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:29,032 INFO L82 PathProgramCache]: Analyzing trace with hash -432736672, now seen corresponding path program 64 times [2018-10-12 20:40:29,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:31,355 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-12 20:40:31,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:31,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 20:40:31,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 20:40:31,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 20:40:31,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:40:31,356 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 68 states. [2018-10-12 20:40:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:34,267 INFO L93 Difference]: Finished difference Result 313 states and 313 transitions. [2018-10-12 20:40:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-12 20:40:34,267 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 307 [2018-10-12 20:40:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:34,268 INFO L225 Difference]: With dead ends: 313 [2018-10-12 20:40:34,268 INFO L226 Difference]: Without dead ends: 313 [2018-10-12 20:40:34,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-12 20:40:34,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2018-10-12 20:40:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 311. [2018-10-12 20:40:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 311 states. [2018-10-12 20:40:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 311 transitions. [2018-10-12 20:40:34,272 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 311 transitions. Word has length 307 [2018-10-12 20:40:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:34,272 INFO L481 AbstractCegarLoop]: Abstraction has 311 states and 311 transitions. [2018-10-12 20:40:34,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-12 20:40:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 311 transitions. [2018-10-12 20:40:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2018-10-12 20:40:34,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:34,274 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] [2018-10-12 20:40:34,274 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:34,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash 25164158, now seen corresponding path program 65 times [2018-10-12 20:40:34,275 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:36,714 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-12 20:40:36,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:36,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-12 20:40:36,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-12 20:40:36,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-12 20:40:36,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 20:40:36,716 INFO L87 Difference]: Start difference. First operand 311 states and 311 transitions. Second operand 69 states. [2018-10-12 20:40:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:39,810 INFO L93 Difference]: Finished difference Result 316 states and 316 transitions. [2018-10-12 20:40:39,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-12 20:40:39,810 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 310 [2018-10-12 20:40:39,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:39,811 INFO L225 Difference]: With dead ends: 316 [2018-10-12 20:40:39,812 INFO L226 Difference]: Without dead ends: 316 [2018-10-12 20:40:39,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-12 20:40:39,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2018-10-12 20:40:39,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 314. [2018-10-12 20:40:39,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-12 20:40:39,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-12 20:40:39,816 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 310 [2018-10-12 20:40:39,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:39,816 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-12 20:40:39,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-12 20:40:39,816 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-12 20:40:39,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-12 20:40:39,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:39,817 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] [2018-10-12 20:40:39,817 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:39,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:39,818 INFO L82 PathProgramCache]: Analyzing trace with hash 532658592, now seen corresponding path program 66 times [2018-10-12 20:40:39,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:39,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:42,134 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-12 20:40:42,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:42,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-12 20:40:42,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-12 20:40:42,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-12 20:40:42,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-12 20:40:42,136 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 70 states. [2018-10-12 20:40:45,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:45,091 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-12 20:40:45,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-12 20:40:45,091 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 313 [2018-10-12 20:40:45,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:45,092 INFO L225 Difference]: With dead ends: 319 [2018-10-12 20:40:45,092 INFO L226 Difference]: Without dead ends: 319 [2018-10-12 20:40:45,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-12 20:40:45,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 319 states. [2018-10-12 20:40:45,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 319 to 317. [2018-10-12 20:40:45,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-12 20:40:45,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-12 20:40:45,096 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 313 [2018-10-12 20:40:45,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:45,097 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-12 20:40:45,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-12 20:40:45,097 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-12 20:40:45,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-12 20:40:45,098 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:45,098 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] [2018-10-12 20:40:45,098 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:45,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:45,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1014459966, now seen corresponding path program 67 times [2018-10-12 20:40:45,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:47,519 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-12 20:40:47,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-12 20:40:47,520 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-12 20:40:47,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-12 20:40:47,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 20:40:47,521 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 71 states. [2018-10-12 20:40:50,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:50,729 INFO L93 Difference]: Finished difference Result 322 states and 322 transitions. [2018-10-12 20:40:50,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-12 20:40:50,730 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 316 [2018-10-12 20:40:50,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:50,731 INFO L225 Difference]: With dead ends: 322 [2018-10-12 20:40:50,731 INFO L226 Difference]: Without dead ends: 322 [2018-10-12 20:40:50,732 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-12 20:40:50,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2018-10-12 20:40:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 320. [2018-10-12 20:40:50,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-12 20:40:50,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-12 20:40:50,734 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 316 [2018-10-12 20:40:50,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:50,735 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-12 20:40:50,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-12 20:40:50,735 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-12 20:40:50,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-12 20:40:50,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:50,736 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] [2018-10-12 20:40:50,736 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:50,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:50,736 INFO L82 PathProgramCache]: Analyzing trace with hash 578489568, now seen corresponding path program 68 times [2018-10-12 20:40:50,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:50,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:53,375 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-12 20:40:53,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:53,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-12 20:40:53,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-12 20:40:53,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-12 20:40:53,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:40:53,377 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 72 states. [2018-10-12 20:40:56,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:40:56,793 INFO L93 Difference]: Finished difference Result 325 states and 325 transitions. [2018-10-12 20:40:56,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:40:56,793 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 319 [2018-10-12 20:40:56,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:40:56,794 INFO L225 Difference]: With dead ends: 325 [2018-10-12 20:40:56,794 INFO L226 Difference]: Without dead ends: 325 [2018-10-12 20:40:56,796 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-12 20:40:56,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2018-10-12 20:40:56,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 323. [2018-10-12 20:40:56,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-12 20:40:56,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-12 20:40:56,798 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 319 [2018-10-12 20:40:56,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:40:56,798 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-12 20:40:56,798 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-12 20:40:56,798 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-12 20:40:56,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-12 20:40:56,799 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:40:56,800 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] [2018-10-12 20:40:56,800 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:40:56,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:40:56,800 INFO L82 PathProgramCache]: Analyzing trace with hash 565465854, now seen corresponding path program 69 times [2018-10-12 20:40:56,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:40:56,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:40:59,120 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-12 20:40:59,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:40:59,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-12 20:40:59,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-12 20:40:59,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-12 20:40:59,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 20:40:59,121 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 73 states. [2018-10-12 20:41:02,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:02,527 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-12 20:41:02,527 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-12 20:41:02,528 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 322 [2018-10-12 20:41:02,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:02,529 INFO L225 Difference]: With dead ends: 328 [2018-10-12 20:41:02,529 INFO L226 Difference]: Without dead ends: 328 [2018-10-12 20:41:02,530 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-12 20:41:02,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-12 20:41:02,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 326. [2018-10-12 20:41:02,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-12 20:41:02,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-12 20:41:02,532 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 322 [2018-10-12 20:41:02,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:02,532 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-12 20:41:02,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-12 20:41:02,533 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-12 20:41:02,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-12 20:41:02,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:02,534 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] [2018-10-12 20:41:02,534 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:02,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:02,534 INFO L82 PathProgramCache]: Analyzing trace with hash -876941280, now seen corresponding path program 70 times [2018-10-12 20:41:02,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:04,879 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-12 20:41:04,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:04,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-12 20:41:04,880 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-12 20:41:04,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-12 20:41:04,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 20:41:04,880 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 74 states. [2018-10-12 20:41:08,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:08,689 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-12 20:41:08,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-12 20:41:08,690 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 325 [2018-10-12 20:41:08,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:08,691 INFO L225 Difference]: With dead ends: 331 [2018-10-12 20:41:08,691 INFO L226 Difference]: Without dead ends: 331 [2018-10-12 20:41:08,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-12 20:41:08,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-12 20:41:08,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 329. [2018-10-12 20:41:08,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 329 states. [2018-10-12 20:41:08,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 329 transitions. [2018-10-12 20:41:08,694 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 329 transitions. Word has length 325 [2018-10-12 20:41:08,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:08,695 INFO L481 AbstractCegarLoop]: Abstraction has 329 states and 329 transitions. [2018-10-12 20:41:08,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-12 20:41:08,695 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 329 transitions. [2018-10-12 20:41:08,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2018-10-12 20:41:08,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:08,696 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] [2018-10-12 20:41:08,696 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:08,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:08,696 INFO L82 PathProgramCache]: Analyzing trace with hash -480073794, now seen corresponding path program 71 times [2018-10-12 20:41:08,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:08,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:11,437 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-12 20:41:11,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:11,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-12 20:41:11,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-12 20:41:11,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-12 20:41:11,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 20:41:11,438 INFO L87 Difference]: Start difference. First operand 329 states and 329 transitions. Second operand 75 states. [2018-10-12 20:41:15,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:15,367 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-12 20:41:15,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-12 20:41:15,367 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 328 [2018-10-12 20:41:15,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:15,368 INFO L225 Difference]: With dead ends: 334 [2018-10-12 20:41:15,368 INFO L226 Difference]: Without dead ends: 334 [2018-10-12 20:41:15,369 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-12 20:41:15,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2018-10-12 20:41:15,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 332. [2018-10-12 20:41:15,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-12 20:41:15,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-12 20:41:15,372 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 328 [2018-10-12 20:41:15,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:15,372 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-12 20:41:15,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-12 20:41:15,372 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-12 20:41:15,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-12 20:41:15,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:15,374 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] [2018-10-12 20:41:15,374 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:15,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:15,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1445764256, now seen corresponding path program 72 times [2018-10-12 20:41:15,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:15,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:18,075 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-12 20:41:18,075 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:18,075 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-12 20:41:18,076 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-12 20:41:18,076 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-12 20:41:18,076 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 20:41:18,076 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 76 states. [2018-10-12 20:41:21,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:21,913 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-12 20:41:21,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-12 20:41:21,913 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 331 [2018-10-12 20:41:21,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:21,914 INFO L225 Difference]: With dead ends: 337 [2018-10-12 20:41:21,914 INFO L226 Difference]: Without dead ends: 337 [2018-10-12 20:41:21,915 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-12 20:41:21,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2018-10-12 20:41:21,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2018-10-12 20:41:21,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-12 20:41:21,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-12 20:41:21,917 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 331 [2018-10-12 20:41:21,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:21,918 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-12 20:41:21,918 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-12 20:41:21,918 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-12 20:41:21,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-12 20:41:21,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:21,919 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] [2018-10-12 20:41:21,919 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:21,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:21,920 INFO L82 PathProgramCache]: Analyzing trace with hash 1655598206, now seen corresponding path program 73 times [2018-10-12 20:41:21,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:21,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:24,538 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-12 20:41:24,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:24,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-12 20:41:24,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-12 20:41:24,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-12 20:41:24,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 20:41:24,540 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 77 states. [2018-10-12 20:41:28,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:28,517 INFO L93 Difference]: Finished difference Result 340 states and 340 transitions. [2018-10-12 20:41:28,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-12 20:41:28,517 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 334 [2018-10-12 20:41:28,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:28,518 INFO L225 Difference]: With dead ends: 340 [2018-10-12 20:41:28,518 INFO L226 Difference]: Without dead ends: 340 [2018-10-12 20:41:28,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-12 20:41:28,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-12 20:41:28,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 338. [2018-10-12 20:41:28,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-12 20:41:28,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-10-12 20:41:28,522 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 334 [2018-10-12 20:41:28,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:28,522 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-10-12 20:41:28,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-12 20:41:28,522 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-10-12 20:41:28,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-12 20:41:28,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:28,523 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] [2018-10-12 20:41:28,523 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:28,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:28,524 INFO L82 PathProgramCache]: Analyzing trace with hash 1008232096, now seen corresponding path program 74 times [2018-10-12 20:41:28,524 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:31,131 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-12 20:41:31,132 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:31,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-12 20:41:31,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-12 20:41:31,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-12 20:41:31,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 20:41:31,133 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 78 states. [2018-10-12 20:41:35,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:35,179 INFO L93 Difference]: Finished difference Result 343 states and 343 transitions. [2018-10-12 20:41:35,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:41:35,179 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 337 [2018-10-12 20:41:35,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:35,180 INFO L225 Difference]: With dead ends: 343 [2018-10-12 20:41:35,180 INFO L226 Difference]: Without dead ends: 343 [2018-10-12 20:41:35,181 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-12 20:41:35,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2018-10-12 20:41:35,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 341. [2018-10-12 20:41:35,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 341 states. [2018-10-12 20:41:35,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 341 transitions. [2018-10-12 20:41:35,184 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 341 transitions. Word has length 337 [2018-10-12 20:41:35,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:35,184 INFO L481 AbstractCegarLoop]: Abstraction has 341 states and 341 transitions. [2018-10-12 20:41:35,184 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-12 20:41:35,184 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 341 transitions. [2018-10-12 20:41:35,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2018-10-12 20:41:35,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:35,185 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] [2018-10-12 20:41:35,186 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:35,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:35,186 INFO L82 PathProgramCache]: Analyzing trace with hash -272391874, now seen corresponding path program 75 times [2018-10-12 20:41:35,186 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:35,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:38,061 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-12 20:41:38,062 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:38,062 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-12 20:41:38,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-12 20:41:38,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-12 20:41:38,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 20:41:38,063 INFO L87 Difference]: Start difference. First operand 341 states and 341 transitions. Second operand 79 states. [2018-10-12 20:41:41,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:41,998 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-12 20:41:41,998 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-12 20:41:41,998 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 340 [2018-10-12 20:41:41,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:42,000 INFO L225 Difference]: With dead ends: 346 [2018-10-12 20:41:42,000 INFO L226 Difference]: Without dead ends: 346 [2018-10-12 20:41:42,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-12 20:41:42,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-12 20:41:42,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 344. [2018-10-12 20:41:42,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-12 20:41:42,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-12 20:41:42,004 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 340 [2018-10-12 20:41:42,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:42,004 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-12 20:41:42,004 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-12 20:41:42,004 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-12 20:41:42,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-12 20:41:42,005 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:42,005 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] [2018-10-12 20:41:42,005 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:42,006 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:42,006 INFO L82 PathProgramCache]: Analyzing trace with hash 853408224, now seen corresponding path program 76 times [2018-10-12 20:41:42,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:42,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:45,058 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-12 20:41:45,059 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:45,059 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-12 20:41:45,059 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-12 20:41:45,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-12 20:41:45,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 20:41:45,060 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 80 states. [2018-10-12 20:41:49,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:49,379 INFO L93 Difference]: Finished difference Result 349 states and 349 transitions. [2018-10-12 20:41:49,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-12 20:41:49,379 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 343 [2018-10-12 20:41:49,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:49,380 INFO L225 Difference]: With dead ends: 349 [2018-10-12 20:41:49,380 INFO L226 Difference]: Without dead ends: 349 [2018-10-12 20:41:49,381 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-12 20:41:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 349 states. [2018-10-12 20:41:49,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 349 to 347. [2018-10-12 20:41:49,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 20:41:49,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-12 20:41:49,384 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 343 [2018-10-12 20:41:49,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:49,385 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-12 20:41:49,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-12 20:41:49,385 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-12 20:41:49,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-12 20:41:49,386 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:49,386 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] [2018-10-12 20:41:49,386 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:49,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:49,386 INFO L82 PathProgramCache]: Analyzing trace with hash 164513278, now seen corresponding path program 77 times [2018-10-12 20:41:49,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:49,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:52,199 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-12 20:41:52,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:52,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-12 20:41:52,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-12 20:41:52,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-12 20:41:52,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 20:41:52,201 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 81 states. [2018-10-12 20:41:56,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:41:56,189 INFO L93 Difference]: Finished difference Result 352 states and 352 transitions. [2018-10-12 20:41:56,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:41:56,189 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 346 [2018-10-12 20:41:56,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:41:56,190 INFO L225 Difference]: With dead ends: 352 [2018-10-12 20:41:56,190 INFO L226 Difference]: Without dead ends: 352 [2018-10-12 20:41:56,191 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-12 20:41:56,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-12 20:41:56,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 350. [2018-10-12 20:41:56,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-12 20:41:56,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-12 20:41:56,194 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 346 [2018-10-12 20:41:56,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:41:56,194 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-12 20:41:56,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-12 20:41:56,194 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-12 20:41:56,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-12 20:41:56,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:41:56,196 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] [2018-10-12 20:41:56,196 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:41:56,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:41:56,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1351082720, now seen corresponding path program 78 times [2018-10-12 20:41:56,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:41:56,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:41:59,393 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-12 20:41:59,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:41:59,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-12 20:41:59,394 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-12 20:41:59,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-12 20:41:59,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 20:41:59,410 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 82 states. [2018-10-12 20:42:03,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:03,734 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-12 20:42:03,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-12 20:42:03,734 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 349 [2018-10-12 20:42:03,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:03,735 INFO L225 Difference]: With dead ends: 355 [2018-10-12 20:42:03,736 INFO L226 Difference]: Without dead ends: 355 [2018-10-12 20:42:03,736 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-12 20:42:03,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2018-10-12 20:42:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 353. [2018-10-12 20:42:03,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-12 20:42:03,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-12 20:42:03,739 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 349 [2018-10-12 20:42:03,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:03,739 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-12 20:42:03,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-12 20:42:03,739 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-12 20:42:03,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-12 20:42:03,741 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:03,741 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] [2018-10-12 20:42:03,741 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:03,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:03,741 INFO L82 PathProgramCache]: Analyzing trace with hash 519723710, now seen corresponding path program 79 times [2018-10-12 20:42:03,742 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:06,698 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-12 20:42:06,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:06,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-12 20:42:06,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-12 20:42:06,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-12 20:42:06,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 20:42:06,699 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 83 states. [2018-10-12 20:42:11,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:11,269 INFO L93 Difference]: Finished difference Result 358 states and 358 transitions. [2018-10-12 20:42:11,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-12 20:42:11,270 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 352 [2018-10-12 20:42:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:11,271 INFO L225 Difference]: With dead ends: 358 [2018-10-12 20:42:11,271 INFO L226 Difference]: Without dead ends: 358 [2018-10-12 20:42:11,273 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-12 20:42:11,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-12 20:42:11,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 356. [2018-10-12 20:42:11,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-12 20:42:11,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-10-12 20:42:11,276 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 352 [2018-10-12 20:42:11,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:11,276 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-10-12 20:42:11,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-12 20:42:11,276 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-10-12 20:42:11,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-12 20:42:11,277 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:11,277 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] [2018-10-12 20:42:11,278 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:11,278 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:11,278 INFO L82 PathProgramCache]: Analyzing trace with hash -2076520352, now seen corresponding path program 80 times [2018-10-12 20:42:11,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:11,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:14,596 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-12 20:42:14,597 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:14,597 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-12 20:42:14,597 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-12 20:42:14,598 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-12 20:42:14,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 20:42:14,598 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 84 states. [2018-10-12 20:42:19,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:19,079 INFO L93 Difference]: Finished difference Result 361 states and 361 transitions. [2018-10-12 20:42:19,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 20:42:19,080 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 355 [2018-10-12 20:42:19,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:19,081 INFO L225 Difference]: With dead ends: 361 [2018-10-12 20:42:19,081 INFO L226 Difference]: Without dead ends: 361 [2018-10-12 20:42:19,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-12 20:42:19,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-12 20:42:19,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 359. [2018-10-12 20:42:19,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 359 states. [2018-10-12 20:42:19,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 359 states to 359 states and 359 transitions. [2018-10-12 20:42:19,085 INFO L78 Accepts]: Start accepts. Automaton has 359 states and 359 transitions. Word has length 355 [2018-10-12 20:42:19,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:19,085 INFO L481 AbstractCegarLoop]: Abstraction has 359 states and 359 transitions. [2018-10-12 20:42:19,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-12 20:42:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 359 transitions. [2018-10-12 20:42:19,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 359 [2018-10-12 20:42:19,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:19,087 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] [2018-10-12 20:42:19,087 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:19,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:19,088 INFO L82 PathProgramCache]: Analyzing trace with hash 1282662270, now seen corresponding path program 81 times [2018-10-12 20:42:19,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:22,174 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-12 20:42:22,174 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:22,174 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-12 20:42:22,174 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-12 20:42:22,175 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-12 20:42:22,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 20:42:22,175 INFO L87 Difference]: Start difference. First operand 359 states and 359 transitions. Second operand 85 states. [2018-10-12 20:42:26,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:26,894 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-12 20:42:26,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-12 20:42:26,894 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 358 [2018-10-12 20:42:26,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:26,896 INFO L225 Difference]: With dead ends: 364 [2018-10-12 20:42:26,896 INFO L226 Difference]: Without dead ends: 364 [2018-10-12 20:42:26,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-12 20:42:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-12 20:42:26,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 362. [2018-10-12 20:42:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-12 20:42:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-12 20:42:26,900 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 358 [2018-10-12 20:42:26,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:26,900 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-12 20:42:26,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-12 20:42:26,901 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-12 20:42:26,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-12 20:42:26,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:26,902 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] [2018-10-12 20:42:26,902 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:26,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:26,902 INFO L82 PathProgramCache]: Analyzing trace with hash 1954157472, now seen corresponding path program 82 times [2018-10-12 20:42:26,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:26,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:30,282 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-12 20:42:30,282 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:30,282 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-12 20:42:30,283 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-12 20:42:30,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-12 20:42:30,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 20:42:30,283 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 86 states. [2018-10-12 20:42:35,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:35,043 INFO L93 Difference]: Finished difference Result 367 states and 367 transitions. [2018-10-12 20:42:35,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-12 20:42:35,043 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 361 [2018-10-12 20:42:35,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:35,044 INFO L225 Difference]: With dead ends: 367 [2018-10-12 20:42:35,044 INFO L226 Difference]: Without dead ends: 367 [2018-10-12 20:42:35,046 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3403 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10625, Invalid=17431, Unknown=0, NotChecked=0, Total=28056 [2018-10-12 20:42:35,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2018-10-12 20:42:35,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 365. [2018-10-12 20:42:35,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2018-10-12 20:42:35,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 365 transitions. [2018-10-12 20:42:35,048 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 365 transitions. Word has length 361 [2018-10-12 20:42:35,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:35,049 INFO L481 AbstractCegarLoop]: Abstraction has 365 states and 365 transitions. [2018-10-12 20:42:35,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-12 20:42:35,049 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 365 transitions. [2018-10-12 20:42:35,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-12 20:42:35,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:35,050 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] [2018-10-12 20:42:35,050 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:35,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:35,051 INFO L82 PathProgramCache]: Analyzing trace with hash 510055486, now seen corresponding path program 83 times [2018-10-12 20:42:35,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:35,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:38,297 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-12 20:42:38,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:38,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-12 20:42:38,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-12 20:42:38,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-12 20:42:38,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 20:42:38,299 INFO L87 Difference]: Start difference. First operand 365 states and 365 transitions. Second operand 87 states. [2018-10-12 20:42:43,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:43,010 INFO L93 Difference]: Finished difference Result 370 states and 370 transitions. [2018-10-12 20:42:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 20:42:43,010 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 364 [2018-10-12 20:42:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:43,011 INFO L225 Difference]: With dead ends: 370 [2018-10-12 20:42:43,011 INFO L226 Difference]: Without dead ends: 370 [2018-10-12 20:42:43,012 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-12 20:42:43,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-12 20:42:43,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 368. [2018-10-12 20:42:43,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-12 20:42:43,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-10-12 20:42:43,015 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 364 [2018-10-12 20:42:43,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:43,015 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-10-12 20:42:43,015 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-12 20:42:43,015 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-10-12 20:42:43,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-12 20:42:43,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:43,017 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] [2018-10-12 20:42:43,017 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:43,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:43,017 INFO L82 PathProgramCache]: Analyzing trace with hash 1955194592, now seen corresponding path program 84 times [2018-10-12 20:42:43,018 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:43,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:46,673 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-12 20:42:46,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:46,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-12 20:42:46,673 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-12 20:42:46,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-12 20:42:46,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 20:42:46,674 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 88 states. [2018-10-12 20:42:51,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:42:51,726 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-12 20:42:51,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-12 20:42:51,727 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 367 [2018-10-12 20:42:51,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:42:51,728 INFO L225 Difference]: With dead ends: 373 [2018-10-12 20:42:51,728 INFO L226 Difference]: Without dead ends: 373 [2018-10-12 20:42:51,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-12 20:42:51,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-12 20:42:51,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 371. [2018-10-12 20:42:51,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-12 20:42:51,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-12 20:42:51,732 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 367 [2018-10-12 20:42:51,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:42:51,732 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-12 20:42:51,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-12 20:42:51,733 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-12 20:42:51,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-12 20:42:51,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:42:51,734 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] [2018-10-12 20:42:51,735 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:42:51,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:42:51,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1342126334, now seen corresponding path program 85 times [2018-10-12 20:42:51,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:42:51,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:42:55,264 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-12 20:42:55,264 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:42:55,264 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-12 20:42:55,265 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-12 20:42:55,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-12 20:42:55,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-12 20:42:55,266 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 89 states. [2018-10-12 20:43:00,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:00,450 INFO L93 Difference]: Finished difference Result 376 states and 376 transitions. [2018-10-12 20:43:00,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-12 20:43:00,450 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 370 [2018-10-12 20:43:00,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:00,451 INFO L225 Difference]: With dead ends: 376 [2018-10-12 20:43:00,451 INFO L226 Difference]: Without dead ends: 376 [2018-10-12 20:43:00,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-12 20:43:00,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2018-10-12 20:43:00,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 374. [2018-10-12 20:43:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-12 20:43:00,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-10-12 20:43:00,456 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 370 [2018-10-12 20:43:00,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:00,456 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-10-12 20:43:00,456 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-12 20:43:00,456 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-10-12 20:43:00,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-12 20:43:00,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:00,458 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] [2018-10-12 20:43:00,458 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:00,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:00,459 INFO L82 PathProgramCache]: Analyzing trace with hash -373405152, now seen corresponding path program 86 times [2018-10-12 20:43:00,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:03,890 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-12 20:43:03,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:03,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-12 20:43:03,891 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-12 20:43:03,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-12 20:43:03,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-12 20:43:03,892 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 90 states. [2018-10-12 20:43:09,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:09,110 INFO L93 Difference]: Finished difference Result 379 states and 379 transitions. [2018-10-12 20:43:09,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 20:43:09,111 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 373 [2018-10-12 20:43:09,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:09,112 INFO L225 Difference]: With dead ends: 379 [2018-10-12 20:43:09,112 INFO L226 Difference]: Without dead ends: 379 [2018-10-12 20:43:09,113 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-12 20:43:09,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2018-10-12 20:43:09,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2018-10-12 20:43:09,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-12 20:43:09,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 377 transitions. [2018-10-12 20:43:09,115 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 377 transitions. Word has length 373 [2018-10-12 20:43:09,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:09,115 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 377 transitions. [2018-10-12 20:43:09,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-12 20:43:09,116 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 377 transitions. [2018-10-12 20:43:09,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-12 20:43:09,117 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:09,117 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] [2018-10-12 20:43:09,117 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:09,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:09,118 INFO L82 PathProgramCache]: Analyzing trace with hash -1956049474, now seen corresponding path program 87 times [2018-10-12 20:43:09,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:09,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:12,916 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-12 20:43:12,917 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:12,917 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-12 20:43:12,917 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-12 20:43:12,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-12 20:43:12,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 20:43:12,918 INFO L87 Difference]: Start difference. First operand 377 states and 377 transitions. Second operand 91 states. [2018-10-12 20:43:18,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:18,209 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-10-12 20:43:18,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-12 20:43:18,210 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 376 [2018-10-12 20:43:18,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:18,211 INFO L225 Difference]: With dead ends: 382 [2018-10-12 20:43:18,211 INFO L226 Difference]: Without dead ends: 382 [2018-10-12 20:43:18,212 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-12 20:43:18,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states. [2018-10-12 20:43:18,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 380. [2018-10-12 20:43:18,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-12 20:43:18,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-12 20:43:18,215 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 376 [2018-10-12 20:43:18,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:18,215 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-12 20:43:18,215 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-12 20:43:18,215 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-12 20:43:18,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-12 20:43:18,217 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:18,217 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] [2018-10-12 20:43:18,217 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:18,217 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:18,217 INFO L82 PathProgramCache]: Analyzing trace with hash -362070688, now seen corresponding path program 88 times [2018-10-12 20:43:18,218 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:18,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:22,100 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-12 20:43:22,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:22,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-12 20:43:22,101 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-12 20:43:22,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-12 20:43:22,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-12 20:43:22,102 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 92 states. [2018-10-12 20:43:27,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:27,531 INFO L93 Difference]: Finished difference Result 385 states and 385 transitions. [2018-10-12 20:43:27,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-12 20:43:27,531 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 379 [2018-10-12 20:43:27,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:27,532 INFO L225 Difference]: With dead ends: 385 [2018-10-12 20:43:27,532 INFO L226 Difference]: Without dead ends: 385 [2018-10-12 20:43:27,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-12 20:43:27,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2018-10-12 20:43:27,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 383. [2018-10-12 20:43:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-12 20:43:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-12 20:43:27,537 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 379 [2018-10-12 20:43:27,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:27,537 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-12 20:43:27,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-12 20:43:27,537 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-12 20:43:27,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-12 20:43:27,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:27,539 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] [2018-10-12 20:43:27,539 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:27,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:27,539 INFO L82 PathProgramCache]: Analyzing trace with hash 701518462, now seen corresponding path program 89 times [2018-10-12 20:43:27,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:27,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:31,415 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-12 20:43:31,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:31,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-12 20:43:31,416 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-12 20:43:31,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-12 20:43:31,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:43:31,417 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 93 states. [2018-10-12 20:43:36,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:36,986 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-12 20:43:36,987 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-12 20:43:36,987 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 382 [2018-10-12 20:43:36,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:36,988 INFO L225 Difference]: With dead ends: 388 [2018-10-12 20:43:36,988 INFO L226 Difference]: Without dead ends: 388 [2018-10-12 20:43:36,990 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-12 20:43:36,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-12 20:43:36,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 386. [2018-10-12 20:43:36,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-12 20:43:36,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-12 20:43:36,993 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 382 [2018-10-12 20:43:36,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:36,993 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-12 20:43:36,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-12 20:43:36,993 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-12 20:43:36,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-12 20:43:36,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:36,995 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] [2018-10-12 20:43:36,995 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:36,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:36,995 INFO L82 PathProgramCache]: Analyzing trace with hash 2112143520, now seen corresponding path program 90 times [2018-10-12 20:43:36,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:37,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:40,992 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-12 20:43:40,992 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:40,993 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-12 20:43:40,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-12 20:43:40,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-12 20:43:40,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-12 20:43:40,994 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 94 states. [2018-10-12 20:43:46,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:46,752 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-12 20:43:46,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-12 20:43:46,753 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 385 [2018-10-12 20:43:46,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:46,754 INFO L225 Difference]: With dead ends: 391 [2018-10-12 20:43:46,754 INFO L226 Difference]: Without dead ends: 391 [2018-10-12 20:43:46,755 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-12 20:43:46,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2018-10-12 20:43:46,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 389. [2018-10-12 20:43:46,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-12 20:43:46,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-12 20:43:46,759 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 385 [2018-10-12 20:43:46,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:46,759 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-12 20:43:46,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-12 20:43:46,759 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-12 20:43:46,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-12 20:43:46,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:46,761 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] [2018-10-12 20:43:46,762 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:46,762 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:46,762 INFO L82 PathProgramCache]: Analyzing trace with hash -211744962, now seen corresponding path program 91 times [2018-10-12 20:43:46,763 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:46,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:43:50,858 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-12 20:43:50,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:43:50,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-12 20:43:50,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-12 20:43:50,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-12 20:43:50,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 20:43:50,860 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 95 states. [2018-10-12 20:43:56,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:43:56,445 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2018-10-12 20:43:56,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-12 20:43:56,445 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 388 [2018-10-12 20:43:56,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:43:56,446 INFO L225 Difference]: With dead ends: 394 [2018-10-12 20:43:56,446 INFO L226 Difference]: Without dead ends: 394 [2018-10-12 20:43:56,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-12 20:43:56,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 394 states. [2018-10-12 20:43:56,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 394 to 392. [2018-10-12 20:43:56,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-12 20:43:56,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-12 20:43:56,450 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 388 [2018-10-12 20:43:56,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:43:56,450 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-12 20:43:56,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-12 20:43:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-12 20:43:56,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-12 20:43:56,452 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:43:56,452 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] [2018-10-12 20:43:56,452 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:43:56,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:43:56,453 INFO L82 PathProgramCache]: Analyzing trace with hash -595668000, now seen corresponding path program 92 times [2018-10-12 20:43:56,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:43:56,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:00,361 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-12 20:44:00,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:00,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-12 20:44:00,362 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-12 20:44:00,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-12 20:44:00,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-12 20:44:00,363 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 96 states. [2018-10-12 20:44:06,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:06,388 INFO L93 Difference]: Finished difference Result 397 states and 397 transitions. [2018-10-12 20:44:06,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:44:06,389 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 391 [2018-10-12 20:44:06,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:06,390 INFO L225 Difference]: With dead ends: 397 [2018-10-12 20:44:06,390 INFO L226 Difference]: Without dead ends: 397 [2018-10-12 20:44:06,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-12 20:44:06,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2018-10-12 20:44:06,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 395. [2018-10-12 20:44:06,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 395 states. [2018-10-12 20:44:06,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 395 transitions. [2018-10-12 20:44:06,394 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 395 transitions. Word has length 391 [2018-10-12 20:44:06,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:06,394 INFO L481 AbstractCegarLoop]: Abstraction has 395 states and 395 transitions. [2018-10-12 20:44:06,394 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-12 20:44:06,394 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 395 transitions. [2018-10-12 20:44:06,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2018-10-12 20:44:06,395 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:06,395 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] [2018-10-12 20:44:06,396 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:06,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:06,396 INFO L82 PathProgramCache]: Analyzing trace with hash -548983810, now seen corresponding path program 93 times [2018-10-12 20:44:06,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:10,436 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-12 20:44:10,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:44:10,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-12 20:44:10,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-12 20:44:10,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-12 20:44:10,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 20:44:10,438 INFO L87 Difference]: Start difference. First operand 395 states and 395 transitions. Second operand 97 states. [2018-10-12 20:44:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:16,692 INFO L93 Difference]: Finished difference Result 398 states and 398 transitions. [2018-10-12 20:44:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-12 20:44:16,692 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 394 [2018-10-12 20:44:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:16,693 INFO L225 Difference]: With dead ends: 398 [2018-10-12 20:44:16,694 INFO L226 Difference]: Without dead ends: 398 [2018-10-12 20:44:16,695 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-12 20:44:16,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-12 20:44:16,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 398. [2018-10-12 20:44:16,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-12 20:44:16,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-12 20:44:16,698 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 394 [2018-10-12 20:44:16,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:16,698 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-12 20:44:16,698 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-12 20:44:16,698 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-12 20:44:16,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-12 20:44:16,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:44:16,700 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] [2018-10-12 20:44:16,700 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:44:16,700 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:44:16,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1349683424, now seen corresponding path program 94 times [2018-10-12 20:44:16,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:44:16,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:44:18,604 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 16 [2018-10-12 20:44:19,000 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-12 20:44:19,000 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:44:19,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2018-10-12 20:44:19,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 20:44:19,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 20:44:19,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=375, Unknown=0, NotChecked=0, Total=420 [2018-10-12 20:44:19,002 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 21 states. [2018-10-12 20:44:20,169 WARN L178 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-12 20:44:22,034 WARN L178 SmtUtils]: Spent 188.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-12 20:44:22,660 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 70 [2018-10-12 20:44:22,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:44:22,837 INFO L93 Difference]: Finished difference Result 396 states and 396 transitions. [2018-10-12 20:44:22,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 20:44:22,837 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 397 [2018-10-12 20:44:22,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:44:22,838 INFO L225 Difference]: With dead ends: 396 [2018-10-12 20:44:22,838 INFO L226 Difference]: Without dead ends: 0 [2018-10-12 20:44:22,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 16 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 208 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=410, Invalid=1312, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:44:22,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-12 20:44:22,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-12 20:44:22,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-12 20:44:22,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-12 20:44:22,839 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 397 [2018-10-12 20:44:22,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:44:22,840 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-12 20:44:22,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 20:44:22,840 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-12 20:44:22,840 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-12 20:44:22,845 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_25.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 08:44:22 BoogieIcfgContainer [2018-10-12 20:44:22,845 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-12 20:44:22,846 INFO L168 Benchmark]: Toolchain (without parser) took 378823.79 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.5 GB in the beginning and 814.1 MB in the end (delta: 643.7 MB). Peak memory consumption was 885.9 MB. Max. memory is 7.1 GB. [2018-10-12 20:44:22,847 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 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-12 20:44:22,848 INFO L168 Benchmark]: Boogie Preprocessor took 66.36 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-12 20:44:22,848 INFO L168 Benchmark]: RCFGBuilder took 1158.73 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. [2018-10-12 20:44:22,849 INFO L168 Benchmark]: TraceAbstraction took 377593.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.4 GB in the beginning and 814.1 MB in the end (delta: 612.0 MB). Peak memory consumption was 854.2 MB. Max. memory is 7.1 GB. [2018-10-12 20:44:22,852 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.22 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 66.36 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 1158.73 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: 31.7 MB). Peak memory consumption was 31.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 377593.91 ms. Allocated memory was 1.5 GB in the beginning and 1.8 GB in the end (delta: 242.2 MB). Free memory was 1.4 GB in the beginning and 814.1 MB in the end (delta: 612.0 MB). Peak memory consumption was 854.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 188]: 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, 120 locations, 1 error locations. SAFE Result, 377.5s OverallTime, 95 OverallIterations, 94 TraceHistogramMax, 216.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 10573 SDtfs, 27458 SDslu, 371718 SDs, 0 SdLazy, 31689 SolverSat, 4732 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 31.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9176 GetRequests, 190 SyntacticMatches, 16 SemanticMatches, 8970 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 138623 ImplicationChecksByTransitivity, 322.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=398occurred 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.3s AutomataMinimizationTime, 95 MinimizatonAttempts, 186 StatesRemovedByMinimization, 93 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 151.5s InterpolantComputationTime, 24320 NumberOfCodeBlocks, 24320 NumberOfCodeBlocksAsserted, 95 NumberOfCheckSat, 24225 ConstructedInterpolants, 0 QuantifiedInterpolants, 24810555 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_25.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-12_20-44-22-863.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_25.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-12_20-44-22-863.csv Received shutdown request...