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_46.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:12:33,605 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:12:33,607 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:12:33,620 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:12:33,620 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:12:33,621 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:12:33,622 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:12:33,624 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:12:33,626 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:12:33,627 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:12:33,628 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:12:33,628 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:12:33,629 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:12:33,630 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:12:33,631 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:12:33,632 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:12:33,633 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:12:33,634 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:12:33,636 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:12:33,638 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:12:33,639 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:12:33,641 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:12:33,643 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:12:33,644 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:12:33,644 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:12:33,645 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:12:33,646 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:12:33,647 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:12:33,648 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:12:33,649 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:12:33,649 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:12:33,650 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:12:33,650 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:12:33,650 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:12:33,651 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:12:33,652 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:12:33,652 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-10 15:12:33,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:12:33,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:12:33,675 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:12:33,676 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:12:33,676 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:12:33,676 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:12:33,677 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:12:33,677 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:12:33,678 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:12:33,678 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:12:33,678 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:12:33,678 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:12:33,678 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:12:33,680 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:12:33,680 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:12:33,753 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:12:33,773 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:12:33,779 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:12:33,782 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:12:33,782 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:12:33,783 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_46.bpl [2018-10-10 15:12:33,783 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/20051113-1.c_false-valid-memtrack.i_46.bpl' [2018-10-10 15:12:33,895 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:12:33,898 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:12:33,899 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:12:33,899 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:12:33,899 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:12:33,927 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,929 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,954 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,955 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,979 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,981 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,984 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... [2018-10-10 15:12:33,990 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:12:33,991 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:12:33,991 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:12:33,991 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:12:33,992 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-10 15:12:34,082 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:12:34,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:12:34,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:12:35,066 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:12:35,067 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:12:35 BoogieIcfgContainer [2018-10-10 15:12:35,068 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:12:35,069 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:12:35,069 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:12:35,072 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:12:35,073 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:12:33" (1/2) ... [2018-10-10 15:12:35,074 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@634dc78d and model type 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:12:35, skipping insertion in model container [2018-10-10 15:12:35,074 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:12:35" (2/2) ... [2018-10-10 15:12:35,076 INFO L112 eAbstractionObserver]: Analyzing ICFG 20051113-1.c_false-valid-memtrack.i_46.bpl [2018-10-10 15:12:35,085 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:12:35,094 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:12:35,112 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:12:35,144 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:12:35,145 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:12:35,145 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:12:35,145 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:12:35,145 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:12:35,145 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:12:35,146 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:12:35,146 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:12:35,146 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:12:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states. [2018-10-10 15:12:35,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 15:12:35,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:35,185 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] [2018-10-10 15:12:35,187 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:35,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:35,193 INFO L82 PathProgramCache]: Analyzing trace with hash -940326312, now seen corresponding path program 1 times [2018-10-10 15:12:35,252 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:35,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:35,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:12:35,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:12:35,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:12:35,609 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:12:35,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:12:35,613 INFO L87 Difference]: Start difference. First operand 169 states. Second operand 4 states. [2018-10-10 15:12:35,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:35,733 INFO L93 Difference]: Finished difference Result 170 states and 171 transitions. [2018-10-10 15:12:35,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:12:35,735 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 105 [2018-10-10 15:12:35,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:35,749 INFO L225 Difference]: With dead ends: 170 [2018-10-10 15:12:35,749 INFO L226 Difference]: Without dead ends: 170 [2018-10-10 15:12:35,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:12:35,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-10 15:12:35,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 168. [2018-10-10 15:12:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:12:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 169 transitions. [2018-10-10 15:12:35,805 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 169 transitions. Word has length 105 [2018-10-10 15:12:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:35,806 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 169 transitions. [2018-10-10 15:12:35,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:12:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 169 transitions. [2018-10-10 15:12:35,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-10 15:12:35,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:35,812 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] [2018-10-10 15:12:35,812 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:35,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:35,813 INFO L82 PathProgramCache]: Analyzing trace with hash -2077211914, now seen corresponding path program 1 times [2018-10-10 15:12:35,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:36,028 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:36,029 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:36,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:12:36,031 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:12:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:12:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:12:36,032 INFO L87 Difference]: Start difference. First operand 168 states and 169 transitions. Second operand 5 states. [2018-10-10 15:12:36,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:36,182 INFO L93 Difference]: Finished difference Result 173 states and 174 transitions. [2018-10-10 15:12:36,183 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:12:36,183 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 108 [2018-10-10 15:12:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:36,187 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:12:36,187 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:12:36,189 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:12:36,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:12:36,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 171. [2018-10-10 15:12:36,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-10 15:12:36,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 172 transitions. [2018-10-10 15:12:36,204 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 172 transitions. Word has length 108 [2018-10-10 15:12:36,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:36,205 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 172 transitions. [2018-10-10 15:12:36,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:12:36,205 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 172 transitions. [2018-10-10 15:12:36,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 15:12:36,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:36,210 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] [2018-10-10 15:12:36,210 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:36,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:36,211 INFO L82 PathProgramCache]: Analyzing trace with hash -924084840, now seen corresponding path program 2 times [2018-10-10 15:12:36,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:36,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:36,386 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:36,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:36,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:12:36,387 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:12:36,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:12:36,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:12:36,388 INFO L87 Difference]: Start difference. First operand 171 states and 172 transitions. Second operand 6 states. [2018-10-10 15:12:36,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:36,524 INFO L93 Difference]: Finished difference Result 176 states and 177 transitions. [2018-10-10 15:12:36,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:12:36,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 111 [2018-10-10 15:12:36,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:36,531 INFO L225 Difference]: With dead ends: 176 [2018-10-10 15:12:36,531 INFO L226 Difference]: Without dead ends: 176 [2018-10-10 15:12:36,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:12:36,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-10 15:12:36,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 174. [2018-10-10 15:12:36,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:12:36,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 175 transitions. [2018-10-10 15:12:36,548 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 175 transitions. Word has length 111 [2018-10-10 15:12:36,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:36,549 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 175 transitions. [2018-10-10 15:12:36,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:12:36,549 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 175 transitions. [2018-10-10 15:12:36,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-10 15:12:36,551 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:36,551 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] [2018-10-10 15:12:36,552 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:36,552 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:36,552 INFO L82 PathProgramCache]: Analyzing trace with hash 736143286, now seen corresponding path program 3 times [2018-10-10 15:12:36,553 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:36,745 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:36,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:36,746 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:12:36,746 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:12:36,747 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:12:36,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:12:36,748 INFO L87 Difference]: Start difference. First operand 174 states and 175 transitions. Second operand 7 states. [2018-10-10 15:12:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:37,422 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-10-10 15:12:37,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:12:37,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 114 [2018-10-10 15:12:37,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:37,425 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:12:37,426 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:12:37,426 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:37,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:12:37,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 177. [2018-10-10 15:12:37,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-10 15:12:37,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 178 transitions. [2018-10-10 15:12:37,435 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 178 transitions. Word has length 114 [2018-10-10 15:12:37,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:37,436 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 178 transitions. [2018-10-10 15:12:37,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:12:37,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 178 transitions. [2018-10-10 15:12:37,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 15:12:37,442 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:37,442 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] [2018-10-10 15:12:37,442 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:37,443 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:37,443 INFO L82 PathProgramCache]: Analyzing trace with hash -251135784, now seen corresponding path program 4 times [2018-10-10 15:12:37,444 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:37,819 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:37,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:37,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:12:37,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:12:37,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:12:37,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:12:37,821 INFO L87 Difference]: Start difference. First operand 177 states and 178 transitions. Second operand 8 states. [2018-10-10 15:12:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:37,995 INFO L93 Difference]: Finished difference Result 182 states and 183 transitions. [2018-10-10 15:12:37,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:12:37,996 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 117 [2018-10-10 15:12:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:37,998 INFO L225 Difference]: With dead ends: 182 [2018-10-10 15:12:37,998 INFO L226 Difference]: Without dead ends: 182 [2018-10-10 15:12:37,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:12:37,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-10 15:12:38,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 180. [2018-10-10 15:12:38,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:12:38,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 181 transitions. [2018-10-10 15:12:38,017 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 181 transitions. Word has length 117 [2018-10-10 15:12:38,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:38,018 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 181 transitions. [2018-10-10 15:12:38,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:12:38,018 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 181 transitions. [2018-10-10 15:12:38,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-10 15:12:38,023 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:38,024 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] [2018-10-10 15:12:38,024 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:38,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:38,025 INFO L82 PathProgramCache]: Analyzing trace with hash -345867146, now seen corresponding path program 5 times [2018-10-10 15:12:38,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:38,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:38,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:38,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:12:38,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:12:38,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:12:38,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:12:38,472 INFO L87 Difference]: Start difference. First operand 180 states and 181 transitions. Second operand 9 states. [2018-10-10 15:12:38,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:38,670 INFO L93 Difference]: Finished difference Result 185 states and 186 transitions. [2018-10-10 15:12:38,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:12:38,671 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 120 [2018-10-10 15:12:38,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:38,673 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:12:38,673 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:12:38,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:12:38,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:12:38,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 183. [2018-10-10 15:12:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-10 15:12:38,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 184 transitions. [2018-10-10 15:12:38,679 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 184 transitions. Word has length 120 [2018-10-10 15:12:38,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:38,680 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 184 transitions. [2018-10-10 15:12:38,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:12:38,680 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 184 transitions. [2018-10-10 15:12:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 15:12:38,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:38,682 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] [2018-10-10 15:12:38,683 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:38,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:38,683 INFO L82 PathProgramCache]: Analyzing trace with hash -694359016, now seen corresponding path program 6 times [2018-10-10 15:12:38,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:38,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:38,908 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:38,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:38,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:12:38,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:12:38,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:12:38,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:12:38,911 INFO L87 Difference]: Start difference. First operand 183 states and 184 transitions. Second operand 10 states. [2018-10-10 15:12:39,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:39,070 INFO L93 Difference]: Finished difference Result 188 states and 189 transitions. [2018-10-10 15:12:39,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:12:39,077 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 123 [2018-10-10 15:12:39,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:39,079 INFO L225 Difference]: With dead ends: 188 [2018-10-10 15:12:39,079 INFO L226 Difference]: Without dead ends: 188 [2018-10-10 15:12:39,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-10 15:12:39,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 186. [2018-10-10 15:12:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:12:39,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 187 transitions. [2018-10-10 15:12:39,085 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 187 transitions. Word has length 123 [2018-10-10 15:12:39,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:39,086 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 187 transitions. [2018-10-10 15:12:39,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:12:39,086 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 187 transitions. [2018-10-10 15:12:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-10 15:12:39,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:39,089 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] [2018-10-10 15:12:39,090 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:39,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:39,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1679703754, now seen corresponding path program 7 times [2018-10-10 15:12:39,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:39,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:39,365 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:39,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:39,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:12:39,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:12:39,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:12:39,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:12:39,367 INFO L87 Difference]: Start difference. First operand 186 states and 187 transitions. Second operand 11 states. [2018-10-10 15:12:39,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:39,787 INFO L93 Difference]: Finished difference Result 191 states and 192 transitions. [2018-10-10 15:12:39,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:12:39,787 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 126 [2018-10-10 15:12:39,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:39,789 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:12:39,789 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:12:39,790 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-10 15:12:39,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:12:39,793 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 189. [2018-10-10 15:12:39,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-10 15:12:39,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 190 transitions. [2018-10-10 15:12:39,794 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 190 transitions. Word has length 126 [2018-10-10 15:12:39,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:39,795 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 190 transitions. [2018-10-10 15:12:39,795 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:12:39,795 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 190 transitions. [2018-10-10 15:12:39,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 15:12:39,796 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:39,797 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] [2018-10-10 15:12:39,797 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:39,797 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:39,797 INFO L82 PathProgramCache]: Analyzing trace with hash 16674648, now seen corresponding path program 8 times [2018-10-10 15:12:39,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 0 proven. 92 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:40,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:40,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:12:40,092 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:12:40,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:12:40,093 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:12:40,093 INFO L87 Difference]: Start difference. First operand 189 states and 190 transitions. Second operand 12 states. [2018-10-10 15:12:40,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:40,313 INFO L93 Difference]: Finished difference Result 194 states and 195 transitions. [2018-10-10 15:12:40,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:12:40,314 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 129 [2018-10-10 15:12:40,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:40,315 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:12:40,315 INFO L226 Difference]: Without dead ends: 194 [2018-10-10 15:12:40,316 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:12:40,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-10 15:12:40,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 192. [2018-10-10 15:12:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:12:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 193 transitions. [2018-10-10 15:12:40,321 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 193 transitions. Word has length 129 [2018-10-10 15:12:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:40,321 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 193 transitions. [2018-10-10 15:12:40,321 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:12:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 193 transitions. [2018-10-10 15:12:40,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-10 15:12:40,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:40,323 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] [2018-10-10 15:12:40,324 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:40,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:40,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2054523402, now seen corresponding path program 9 times [2018-10-10 15:12:40,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:41,419 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 0 proven. 117 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:41,419 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:41,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:12:41,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:12:41,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:12:41,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:12:41,421 INFO L87 Difference]: Start difference. First operand 192 states and 193 transitions. Second operand 13 states. [2018-10-10 15:12:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:41,610 INFO L93 Difference]: Finished difference Result 197 states and 198 transitions. [2018-10-10 15:12:41,610 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:12:41,610 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 132 [2018-10-10 15:12:41,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:41,611 INFO L225 Difference]: With dead ends: 197 [2018-10-10 15:12:41,612 INFO L226 Difference]: Without dead ends: 197 [2018-10-10 15:12:41,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:12:41,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-10 15:12:41,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 195. [2018-10-10 15:12:41,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-10 15:12:41,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 196 transitions. [2018-10-10 15:12:41,617 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 196 transitions. Word has length 132 [2018-10-10 15:12:41,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:41,617 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 196 transitions. [2018-10-10 15:12:41,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:12:41,618 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 196 transitions. [2018-10-10 15:12:41,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 15:12:41,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:41,620 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] [2018-10-10 15:12:41,620 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:41,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:41,620 INFO L82 PathProgramCache]: Analyzing trace with hash 679510680, now seen corresponding path program 10 times [2018-10-10 15:12:41,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:41,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 0 proven. 145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:41,904 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:41,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:12:41,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:12:41,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:12:41,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:12:41,905 INFO L87 Difference]: Start difference. First operand 195 states and 196 transitions. Second operand 14 states. [2018-10-10 15:12:42,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:42,244 INFO L93 Difference]: Finished difference Result 200 states and 201 transitions. [2018-10-10 15:12:42,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:12:42,246 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 135 [2018-10-10 15:12:42,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:42,247 INFO L225 Difference]: With dead ends: 200 [2018-10-10 15:12:42,247 INFO L226 Difference]: Without dead ends: 200 [2018-10-10 15:12:42,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:12:42,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-10 15:12:42,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 198. [2018-10-10 15:12:42,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 198 states. [2018-10-10 15:12:42,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 199 transitions. [2018-10-10 15:12:42,253 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 199 transitions. Word has length 135 [2018-10-10 15:12:42,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:42,253 INFO L481 AbstractCegarLoop]: Abstraction has 198 states and 199 transitions. [2018-10-10 15:12:42,253 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:12:42,253 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 199 transitions. [2018-10-10 15:12:42,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-10 15:12:42,256 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:42,256 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] [2018-10-10 15:12:42,257 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:42,257 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:42,257 INFO L82 PathProgramCache]: Analyzing trace with hash 529046198, now seen corresponding path program 11 times [2018-10-10 15:12:42,258 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:42,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:42,531 INFO L134 CoverageAnalysis]: Checked inductivity of 176 backedges. 0 proven. 176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:42,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:42,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:12:42,532 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:12:42,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:12:42,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:12:42,532 INFO L87 Difference]: Start difference. First operand 198 states and 199 transitions. Second operand 15 states. [2018-10-10 15:12:43,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:43,224 INFO L93 Difference]: Finished difference Result 203 states and 204 transitions. [2018-10-10 15:12:43,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:12:43,225 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 138 [2018-10-10 15:12:43,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:43,227 INFO L225 Difference]: With dead ends: 203 [2018-10-10 15:12:43,227 INFO L226 Difference]: Without dead ends: 203 [2018-10-10 15:12:43,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:12:43,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-10 15:12:43,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 201. [2018-10-10 15:12:43,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-10 15:12:43,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 202 transitions. [2018-10-10 15:12:43,233 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 202 transitions. Word has length 138 [2018-10-10 15:12:43,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:43,233 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 202 transitions. [2018-10-10 15:12:43,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:12:43,233 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 202 transitions. [2018-10-10 15:12:43,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-10 15:12:43,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:43,234 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] [2018-10-10 15:12:43,234 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:43,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:43,235 INFO L82 PathProgramCache]: Analyzing trace with hash 1987519960, now seen corresponding path program 12 times [2018-10-10 15:12:43,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:43,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:43,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:43,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:12:43,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:12:43,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:12:43,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:12:43,507 INFO L87 Difference]: Start difference. First operand 201 states and 202 transitions. Second operand 16 states. [2018-10-10 15:12:43,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:43,791 INFO L93 Difference]: Finished difference Result 206 states and 207 transitions. [2018-10-10 15:12:43,791 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:12:43,791 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 141 [2018-10-10 15:12:43,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:43,793 INFO L225 Difference]: With dead ends: 206 [2018-10-10 15:12:43,793 INFO L226 Difference]: Without dead ends: 206 [2018-10-10 15:12:43,793 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-10 15:12:43,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-10 15:12:43,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 204. [2018-10-10 15:12:43,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 204 states. [2018-10-10 15:12:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 205 transitions. [2018-10-10 15:12:43,798 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 205 transitions. Word has length 141 [2018-10-10 15:12:43,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:43,799 INFO L481 AbstractCegarLoop]: Abstraction has 204 states and 205 transitions. [2018-10-10 15:12:43,799 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:12:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 205 transitions. [2018-10-10 15:12:43,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-10 15:12:43,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:43,800 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] [2018-10-10 15:12:43,800 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:43,800 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:43,801 INFO L82 PathProgramCache]: Analyzing trace with hash -804769930, now seen corresponding path program 13 times [2018-10-10 15:12:43,801 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:43,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:44,086 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:44,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:44,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:12:44,087 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:12:44,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:12:44,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:12:44,088 INFO L87 Difference]: Start difference. First operand 204 states and 205 transitions. Second operand 17 states. [2018-10-10 15:12:44,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:44,515 INFO L93 Difference]: Finished difference Result 209 states and 210 transitions. [2018-10-10 15:12:44,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:12:44,516 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 144 [2018-10-10 15:12:44,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:44,517 INFO L225 Difference]: With dead ends: 209 [2018-10-10 15:12:44,517 INFO L226 Difference]: Without dead ends: 209 [2018-10-10 15:12:44,518 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:12:44,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-10 15:12:44,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 207. [2018-10-10 15:12:44,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-10 15:12:44,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 208 transitions. [2018-10-10 15:12:44,522 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 208 transitions. Word has length 144 [2018-10-10 15:12:44,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:44,522 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 208 transitions. [2018-10-10 15:12:44,522 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:12:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 208 transitions. [2018-10-10 15:12:44,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 15:12:44,523 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:44,523 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] [2018-10-10 15:12:44,524 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:44,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:44,524 INFO L82 PathProgramCache]: Analyzing trace with hash -986293992, now seen corresponding path program 14 times [2018-10-10 15:12:44,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:44,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 287 backedges. 0 proven. 287 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:44,902 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:44,902 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:12:44,902 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:12:44,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:12:44,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:12:44,903 INFO L87 Difference]: Start difference. First operand 207 states and 208 transitions. Second operand 18 states. [2018-10-10 15:12:45,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:45,321 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-10-10 15:12:45,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:12:45,321 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 147 [2018-10-10 15:12:45,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:45,322 INFO L225 Difference]: With dead ends: 212 [2018-10-10 15:12:45,323 INFO L226 Difference]: Without dead ends: 212 [2018-10-10 15:12:45,323 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:12:45,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-10 15:12:45,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 210. [2018-10-10 15:12:45,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 210 states. [2018-10-10 15:12:45,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 211 transitions. [2018-10-10 15:12:45,331 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 211 transitions. Word has length 147 [2018-10-10 15:12:45,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:45,331 INFO L481 AbstractCegarLoop]: Abstraction has 210 states and 211 transitions. [2018-10-10 15:12:45,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:12:45,331 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 211 transitions. [2018-10-10 15:12:45,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-10 15:12:45,332 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:45,332 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] [2018-10-10 15:12:45,333 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:45,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:45,333 INFO L82 PathProgramCache]: Analyzing trace with hash -1405799370, now seen corresponding path program 15 times [2018-10-10 15:12:45,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:45,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:45,912 INFO L134 CoverageAnalysis]: Checked inductivity of 330 backedges. 0 proven. 330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:45,913 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:45,913 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:12:45,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:12:45,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:12:45,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:12:45,914 INFO L87 Difference]: Start difference. First operand 210 states and 211 transitions. Second operand 19 states. [2018-10-10 15:12:46,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:46,518 INFO L93 Difference]: Finished difference Result 215 states and 216 transitions. [2018-10-10 15:12:46,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:12:46,519 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 150 [2018-10-10 15:12:46,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:46,520 INFO L225 Difference]: With dead ends: 215 [2018-10-10 15:12:46,520 INFO L226 Difference]: Without dead ends: 215 [2018-10-10 15:12:46,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:12:46,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-10 15:12:46,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 213. [2018-10-10 15:12:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-10 15:12:46,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 214 transitions. [2018-10-10 15:12:46,525 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 214 transitions. Word has length 150 [2018-10-10 15:12:46,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:46,525 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 214 transitions. [2018-10-10 15:12:46,525 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:12:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 214 transitions. [2018-10-10 15:12:46,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 15:12:46,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:46,527 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] [2018-10-10 15:12:46,527 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:46,527 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:46,527 INFO L82 PathProgramCache]: Analyzing trace with hash -535684008, now seen corresponding path program 16 times [2018-10-10 15:12:46,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:46,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:47,331 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 0 proven. 376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:47,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:47,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:12:47,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:12:47,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:12:47,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:12:47,333 INFO L87 Difference]: Start difference. First operand 213 states and 214 transitions. Second operand 20 states. [2018-10-10 15:12:47,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:47,696 INFO L93 Difference]: Finished difference Result 218 states and 219 transitions. [2018-10-10 15:12:47,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:12:47,697 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 153 [2018-10-10 15:12:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:47,698 INFO L225 Difference]: With dead ends: 218 [2018-10-10 15:12:47,698 INFO L226 Difference]: Without dead ends: 218 [2018-10-10 15:12:47,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:12:47,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-10 15:12:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 216. [2018-10-10 15:12:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-10 15:12:47,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 217 transitions. [2018-10-10 15:12:47,702 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 217 transitions. Word has length 153 [2018-10-10 15:12:47,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:47,702 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 217 transitions. [2018-10-10 15:12:47,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:12:47,703 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 217 transitions. [2018-10-10 15:12:47,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-10 15:12:47,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:47,704 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] [2018-10-10 15:12:47,704 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:47,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:47,704 INFO L82 PathProgramCache]: Analyzing trace with hash 943433974, now seen corresponding path program 17 times [2018-10-10 15:12:47,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:47,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:48,006 INFO L134 CoverageAnalysis]: Checked inductivity of 425 backedges. 0 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:48,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:48,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:12:48,007 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:12:48,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:12:48,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:12:48,007 INFO L87 Difference]: Start difference. First operand 216 states and 217 transitions. Second operand 21 states. [2018-10-10 15:12:48,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:48,464 INFO L93 Difference]: Finished difference Result 221 states and 222 transitions. [2018-10-10 15:12:48,464 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:12:48,465 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 156 [2018-10-10 15:12:48,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:48,466 INFO L225 Difference]: With dead ends: 221 [2018-10-10 15:12:48,466 INFO L226 Difference]: Without dead ends: 221 [2018-10-10 15:12:48,467 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:12:48,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-10 15:12:48,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 219. [2018-10-10 15:12:48,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-10 15:12:48,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 220 transitions. [2018-10-10 15:12:48,471 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 220 transitions. Word has length 156 [2018-10-10 15:12:48,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:48,472 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 220 transitions. [2018-10-10 15:12:48,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:12:48,472 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 220 transitions. [2018-10-10 15:12:48,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 15:12:48,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:48,473 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] [2018-10-10 15:12:48,473 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:48,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:48,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1017221224, now seen corresponding path program 18 times [2018-10-10 15:12:48,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:48,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:48,918 INFO L134 CoverageAnalysis]: Checked inductivity of 477 backedges. 0 proven. 477 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:48,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:48,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:12:48,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:12:48,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:12:48,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:12:48,920 INFO L87 Difference]: Start difference. First operand 219 states and 220 transitions. Second operand 22 states. [2018-10-10 15:12:49,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:49,986 INFO L93 Difference]: Finished difference Result 224 states and 225 transitions. [2018-10-10 15:12:49,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:12:49,987 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 159 [2018-10-10 15:12:49,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:49,987 INFO L225 Difference]: With dead ends: 224 [2018-10-10 15:12:49,988 INFO L226 Difference]: Without dead ends: 224 [2018-10-10 15:12:49,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:12:49,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-10 15:12:49,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 222. [2018-10-10 15:12:49,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-10 15:12:49,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 223 transitions. [2018-10-10 15:12:49,992 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 223 transitions. Word has length 159 [2018-10-10 15:12:49,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:49,993 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 223 transitions. [2018-10-10 15:12:49,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:12:49,993 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 223 transitions. [2018-10-10 15:12:49,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-10 15:12:49,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:49,993 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] [2018-10-10 15:12:49,994 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:49,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:49,994 INFO L82 PathProgramCache]: Analyzing trace with hash 659000758, now seen corresponding path program 19 times [2018-10-10 15:12:49,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:50,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:50,915 INFO L134 CoverageAnalysis]: Checked inductivity of 532 backedges. 0 proven. 532 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:50,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:50,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:12:50,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:12:50,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:12:50,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:12:50,917 INFO L87 Difference]: Start difference. First operand 222 states and 223 transitions. Second operand 23 states. [2018-10-10 15:12:51,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:51,681 INFO L93 Difference]: Finished difference Result 227 states and 228 transitions. [2018-10-10 15:12:51,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:12:51,682 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 162 [2018-10-10 15:12:51,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:51,683 INFO L225 Difference]: With dead ends: 227 [2018-10-10 15:12:51,683 INFO L226 Difference]: Without dead ends: 227 [2018-10-10 15:12:51,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:12:51,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-10 15:12:51,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 225. [2018-10-10 15:12:51,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-10 15:12:51,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 226 transitions. [2018-10-10 15:12:51,689 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 226 transitions. Word has length 162 [2018-10-10 15:12:51,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:51,690 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 226 transitions. [2018-10-10 15:12:51,690 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:12:51,690 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 226 transitions. [2018-10-10 15:12:51,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 15:12:51,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:51,691 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] [2018-10-10 15:12:51,692 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:51,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:51,692 INFO L82 PathProgramCache]: Analyzing trace with hash -596684072, now seen corresponding path program 20 times [2018-10-10 15:12:51,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:51,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:52,374 INFO L134 CoverageAnalysis]: Checked inductivity of 590 backedges. 0 proven. 590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:52,375 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:52,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:12:52,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:12:52,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:12:52,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:12:52,376 INFO L87 Difference]: Start difference. First operand 225 states and 226 transitions. Second operand 24 states. [2018-10-10 15:12:52,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:52,878 INFO L93 Difference]: Finished difference Result 230 states and 231 transitions. [2018-10-10 15:12:52,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:12:52,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 165 [2018-10-10 15:12:52,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:52,879 INFO L225 Difference]: With dead ends: 230 [2018-10-10 15:12:52,879 INFO L226 Difference]: Without dead ends: 230 [2018-10-10 15:12:52,880 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:12:52,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-10 15:12:52,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 228. [2018-10-10 15:12:52,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 228 states. [2018-10-10 15:12:52,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 229 transitions. [2018-10-10 15:12:52,884 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 229 transitions. Word has length 165 [2018-10-10 15:12:52,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:52,884 INFO L481 AbstractCegarLoop]: Abstraction has 228 states and 229 transitions. [2018-10-10 15:12:52,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:12:52,885 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 229 transitions. [2018-10-10 15:12:52,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-10 15:12:52,885 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:52,886 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] [2018-10-10 15:12:52,886 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:52,886 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:52,886 INFO L82 PathProgramCache]: Analyzing trace with hash 461693558, now seen corresponding path program 21 times [2018-10-10 15:12:52,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:54,278 INFO L134 CoverageAnalysis]: Checked inductivity of 651 backedges. 0 proven. 651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:54,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:54,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:12:54,279 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:12:54,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:12:54,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:12:54,279 INFO L87 Difference]: Start difference. First operand 228 states and 229 transitions. Second operand 25 states. [2018-10-10 15:12:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:54,867 INFO L93 Difference]: Finished difference Result 233 states and 234 transitions. [2018-10-10 15:12:54,868 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:12:54,868 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 168 [2018-10-10 15:12:54,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:54,869 INFO L225 Difference]: With dead ends: 233 [2018-10-10 15:12:54,870 INFO L226 Difference]: Without dead ends: 233 [2018-10-10 15:12:54,870 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:12:54,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-10 15:12:54,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 231. [2018-10-10 15:12:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-10 15:12:54,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-10 15:12:54,874 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 168 [2018-10-10 15:12:54,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:54,874 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-10 15:12:54,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:12:54,875 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-10 15:12:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-10 15:12:54,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:54,876 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] [2018-10-10 15:12:54,876 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:54,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:54,876 INFO L82 PathProgramCache]: Analyzing trace with hash 1234748952, now seen corresponding path program 22 times [2018-10-10 15:12:54,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:54,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:55,446 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:55,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:55,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:12:55,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:12:55,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:12:55,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:12:55,448 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 26 states. [2018-10-10 15:12:56,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:56,039 INFO L93 Difference]: Finished difference Result 236 states and 237 transitions. [2018-10-10 15:12:56,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:12:56,039 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 171 [2018-10-10 15:12:56,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:56,040 INFO L225 Difference]: With dead ends: 236 [2018-10-10 15:12:56,040 INFO L226 Difference]: Without dead ends: 236 [2018-10-10 15:12:56,041 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:12:56,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-10 15:12:56,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 234. [2018-10-10 15:12:56,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 234 states. [2018-10-10 15:12:56,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 235 transitions. [2018-10-10 15:12:56,045 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 235 transitions. Word has length 171 [2018-10-10 15:12:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:56,045 INFO L481 AbstractCegarLoop]: Abstraction has 234 states and 235 transitions. [2018-10-10 15:12:56,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:12:56,046 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 235 transitions. [2018-10-10 15:12:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-10 15:12:56,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:56,047 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] [2018-10-10 15:12:56,047 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:56,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:56,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1713350454, now seen corresponding path program 23 times [2018-10-10 15:12:56,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:56,545 INFO L134 CoverageAnalysis]: Checked inductivity of 782 backedges. 0 proven. 782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:56,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:56,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:12:56,546 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:12:56,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:12:56,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:12:56,547 INFO L87 Difference]: Start difference. First operand 234 states and 235 transitions. Second operand 27 states. [2018-10-10 15:12:57,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:57,246 INFO L93 Difference]: Finished difference Result 239 states and 240 transitions. [2018-10-10 15:12:57,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:12:57,246 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 174 [2018-10-10 15:12:57,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:57,247 INFO L225 Difference]: With dead ends: 239 [2018-10-10 15:12:57,247 INFO L226 Difference]: Without dead ends: 239 [2018-10-10 15:12:57,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:12:57,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-10 15:12:57,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 237. [2018-10-10 15:12:57,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-10 15:12:57,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-10-10 15:12:57,252 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 174 [2018-10-10 15:12:57,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:57,252 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-10-10 15:12:57,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:12:57,253 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-10-10 15:12:57,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 15:12:57,254 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:57,254 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] [2018-10-10 15:12:57,254 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:57,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:57,254 INFO L82 PathProgramCache]: Analyzing trace with hash 439273816, now seen corresponding path program 24 times [2018-10-10 15:12:57,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:57,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:58,015 INFO L134 CoverageAnalysis]: Checked inductivity of 852 backedges. 0 proven. 852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:58,016 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:58,016 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:12:58,016 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:12:58,017 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:12:58,017 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:12:58,017 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 28 states. [2018-10-10 15:12:58,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:12:58,644 INFO L93 Difference]: Finished difference Result 242 states and 243 transitions. [2018-10-10 15:12:58,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:12:58,644 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 177 [2018-10-10 15:12:58,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:12:58,645 INFO L225 Difference]: With dead ends: 242 [2018-10-10 15:12:58,645 INFO L226 Difference]: Without dead ends: 242 [2018-10-10 15:12:58,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:12:58,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-10 15:12:58,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 240. [2018-10-10 15:12:58,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2018-10-10 15:12:58,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 241 transitions. [2018-10-10 15:12:58,649 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 241 transitions. Word has length 177 [2018-10-10 15:12:58,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:12:58,650 INFO L481 AbstractCegarLoop]: Abstraction has 240 states and 241 transitions. [2018-10-10 15:12:58,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:12:58,650 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 241 transitions. [2018-10-10 15:12:58,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-10 15:12:58,651 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:12:58,651 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] [2018-10-10 15:12:58,651 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:12:58,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:12:58,652 INFO L82 PathProgramCache]: Analyzing trace with hash -951854090, now seen corresponding path program 25 times [2018-10-10 15:12:58,652 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:12:58,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:12:59,685 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 0 proven. 925 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:12:59,686 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:12:59,686 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:12:59,686 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:12:59,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:12:59,687 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:12:59,687 INFO L87 Difference]: Start difference. First operand 240 states and 241 transitions. Second operand 29 states. [2018-10-10 15:13:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:00,395 INFO L93 Difference]: Finished difference Result 245 states and 246 transitions. [2018-10-10 15:13:00,395 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:13:00,395 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 180 [2018-10-10 15:13:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:00,396 INFO L225 Difference]: With dead ends: 245 [2018-10-10 15:13:00,396 INFO L226 Difference]: Without dead ends: 245 [2018-10-10 15:13:00,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:13:00,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-10 15:13:00,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 243. [2018-10-10 15:13:00,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-10 15:13:00,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-10 15:13:00,401 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 180 [2018-10-10 15:13:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:00,401 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-10 15:13:00,401 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:13:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-10 15:13:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 15:13:00,402 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:00,403 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] [2018-10-10 15:13:00,403 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:00,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:00,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1903862632, now seen corresponding path program 26 times [2018-10-10 15:13:00,404 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:00,899 INFO L134 CoverageAnalysis]: Checked inductivity of 1001 backedges. 0 proven. 1001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:00,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:00,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:13:00,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:13:00,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:13:00,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:13:00,900 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 30 states. [2018-10-10 15:13:01,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:01,972 INFO L93 Difference]: Finished difference Result 248 states and 249 transitions. [2018-10-10 15:13:01,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:13:01,973 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 183 [2018-10-10 15:13:01,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:01,974 INFO L225 Difference]: With dead ends: 248 [2018-10-10 15:13:01,974 INFO L226 Difference]: Without dead ends: 248 [2018-10-10 15:13:01,975 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:13:01,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-10 15:13:01,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 246. [2018-10-10 15:13:01,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-10 15:13:01,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 247 transitions. [2018-10-10 15:13:01,979 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 247 transitions. Word has length 183 [2018-10-10 15:13:01,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:01,980 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 247 transitions. [2018-10-10 15:13:01,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:13:01,980 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 247 transitions. [2018-10-10 15:13:01,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-10 15:13:01,981 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:01,981 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] [2018-10-10 15:13:01,981 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:01,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:01,982 INFO L82 PathProgramCache]: Analyzing trace with hash 773685430, now seen corresponding path program 27 times [2018-10-10 15:13:01,982 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:01,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:02,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:02,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:02,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:13:02,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:13:02,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:13:02,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:13:02,623 INFO L87 Difference]: Start difference. First operand 246 states and 247 transitions. Second operand 31 states. [2018-10-10 15:13:03,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:03,384 INFO L93 Difference]: Finished difference Result 251 states and 252 transitions. [2018-10-10 15:13:03,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:13:03,384 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 186 [2018-10-10 15:13:03,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:03,386 INFO L225 Difference]: With dead ends: 251 [2018-10-10 15:13:03,386 INFO L226 Difference]: Without dead ends: 251 [2018-10-10 15:13:03,387 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:13:03,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-10 15:13:03,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 249. [2018-10-10 15:13:03,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-10 15:13:03,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 250 transitions. [2018-10-10 15:13:03,391 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 250 transitions. Word has length 186 [2018-10-10 15:13:03,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:03,391 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 250 transitions. [2018-10-10 15:13:03,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:13:03,391 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 250 transitions. [2018-10-10 15:13:03,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 15:13:03,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:03,393 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] [2018-10-10 15:13:03,393 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:03,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:03,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1475379160, now seen corresponding path program 28 times [2018-10-10 15:13:03,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:04,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1162 backedges. 0 proven. 1162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:04,489 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:04,489 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:13:04,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:13:04,490 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:13:04,490 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:13:04,491 INFO L87 Difference]: Start difference. First operand 249 states and 250 transitions. Second operand 32 states. [2018-10-10 15:13:05,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:05,477 INFO L93 Difference]: Finished difference Result 254 states and 255 transitions. [2018-10-10 15:13:05,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:13:05,477 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 189 [2018-10-10 15:13:05,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:05,479 INFO L225 Difference]: With dead ends: 254 [2018-10-10 15:13:05,479 INFO L226 Difference]: Without dead ends: 254 [2018-10-10 15:13:05,480 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:13:05,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-10 15:13:05,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 252. [2018-10-10 15:13:05,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 252 states. [2018-10-10 15:13:05,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 253 transitions. [2018-10-10 15:13:05,486 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 253 transitions. Word has length 189 [2018-10-10 15:13:05,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:05,486 INFO L481 AbstractCegarLoop]: Abstraction has 252 states and 253 transitions. [2018-10-10 15:13:05,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:13:05,486 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 253 transitions. [2018-10-10 15:13:05,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-10 15:13:05,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:05,487 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] [2018-10-10 15:13:05,488 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:05,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:05,488 INFO L82 PathProgramCache]: Analyzing trace with hash 2027459958, now seen corresponding path program 29 times [2018-10-10 15:13:05,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:05,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:06,156 INFO L134 CoverageAnalysis]: Checked inductivity of 1247 backedges. 0 proven. 1247 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:06,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:06,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:13:06,157 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:13:06,157 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:13:06,157 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:13:06,157 INFO L87 Difference]: Start difference. First operand 252 states and 253 transitions. Second operand 33 states. [2018-10-10 15:13:07,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:07,299 INFO L93 Difference]: Finished difference Result 257 states and 258 transitions. [2018-10-10 15:13:07,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:13:07,300 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 192 [2018-10-10 15:13:07,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:07,301 INFO L225 Difference]: With dead ends: 257 [2018-10-10 15:13:07,301 INFO L226 Difference]: Without dead ends: 257 [2018-10-10 15:13:07,303 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:13:07,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-10 15:13:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 255. [2018-10-10 15:13:07,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-10 15:13:07,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 256 transitions. [2018-10-10 15:13:07,307 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 256 transitions. Word has length 192 [2018-10-10 15:13:07,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:07,307 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 256 transitions. [2018-10-10 15:13:07,307 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:13:07,307 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 256 transitions. [2018-10-10 15:13:07,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-10 15:13:07,308 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:07,308 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] [2018-10-10 15:13:07,309 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:07,309 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:07,309 INFO L82 PathProgramCache]: Analyzing trace with hash -658230504, now seen corresponding path program 30 times [2018-10-10 15:13:07,310 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:07,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:07,955 INFO L134 CoverageAnalysis]: Checked inductivity of 1335 backedges. 0 proven. 1335 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:07,955 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:07,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:13:07,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:13:07,956 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:13:07,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:13:07,956 INFO L87 Difference]: Start difference. First operand 255 states and 256 transitions. Second operand 34 states. [2018-10-10 15:13:08,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:08,858 INFO L93 Difference]: Finished difference Result 260 states and 261 transitions. [2018-10-10 15:13:08,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:13:08,859 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 195 [2018-10-10 15:13:08,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:08,860 INFO L225 Difference]: With dead ends: 260 [2018-10-10 15:13:08,860 INFO L226 Difference]: Without dead ends: 260 [2018-10-10 15:13:08,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:13:08,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-10 15:13:08,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 258. [2018-10-10 15:13:08,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 258 states. [2018-10-10 15:13:08,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 259 transitions. [2018-10-10 15:13:08,866 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 259 transitions. Word has length 195 [2018-10-10 15:13:08,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:08,866 INFO L481 AbstractCegarLoop]: Abstraction has 258 states and 259 transitions. [2018-10-10 15:13:08,866 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:13:08,866 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 259 transitions. [2018-10-10 15:13:08,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-10 15:13:08,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:08,868 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] [2018-10-10 15:13:08,868 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:08,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:08,869 INFO L82 PathProgramCache]: Analyzing trace with hash 882973238, now seen corresponding path program 31 times [2018-10-10 15:13:08,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:08,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:09,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1426 backedges. 0 proven. 1426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:09,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:09,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:13:09,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:13:09,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:13:09,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:13:09,557 INFO L87 Difference]: Start difference. First operand 258 states and 259 transitions. Second operand 35 states. [2018-10-10 15:13:10,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:10,509 INFO L93 Difference]: Finished difference Result 263 states and 264 transitions. [2018-10-10 15:13:10,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:13:10,509 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 198 [2018-10-10 15:13:10,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:10,510 INFO L225 Difference]: With dead ends: 263 [2018-10-10 15:13:10,510 INFO L226 Difference]: Without dead ends: 263 [2018-10-10 15:13:10,512 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:13:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-10 15:13:10,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 261. [2018-10-10 15:13:10,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-10 15:13:10,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 262 transitions. [2018-10-10 15:13:10,516 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 262 transitions. Word has length 198 [2018-10-10 15:13:10,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:10,516 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 262 transitions. [2018-10-10 15:13:10,516 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:13:10,517 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 262 transitions. [2018-10-10 15:13:10,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2018-10-10 15:13:10,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:10,518 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] [2018-10-10 15:13:10,518 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:10,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:10,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1683256920, now seen corresponding path program 32 times [2018-10-10 15:13:10,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:10,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:11,214 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:11,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:11,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:13:11,215 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:13:11,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:13:11,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:13:11,216 INFO L87 Difference]: Start difference. First operand 261 states and 262 transitions. Second operand 36 states. [2018-10-10 15:13:12,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:12,513 INFO L93 Difference]: Finished difference Result 266 states and 267 transitions. [2018-10-10 15:13:12,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:13:12,513 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 201 [2018-10-10 15:13:12,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:12,514 INFO L225 Difference]: With dead ends: 266 [2018-10-10 15:13:12,515 INFO L226 Difference]: Without dead ends: 266 [2018-10-10 15:13:12,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:13:12,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-10 15:13:12,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 264. [2018-10-10 15:13:12,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-10 15:13:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 265 transitions. [2018-10-10 15:13:12,520 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 265 transitions. Word has length 201 [2018-10-10 15:13:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:12,521 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 265 transitions. [2018-10-10 15:13:12,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:13:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 265 transitions. [2018-10-10 15:13:12,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-10 15:13:12,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:12,522 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] [2018-10-10 15:13:12,522 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:12,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:12,523 INFO L82 PathProgramCache]: Analyzing trace with hash 1570967286, now seen corresponding path program 33 times [2018-10-10 15:13:12,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:13,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1617 backedges. 0 proven. 1617 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:13,291 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:13,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:13:13,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:13:13,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:13:13,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:13:13,292 INFO L87 Difference]: Start difference. First operand 264 states and 265 transitions. Second operand 37 states. [2018-10-10 15:13:14,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:14,312 INFO L93 Difference]: Finished difference Result 269 states and 270 transitions. [2018-10-10 15:13:14,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:13:14,317 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 204 [2018-10-10 15:13:14,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:14,318 INFO L225 Difference]: With dead ends: 269 [2018-10-10 15:13:14,318 INFO L226 Difference]: Without dead ends: 269 [2018-10-10 15:13:14,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:13:14,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-10 15:13:14,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 267. [2018-10-10 15:13:14,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-10 15:13:14,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 268 transitions. [2018-10-10 15:13:14,323 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 268 transitions. Word has length 204 [2018-10-10 15:13:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:14,323 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 268 transitions. [2018-10-10 15:13:14,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:13:14,323 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 268 transitions. [2018-10-10 15:13:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-10 15:13:14,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:14,324 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] [2018-10-10 15:13:14,324 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:14,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:14,325 INFO L82 PathProgramCache]: Analyzing trace with hash 2130004376, now seen corresponding path program 34 times [2018-10-10 15:13:14,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:14,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:15,271 INFO L134 CoverageAnalysis]: Checked inductivity of 1717 backedges. 0 proven. 1717 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:15,272 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:15,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:13:15,272 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:13:15,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:13:15,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:13:15,273 INFO L87 Difference]: Start difference. First operand 267 states and 268 transitions. Second operand 38 states. [2018-10-10 15:13:16,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:16,391 INFO L93 Difference]: Finished difference Result 272 states and 273 transitions. [2018-10-10 15:13:16,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:13:16,392 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 207 [2018-10-10 15:13:16,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:16,393 INFO L225 Difference]: With dead ends: 272 [2018-10-10 15:13:16,393 INFO L226 Difference]: Without dead ends: 272 [2018-10-10 15:13:16,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:13:16,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-10 15:13:16,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 270. [2018-10-10 15:13:16,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 270 states. [2018-10-10 15:13:16,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 271 transitions. [2018-10-10 15:13:16,397 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 271 transitions. Word has length 207 [2018-10-10 15:13:16,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:16,397 INFO L481 AbstractCegarLoop]: Abstraction has 270 states and 271 transitions. [2018-10-10 15:13:16,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:13:16,397 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 271 transitions. [2018-10-10 15:13:16,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-10 15:13:16,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:16,399 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] [2018-10-10 15:13:16,399 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:16,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:16,399 INFO L82 PathProgramCache]: Analyzing trace with hash 520778678, now seen corresponding path program 35 times [2018-10-10 15:13:16,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:16,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:17,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1820 backedges. 0 proven. 1820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:17,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:17,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:13:17,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:13:17,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:13:17,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:13:17,461 INFO L87 Difference]: Start difference. First operand 270 states and 271 transitions. Second operand 39 states. [2018-10-10 15:13:19,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:19,765 INFO L93 Difference]: Finished difference Result 275 states and 276 transitions. [2018-10-10 15:13:19,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:13:19,765 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 210 [2018-10-10 15:13:19,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:19,767 INFO L225 Difference]: With dead ends: 275 [2018-10-10 15:13:19,767 INFO L226 Difference]: Without dead ends: 275 [2018-10-10 15:13:19,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:13:19,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-10 15:13:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 273. [2018-10-10 15:13:19,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-10 15:13:19,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 274 transitions. [2018-10-10 15:13:19,771 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 274 transitions. Word has length 210 [2018-10-10 15:13:19,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:19,771 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 274 transitions. [2018-10-10 15:13:19,772 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:13:19,772 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 274 transitions. [2018-10-10 15:13:19,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2018-10-10 15:13:19,773 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:19,773 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] [2018-10-10 15:13:19,773 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:19,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:19,774 INFO L82 PathProgramCache]: Analyzing trace with hash 502967512, now seen corresponding path program 36 times [2018-10-10 15:13:19,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:19,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:20,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 0 proven. 1926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:20,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:20,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:13:20,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:13:20,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:13:20,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:13:20,704 INFO L87 Difference]: Start difference. First operand 273 states and 274 transitions. Second operand 40 states. [2018-10-10 15:13:21,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:21,795 INFO L93 Difference]: Finished difference Result 278 states and 279 transitions. [2018-10-10 15:13:21,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:13:21,795 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 213 [2018-10-10 15:13:21,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:21,796 INFO L225 Difference]: With dead ends: 278 [2018-10-10 15:13:21,796 INFO L226 Difference]: Without dead ends: 278 [2018-10-10 15:13:21,798 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:13:21,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-10 15:13:21,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 276. [2018-10-10 15:13:21,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 276 states. [2018-10-10 15:13:21,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 276 states to 276 states and 277 transitions. [2018-10-10 15:13:21,801 INFO L78 Accepts]: Start accepts. Automaton has 276 states and 277 transitions. Word has length 213 [2018-10-10 15:13:21,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:21,801 INFO L481 AbstractCegarLoop]: Abstraction has 276 states and 277 transitions. [2018-10-10 15:13:21,801 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:13:21,801 INFO L276 IsEmpty]: Start isEmpty. Operand 276 states and 277 transitions. [2018-10-10 15:13:21,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-10 15:13:21,802 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:21,803 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] [2018-10-10 15:13:21,803 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:21,803 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:21,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1828501386, now seen corresponding path program 37 times [2018-10-10 15:13:21,804 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:21,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:22,919 INFO L134 CoverageAnalysis]: Checked inductivity of 2035 backedges. 0 proven. 2035 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:22,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:22,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:13:22,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:13:22,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:13:22,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:13:22,921 INFO L87 Difference]: Start difference. First operand 276 states and 277 transitions. Second operand 41 states. [2018-10-10 15:13:24,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:24,155 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-10-10 15:13:24,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:13:24,155 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 216 [2018-10-10 15:13:24,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:24,156 INFO L225 Difference]: With dead ends: 281 [2018-10-10 15:13:24,156 INFO L226 Difference]: Without dead ends: 281 [2018-10-10 15:13:24,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:13:24,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-10 15:13:24,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 279. [2018-10-10 15:13:24,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-10 15:13:24,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 280 transitions. [2018-10-10 15:13:24,160 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 280 transitions. Word has length 216 [2018-10-10 15:13:24,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:24,161 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 280 transitions. [2018-10-10 15:13:24,161 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:13:24,161 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 280 transitions. [2018-10-10 15:13:24,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2018-10-10 15:13:24,162 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:24,162 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] [2018-10-10 15:13:24,162 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:24,162 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:24,163 INFO L82 PathProgramCache]: Analyzing trace with hash -407330792, now seen corresponding path program 38 times [2018-10-10 15:13:24,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:24,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:25,200 INFO L134 CoverageAnalysis]: Checked inductivity of 2147 backedges. 0 proven. 2147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:25,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:25,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:13:25,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:13:25,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:13:25,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:13:25,201 INFO L87 Difference]: Start difference. First operand 279 states and 280 transitions. Second operand 42 states. [2018-10-10 15:13:26,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:26,576 INFO L93 Difference]: Finished difference Result 284 states and 285 transitions. [2018-10-10 15:13:26,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:13:26,576 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 219 [2018-10-10 15:13:26,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:26,577 INFO L225 Difference]: With dead ends: 284 [2018-10-10 15:13:26,577 INFO L226 Difference]: Without dead ends: 284 [2018-10-10 15:13:26,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:13:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-10 15:13:26,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 282. [2018-10-10 15:13:26,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 282 states. [2018-10-10 15:13:26,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 283 transitions. [2018-10-10 15:13:26,582 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 283 transitions. Word has length 219 [2018-10-10 15:13:26,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:26,582 INFO L481 AbstractCegarLoop]: Abstraction has 282 states and 283 transitions. [2018-10-10 15:13:26,582 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:13:26,582 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 283 transitions. [2018-10-10 15:13:26,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-10 15:13:26,583 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:26,584 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] [2018-10-10 15:13:26,584 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:26,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:26,584 INFO L82 PathProgramCache]: Analyzing trace with hash -2101768906, now seen corresponding path program 39 times [2018-10-10 15:13:26,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:26,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 2262 backedges. 0 proven. 2262 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:27,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:27,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:13:27,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:13:27,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:13:27,847 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:13:27,847 INFO L87 Difference]: Start difference. First operand 282 states and 283 transitions. Second operand 43 states. [2018-10-10 15:13:29,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:29,239 INFO L93 Difference]: Finished difference Result 287 states and 288 transitions. [2018-10-10 15:13:29,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:13:29,246 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 222 [2018-10-10 15:13:29,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:29,247 INFO L225 Difference]: With dead ends: 287 [2018-10-10 15:13:29,247 INFO L226 Difference]: Without dead ends: 287 [2018-10-10 15:13:29,248 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:13:29,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-10 15:13:29,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 285. [2018-10-10 15:13:29,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-10 15:13:29,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 286 transitions. [2018-10-10 15:13:29,252 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 286 transitions. Word has length 222 [2018-10-10 15:13:29,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:29,252 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 286 transitions. [2018-10-10 15:13:29,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:13:29,252 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 286 transitions. [2018-10-10 15:13:29,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-10 15:13:29,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:29,253 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] [2018-10-10 15:13:29,254 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:29,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:29,254 INFO L82 PathProgramCache]: Analyzing trace with hash 1937974104, now seen corresponding path program 40 times [2018-10-10 15:13:29,255 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:29,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 2380 backedges. 0 proven. 2380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:30,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:30,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:13:30,253 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:13:30,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:13:30,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:13:30,254 INFO L87 Difference]: Start difference. First operand 285 states and 286 transitions. Second operand 44 states. [2018-10-10 15:13:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:31,650 INFO L93 Difference]: Finished difference Result 290 states and 291 transitions. [2018-10-10 15:13:31,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:13:31,650 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 225 [2018-10-10 15:13:31,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:31,651 INFO L225 Difference]: With dead ends: 290 [2018-10-10 15:13:31,651 INFO L226 Difference]: Without dead ends: 290 [2018-10-10 15:13:31,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:13:31,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-10 15:13:31,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 288. [2018-10-10 15:13:31,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 288 states. [2018-10-10 15:13:31,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 289 transitions. [2018-10-10 15:13:31,655 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 289 transitions. Word has length 225 [2018-10-10 15:13:31,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:31,656 INFO L481 AbstractCegarLoop]: Abstraction has 288 states and 289 transitions. [2018-10-10 15:13:31,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:13:31,656 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 289 transitions. [2018-10-10 15:13:31,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-10 15:13:31,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:31,657 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] [2018-10-10 15:13:31,657 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:31,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:31,658 INFO L82 PathProgramCache]: Analyzing trace with hash 643383798, now seen corresponding path program 41 times [2018-10-10 15:13:31,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:32,951 INFO L134 CoverageAnalysis]: Checked inductivity of 2501 backedges. 0 proven. 2501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:32,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:32,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:13:32,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:13:32,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:13:32,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:13:32,953 INFO L87 Difference]: Start difference. First operand 288 states and 289 transitions. Second operand 45 states. [2018-10-10 15:13:34,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:34,559 INFO L93 Difference]: Finished difference Result 293 states and 294 transitions. [2018-10-10 15:13:34,560 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:13:34,560 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 228 [2018-10-10 15:13:34,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:34,561 INFO L225 Difference]: With dead ends: 293 [2018-10-10 15:13:34,561 INFO L226 Difference]: Without dead ends: 293 [2018-10-10 15:13:34,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:13:34,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-10 15:13:34,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 291. [2018-10-10 15:13:34,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-10 15:13:34,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 292 transitions. [2018-10-10 15:13:34,565 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 292 transitions. Word has length 228 [2018-10-10 15:13:34,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:34,565 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 292 transitions. [2018-10-10 15:13:34,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:13:34,565 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 292 transitions. [2018-10-10 15:13:34,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2018-10-10 15:13:34,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:34,566 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] [2018-10-10 15:13:34,566 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:34,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:34,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1985071464, now seen corresponding path program 42 times [2018-10-10 15:13:34,567 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:34,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:35,538 INFO L134 CoverageAnalysis]: Checked inductivity of 2625 backedges. 0 proven. 2625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:35,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:35,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:13:35,539 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:13:35,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:13:35,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:13:35,540 INFO L87 Difference]: Start difference. First operand 291 states and 292 transitions. Second operand 46 states. [2018-10-10 15:13:37,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:37,043 INFO L93 Difference]: Finished difference Result 296 states and 297 transitions. [2018-10-10 15:13:37,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:13:37,043 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 231 [2018-10-10 15:13:37,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:37,044 INFO L225 Difference]: With dead ends: 296 [2018-10-10 15:13:37,044 INFO L226 Difference]: Without dead ends: 296 [2018-10-10 15:13:37,045 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-10 15:13:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-10 15:13:37,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 294. [2018-10-10 15:13:37,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 294 states. [2018-10-10 15:13:37,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 295 transitions. [2018-10-10 15:13:37,049 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 295 transitions. Word has length 231 [2018-10-10 15:13:37,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:37,049 INFO L481 AbstractCegarLoop]: Abstraction has 294 states and 295 transitions. [2018-10-10 15:13:37,049 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:13:37,049 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 295 transitions. [2018-10-10 15:13:37,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-10 15:13:37,051 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:37,051 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] [2018-10-10 15:13:37,051 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:37,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash -452041034, now seen corresponding path program 43 times [2018-10-10 15:13:37,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2752 backedges. 0 proven. 2752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:38,360 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:38,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:13:38,360 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:13:38,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:13:38,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:13:38,361 INFO L87 Difference]: Start difference. First operand 294 states and 295 transitions. Second operand 47 states. [2018-10-10 15:13:39,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:39,772 INFO L93 Difference]: Finished difference Result 299 states and 300 transitions. [2018-10-10 15:13:39,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:13:39,773 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 234 [2018-10-10 15:13:39,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:39,774 INFO L225 Difference]: With dead ends: 299 [2018-10-10 15:13:39,774 INFO L226 Difference]: Without dead ends: 299 [2018-10-10 15:13:39,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:13:39,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-10 15:13:39,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2018-10-10 15:13:39,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-10 15:13:39,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 298 transitions. [2018-10-10 15:13:39,777 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 298 transitions. Word has length 234 [2018-10-10 15:13:39,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:39,778 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 298 transitions. [2018-10-10 15:13:39,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:13:39,778 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 298 transitions. [2018-10-10 15:13:39,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2018-10-10 15:13:39,779 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:39,779 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] [2018-10-10 15:13:39,779 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:39,780 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:39,780 INFO L82 PathProgramCache]: Analyzing trace with hash 1670240728, now seen corresponding path program 44 times [2018-10-10 15:13:39,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:40,952 INFO L134 CoverageAnalysis]: Checked inductivity of 2882 backedges. 0 proven. 2882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:40,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:40,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:13:40,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:13:40,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:13:40,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:13:40,954 INFO L87 Difference]: Start difference. First operand 297 states and 298 transitions. Second operand 48 states. [2018-10-10 15:13:42,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:42,608 INFO L93 Difference]: Finished difference Result 302 states and 303 transitions. [2018-10-10 15:13:42,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:13:42,608 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 237 [2018-10-10 15:13:42,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:42,609 INFO L225 Difference]: With dead ends: 302 [2018-10-10 15:13:42,609 INFO L226 Difference]: Without dead ends: 302 [2018-10-10 15:13:42,610 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:13:42,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-10 15:13:42,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 300. [2018-10-10 15:13:42,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 300 states. [2018-10-10 15:13:42,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 301 transitions. [2018-10-10 15:13:42,612 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 301 transitions. Word has length 237 [2018-10-10 15:13:42,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:42,613 INFO L481 AbstractCegarLoop]: Abstraction has 300 states and 301 transitions. [2018-10-10 15:13:42,613 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:13:42,613 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 301 transitions. [2018-10-10 15:13:42,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-10 15:13:42,614 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:42,614 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] [2018-10-10 15:13:42,614 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:42,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:42,614 INFO L82 PathProgramCache]: Analyzing trace with hash 352648054, now seen corresponding path program 45 times [2018-10-10 15:13:42,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:42,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:43,922 INFO L134 CoverageAnalysis]: Checked inductivity of 3015 backedges. 0 proven. 3015 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:43,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:43,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:13:43,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:13:43,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:13:43,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:13:43,924 INFO L87 Difference]: Start difference. First operand 300 states and 301 transitions. Second operand 49 states. [2018-10-10 15:13:45,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:45,472 INFO L93 Difference]: Finished difference Result 305 states and 306 transitions. [2018-10-10 15:13:45,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:13:45,472 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 240 [2018-10-10 15:13:45,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:45,473 INFO L225 Difference]: With dead ends: 305 [2018-10-10 15:13:45,473 INFO L226 Difference]: Without dead ends: 305 [2018-10-10 15:13:45,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:13:45,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-10 15:13:45,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 303. [2018-10-10 15:13:45,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-10 15:13:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 304 transitions. [2018-10-10 15:13:45,478 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 304 transitions. Word has length 240 [2018-10-10 15:13:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:45,478 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 304 transitions. [2018-10-10 15:13:45,478 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:13:45,478 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 304 transitions. [2018-10-10 15:13:45,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2018-10-10 15:13:45,479 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:45,480 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] [2018-10-10 15:13:45,480 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:45,480 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:45,480 INFO L82 PathProgramCache]: Analyzing trace with hash -344584936, now seen corresponding path program 46 times [2018-10-10 15:13:45,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:46,744 INFO L134 CoverageAnalysis]: Checked inductivity of 3151 backedges. 0 proven. 3151 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:46,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:46,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:13:46,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:13:46,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:13:46,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:13:46,745 INFO L87 Difference]: Start difference. First operand 303 states and 304 transitions. Second operand 50 states. [2018-10-10 15:13:48,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:48,628 INFO L93 Difference]: Finished difference Result 308 states and 309 transitions. [2018-10-10 15:13:48,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:13:48,628 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 243 [2018-10-10 15:13:48,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:48,629 INFO L225 Difference]: With dead ends: 308 [2018-10-10 15:13:48,630 INFO L226 Difference]: Without dead ends: 308 [2018-10-10 15:13:48,630 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:13:48,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2018-10-10 15:13:48,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 306. [2018-10-10 15:13:48,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-10 15:13:48,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 307 transitions. [2018-10-10 15:13:48,633 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 307 transitions. Word has length 243 [2018-10-10 15:13:48,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:48,633 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 307 transitions. [2018-10-10 15:13:48,633 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:13:48,633 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 307 transitions. [2018-10-10 15:13:48,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-10 15:13:48,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:48,634 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] [2018-10-10 15:13:48,635 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:48,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:48,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1150746570, now seen corresponding path program 47 times [2018-10-10 15:13:48,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:49,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3290 backedges. 0 proven. 3290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:49,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:49,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:13:49,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:13:49,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:13:49,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:13:49,935 INFO L87 Difference]: Start difference. First operand 306 states and 307 transitions. Second operand 51 states. [2018-10-10 15:13:51,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:51,748 INFO L93 Difference]: Finished difference Result 311 states and 312 transitions. [2018-10-10 15:13:51,748 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:13:51,749 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 246 [2018-10-10 15:13:51,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:51,750 INFO L225 Difference]: With dead ends: 311 [2018-10-10 15:13:51,750 INFO L226 Difference]: Without dead ends: 311 [2018-10-10 15:13:51,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:13:51,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-10 15:13:51,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2018-10-10 15:13:51,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 309 states. [2018-10-10 15:13:51,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 310 transitions. [2018-10-10 15:13:51,754 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 310 transitions. Word has length 246 [2018-10-10 15:13:51,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:51,754 INFO L481 AbstractCegarLoop]: Abstraction has 309 states and 310 transitions. [2018-10-10 15:13:51,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:13:51,754 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 310 transitions. [2018-10-10 15:13:51,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-10 15:13:51,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:51,755 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] [2018-10-10 15:13:51,756 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:51,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:51,756 INFO L82 PathProgramCache]: Analyzing trace with hash -54865832, now seen corresponding path program 48 times [2018-10-10 15:13:51,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:51,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:53,294 INFO L134 CoverageAnalysis]: Checked inductivity of 3432 backedges. 0 proven. 3432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:53,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:53,294 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:13:53,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:13:53,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:13:53,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:13:53,296 INFO L87 Difference]: Start difference. First operand 309 states and 310 transitions. Second operand 52 states. [2018-10-10 15:13:55,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:55,184 INFO L93 Difference]: Finished difference Result 314 states and 315 transitions. [2018-10-10 15:13:55,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:13:55,185 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 249 [2018-10-10 15:13:55,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:55,186 INFO L225 Difference]: With dead ends: 314 [2018-10-10 15:13:55,186 INFO L226 Difference]: Without dead ends: 314 [2018-10-10 15:13:55,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:13:55,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2018-10-10 15:13:55,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 312. [2018-10-10 15:13:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 312 states. [2018-10-10 15:13:55,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 313 transitions. [2018-10-10 15:13:55,190 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 313 transitions. Word has length 249 [2018-10-10 15:13:55,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:55,190 INFO L481 AbstractCegarLoop]: Abstraction has 312 states and 313 transitions. [2018-10-10 15:13:55,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:13:55,190 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 313 transitions. [2018-10-10 15:13:55,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-10 15:13:55,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:55,192 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] [2018-10-10 15:13:55,192 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:55,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:55,192 INFO L82 PathProgramCache]: Analyzing trace with hash 1281783030, now seen corresponding path program 49 times [2018-10-10 15:13:55,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:56,566 INFO L134 CoverageAnalysis]: Checked inductivity of 3577 backedges. 0 proven. 3577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:56,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:56,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:13:56,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:13:56,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:13:56,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:13:56,568 INFO L87 Difference]: Start difference. First operand 312 states and 313 transitions. Second operand 53 states. [2018-10-10 15:13:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:13:58,620 INFO L93 Difference]: Finished difference Result 317 states and 318 transitions. [2018-10-10 15:13:58,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:13:58,620 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-10-10 15:13:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:13:58,621 INFO L225 Difference]: With dead ends: 317 [2018-10-10 15:13:58,621 INFO L226 Difference]: Without dead ends: 317 [2018-10-10 15:13:58,622 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-10 15:13:58,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-10 15:13:58,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2018-10-10 15:13:58,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-10 15:13:58,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-10 15:13:58,626 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 252 [2018-10-10 15:13:58,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:13:58,626 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-10 15:13:58,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:13:58,627 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-10 15:13:58,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-10 15:13:58,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:13:58,628 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] [2018-10-10 15:13:58,628 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:13:58,628 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:13:58,629 INFO L82 PathProgramCache]: Analyzing trace with hash -1548737640, now seen corresponding path program 50 times [2018-10-10 15:13:58,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:13:58,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:13:59,952 INFO L134 CoverageAnalysis]: Checked inductivity of 3725 backedges. 0 proven. 3725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:13:59,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:13:59,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:13:59,953 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:13:59,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:13:59,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:13:59,954 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 54 states. [2018-10-10 15:14:01,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:01,946 INFO L93 Difference]: Finished difference Result 320 states and 321 transitions. [2018-10-10 15:14:01,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:14:01,947 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 255 [2018-10-10 15:14:01,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:01,948 INFO L225 Difference]: With dead ends: 320 [2018-10-10 15:14:01,949 INFO L226 Difference]: Without dead ends: 320 [2018-10-10 15:14:01,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:14:01,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-10 15:14:01,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 318. [2018-10-10 15:14:01,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2018-10-10 15:14:01,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 319 transitions. [2018-10-10 15:14:01,953 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 319 transitions. Word has length 255 [2018-10-10 15:14:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:01,953 INFO L481 AbstractCegarLoop]: Abstraction has 318 states and 319 transitions. [2018-10-10 15:14:01,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:14:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 319 transitions. [2018-10-10 15:14:01,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-10 15:14:01,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:01,955 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] [2018-10-10 15:14:01,955 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:01,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:01,956 INFO L82 PathProgramCache]: Analyzing trace with hash 1797872054, now seen corresponding path program 51 times [2018-10-10 15:14:01,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:01,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:03,619 INFO L134 CoverageAnalysis]: Checked inductivity of 3876 backedges. 0 proven. 3876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:03,619 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:03,620 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:14:03,620 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:14:03,620 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:14:03,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:14:03,621 INFO L87 Difference]: Start difference. First operand 318 states and 319 transitions. Second operand 55 states. [2018-10-10 15:14:05,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:05,726 INFO L93 Difference]: Finished difference Result 323 states and 324 transitions. [2018-10-10 15:14:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:14:05,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 258 [2018-10-10 15:14:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:05,728 INFO L225 Difference]: With dead ends: 323 [2018-10-10 15:14:05,728 INFO L226 Difference]: Without dead ends: 323 [2018-10-10 15:14:05,729 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-10 15:14:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-10 15:14:05,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 321. [2018-10-10 15:14:05,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-10 15:14:05,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-10-10 15:14:05,731 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 258 [2018-10-10 15:14:05,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:05,732 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-10-10 15:14:05,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:14:05,732 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-10-10 15:14:05,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2018-10-10 15:14:05,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:05,733 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] [2018-10-10 15:14:05,733 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:05,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:05,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1571423960, now seen corresponding path program 52 times [2018-10-10 15:14:05,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:05,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:07,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4030 backedges. 0 proven. 4030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:07,125 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:07,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:14:07,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:14:07,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:14:07,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:14:07,126 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 56 states. [2018-10-10 15:14:09,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:09,354 INFO L93 Difference]: Finished difference Result 326 states and 327 transitions. [2018-10-10 15:14:09,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:14:09,354 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 261 [2018-10-10 15:14:09,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:09,356 INFO L225 Difference]: With dead ends: 326 [2018-10-10 15:14:09,356 INFO L226 Difference]: Without dead ends: 326 [2018-10-10 15:14:09,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:14:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 326 states. [2018-10-10 15:14:09,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 326 to 324. [2018-10-10 15:14:09,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 324 states. [2018-10-10 15:14:09,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 324 states to 324 states and 325 transitions. [2018-10-10 15:14:09,360 INFO L78 Accepts]: Start accepts. Automaton has 324 states and 325 transitions. Word has length 261 [2018-10-10 15:14:09,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:09,361 INFO L481 AbstractCegarLoop]: Abstraction has 324 states and 325 transitions. [2018-10-10 15:14:09,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:14:09,361 INFO L276 IsEmpty]: Start isEmpty. Operand 324 states and 325 transitions. [2018-10-10 15:14:09,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-10 15:14:09,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:09,362 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] [2018-10-10 15:14:09,363 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:09,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:09,363 INFO L82 PathProgramCache]: Analyzing trace with hash -1445089674, now seen corresponding path program 53 times [2018-10-10 15:14:09,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:09,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4187 backedges. 0 proven. 4187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:10,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:10,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:14:10,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:14:10,819 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:14:10,819 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:14:10,819 INFO L87 Difference]: Start difference. First operand 324 states and 325 transitions. Second operand 57 states. [2018-10-10 15:14:12,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:12,958 INFO L93 Difference]: Finished difference Result 329 states and 330 transitions. [2018-10-10 15:14:12,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:14:12,958 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 264 [2018-10-10 15:14:12,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:12,960 INFO L225 Difference]: With dead ends: 329 [2018-10-10 15:14:12,960 INFO L226 Difference]: Without dead ends: 329 [2018-10-10 15:14:12,961 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-10 15:14:12,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-10 15:14:12,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 327. [2018-10-10 15:14:12,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-10 15:14:12,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-10 15:14:12,963 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 264 [2018-10-10 15:14:12,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:12,963 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-10 15:14:12,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:14:12,964 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-10 15:14:12,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2018-10-10 15:14:12,965 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:12,965 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] [2018-10-10 15:14:12,965 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:12,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:12,966 INFO L82 PathProgramCache]: Analyzing trace with hash 1492941336, now seen corresponding path program 54 times [2018-10-10 15:14:12,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:12,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:14,729 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:14,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:14,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:14:14,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:14:14,730 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:14:14,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:14:14,731 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 58 states. [2018-10-10 15:14:16,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:16,958 INFO L93 Difference]: Finished difference Result 332 states and 333 transitions. [2018-10-10 15:14:16,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:14:16,958 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 267 [2018-10-10 15:14:16,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:16,960 INFO L225 Difference]: With dead ends: 332 [2018-10-10 15:14:16,960 INFO L226 Difference]: Without dead ends: 332 [2018-10-10 15:14:16,961 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:14:16,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-10 15:14:16,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 330. [2018-10-10 15:14:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-10 15:14:16,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 331 transitions. [2018-10-10 15:14:16,963 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 331 transitions. Word has length 267 [2018-10-10 15:14:16,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:16,964 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 331 transitions. [2018-10-10 15:14:16,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:14:16,964 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 331 transitions. [2018-10-10 15:14:16,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-10 15:14:16,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:16,965 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] [2018-10-10 15:14:16,965 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:16,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:16,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1236235062, now seen corresponding path program 55 times [2018-10-10 15:14:16,966 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:18,696 INFO L134 CoverageAnalysis]: Checked inductivity of 4510 backedges. 0 proven. 4510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:18,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:18,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:14:18,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:14:18,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:14:18,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:14:18,697 INFO L87 Difference]: Start difference. First operand 330 states and 331 transitions. Second operand 59 states. [2018-10-10 15:14:20,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:20,899 INFO L93 Difference]: Finished difference Result 335 states and 336 transitions. [2018-10-10 15:14:20,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:14:20,899 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 270 [2018-10-10 15:14:20,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:20,900 INFO L225 Difference]: With dead ends: 335 [2018-10-10 15:14:20,901 INFO L226 Difference]: Without dead ends: 335 [2018-10-10 15:14:20,901 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:14:20,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-10 15:14:20,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 333. [2018-10-10 15:14:20,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-10 15:14:20,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 334 transitions. [2018-10-10 15:14:20,904 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 334 transitions. Word has length 270 [2018-10-10 15:14:20,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:20,904 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 334 transitions. [2018-10-10 15:14:20,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:14:20,904 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 334 transitions. [2018-10-10 15:14:20,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-10 15:14:20,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:20,906 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] [2018-10-10 15:14:20,906 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:20,906 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:20,906 INFO L82 PathProgramCache]: Analyzing trace with hash -1258586792, now seen corresponding path program 56 times [2018-10-10 15:14:20,907 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:20,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:22,470 INFO L134 CoverageAnalysis]: Checked inductivity of 4676 backedges. 0 proven. 4676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:22,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:22,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:14:22,471 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:14:22,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:14:22,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:14:22,471 INFO L87 Difference]: Start difference. First operand 333 states and 334 transitions. Second operand 60 states. [2018-10-10 15:14:25,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:25,022 INFO L93 Difference]: Finished difference Result 338 states and 339 transitions. [2018-10-10 15:14:25,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:14:25,022 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 273 [2018-10-10 15:14:25,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:25,024 INFO L225 Difference]: With dead ends: 338 [2018-10-10 15:14:25,024 INFO L226 Difference]: Without dead ends: 338 [2018-10-10 15:14:25,024 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:14:25,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2018-10-10 15:14:25,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 336. [2018-10-10 15:14:25,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 336 states. [2018-10-10 15:14:25,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 337 transitions. [2018-10-10 15:14:25,027 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 337 transitions. Word has length 273 [2018-10-10 15:14:25,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:25,027 INFO L481 AbstractCegarLoop]: Abstraction has 336 states and 337 transitions. [2018-10-10 15:14:25,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:14:25,027 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 337 transitions. [2018-10-10 15:14:25,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-10 15:14:25,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:25,028 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] [2018-10-10 15:14:25,028 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:25,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:25,029 INFO L82 PathProgramCache]: Analyzing trace with hash -87382026, now seen corresponding path program 57 times [2018-10-10 15:14:25,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:26,638 INFO L134 CoverageAnalysis]: Checked inductivity of 4845 backedges. 0 proven. 4845 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:26,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:26,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:14:26,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:14:26,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:14:26,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:14:26,641 INFO L87 Difference]: Start difference. First operand 336 states and 337 transitions. Second operand 61 states. [2018-10-10 15:14:29,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:29,397 INFO L93 Difference]: Finished difference Result 341 states and 342 transitions. [2018-10-10 15:14:29,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:14:29,398 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 276 [2018-10-10 15:14:29,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:29,399 INFO L225 Difference]: With dead ends: 341 [2018-10-10 15:14:29,399 INFO L226 Difference]: Without dead ends: 341 [2018-10-10 15:14:29,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:14:29,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-10 15:14:29,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 339. [2018-10-10 15:14:29,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 339 states. [2018-10-10 15:14:29,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 340 transitions. [2018-10-10 15:14:29,403 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 340 transitions. Word has length 276 [2018-10-10 15:14:29,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:29,403 INFO L481 AbstractCegarLoop]: Abstraction has 339 states and 340 transitions. [2018-10-10 15:14:29,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:14:29,403 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 340 transitions. [2018-10-10 15:14:29,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2018-10-10 15:14:29,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:29,404 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] [2018-10-10 15:14:29,404 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:29,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:29,405 INFO L82 PathProgramCache]: Analyzing trace with hash -1040510824, now seen corresponding path program 58 times [2018-10-10 15:14:29,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:29,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:31,083 INFO L134 CoverageAnalysis]: Checked inductivity of 5017 backedges. 0 proven. 5017 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:31,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:31,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:14:31,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:14:31,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:14:31,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:14:31,085 INFO L87 Difference]: Start difference. First operand 339 states and 340 transitions. Second operand 62 states. [2018-10-10 15:14:34,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:34,236 INFO L93 Difference]: Finished difference Result 344 states and 345 transitions. [2018-10-10 15:14:34,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:14:34,237 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 279 [2018-10-10 15:14:34,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:34,238 INFO L225 Difference]: With dead ends: 344 [2018-10-10 15:14:34,238 INFO L226 Difference]: Without dead ends: 344 [2018-10-10 15:14:34,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:14:34,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-10 15:14:34,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 342. [2018-10-10 15:14:34,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 342 states. [2018-10-10 15:14:34,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 342 states to 342 states and 343 transitions. [2018-10-10 15:14:34,242 INFO L78 Accepts]: Start accepts. Automaton has 342 states and 343 transitions. Word has length 279 [2018-10-10 15:14:34,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:34,242 INFO L481 AbstractCegarLoop]: Abstraction has 342 states and 343 transitions. [2018-10-10 15:14:34,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:14:34,242 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 343 transitions. [2018-10-10 15:14:34,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-10 15:14:34,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:34,244 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] [2018-10-10 15:14:34,244 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:34,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:34,244 INFO L82 PathProgramCache]: Analyzing trace with hash -1671738186, now seen corresponding path program 59 times [2018-10-10 15:14:34,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5192 backedges. 0 proven. 5192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:35,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:35,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:14:35,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:14:35,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:14:35,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:14:35,938 INFO L87 Difference]: Start difference. First operand 342 states and 343 transitions. Second operand 63 states. [2018-10-10 15:14:38,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:38,511 INFO L93 Difference]: Finished difference Result 347 states and 348 transitions. [2018-10-10 15:14:38,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:14:38,511 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 282 [2018-10-10 15:14:38,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:38,513 INFO L225 Difference]: With dead ends: 347 [2018-10-10 15:14:38,513 INFO L226 Difference]: Without dead ends: 347 [2018-10-10 15:14:38,514 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:14:38,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-10 15:14:38,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 345. [2018-10-10 15:14:38,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 345 states. [2018-10-10 15:14:38,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 346 transitions. [2018-10-10 15:14:38,517 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 346 transitions. Word has length 282 [2018-10-10 15:14:38,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:38,517 INFO L481 AbstractCegarLoop]: Abstraction has 345 states and 346 transitions. [2018-10-10 15:14:38,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:14:38,517 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 346 transitions. [2018-10-10 15:14:38,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2018-10-10 15:14:38,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:38,519 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] [2018-10-10 15:14:38,519 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:38,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:38,519 INFO L82 PathProgramCache]: Analyzing trace with hash 1095709656, now seen corresponding path program 60 times [2018-10-10 15:14:38,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:38,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:40,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5370 backedges. 0 proven. 5370 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:14:40,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:14:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:14:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:14:40,545 INFO L87 Difference]: Start difference. First operand 345 states and 346 transitions. Second operand 64 states. [2018-10-10 15:14:43,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:43,192 INFO L93 Difference]: Finished difference Result 350 states and 351 transitions. [2018-10-10 15:14:43,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:14:43,193 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 285 [2018-10-10 15:14:43,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:43,194 INFO L225 Difference]: With dead ends: 350 [2018-10-10 15:14:43,194 INFO L226 Difference]: Without dead ends: 350 [2018-10-10 15:14:43,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:14:43,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-10 15:14:43,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 348. [2018-10-10 15:14:43,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-10 15:14:43,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 349 transitions. [2018-10-10 15:14:43,198 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 349 transitions. Word has length 285 [2018-10-10 15:14:43,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:43,198 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 349 transitions. [2018-10-10 15:14:43,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:14:43,198 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 349 transitions. [2018-10-10 15:14:43,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-10 15:14:43,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:43,199 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] [2018-10-10 15:14:43,199 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:43,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:43,200 INFO L82 PathProgramCache]: Analyzing trace with hash -57843338, now seen corresponding path program 61 times [2018-10-10 15:14:43,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:43,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:45,436 INFO L134 CoverageAnalysis]: Checked inductivity of 5551 backedges. 0 proven. 5551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:45,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:45,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:14:45,437 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:14:45,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:14:45,438 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:14:45,438 INFO L87 Difference]: Start difference. First operand 348 states and 349 transitions. Second operand 65 states. [2018-10-10 15:14:48,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:48,202 INFO L93 Difference]: Finished difference Result 353 states and 354 transitions. [2018-10-10 15:14:48,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:14:48,203 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 288 [2018-10-10 15:14:48,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:48,204 INFO L225 Difference]: With dead ends: 353 [2018-10-10 15:14:48,204 INFO L226 Difference]: Without dead ends: 353 [2018-10-10 15:14:48,205 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:14:48,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-10 15:14:48,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 351. [2018-10-10 15:14:48,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 351 states. [2018-10-10 15:14:48,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 352 transitions. [2018-10-10 15:14:48,208 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 352 transitions. Word has length 288 [2018-10-10 15:14:48,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:48,208 INFO L481 AbstractCegarLoop]: Abstraction has 351 states and 352 transitions. [2018-10-10 15:14:48,208 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:14:48,209 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 352 transitions. [2018-10-10 15:14:48,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-10 15:14:48,209 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:48,210 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] [2018-10-10 15:14:48,210 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:48,210 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:48,210 INFO L82 PathProgramCache]: Analyzing trace with hash -1521752296, now seen corresponding path program 62 times [2018-10-10 15:14:48,211 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:48,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:50,332 INFO L134 CoverageAnalysis]: Checked inductivity of 5735 backedges. 0 proven. 5735 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:50,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:50,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:14:50,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:14:50,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:14:50,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:14:50,335 INFO L87 Difference]: Start difference. First operand 351 states and 352 transitions. Second operand 66 states. [2018-10-10 15:14:53,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:53,165 INFO L93 Difference]: Finished difference Result 356 states and 357 transitions. [2018-10-10 15:14:53,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:14:53,166 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 291 [2018-10-10 15:14:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:53,167 INFO L225 Difference]: With dead ends: 356 [2018-10-10 15:14:53,167 INFO L226 Difference]: Without dead ends: 356 [2018-10-10 15:14:53,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:14:53,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-10 15:14:53,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 354. [2018-10-10 15:14:53,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 354 states. [2018-10-10 15:14:53,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 354 states to 354 states and 355 transitions. [2018-10-10 15:14:53,172 INFO L78 Accepts]: Start accepts. Automaton has 354 states and 355 transitions. Word has length 291 [2018-10-10 15:14:53,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:53,172 INFO L481 AbstractCegarLoop]: Abstraction has 354 states and 355 transitions. [2018-10-10 15:14:53,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:14:53,172 INFO L276 IsEmpty]: Start isEmpty. Operand 354 states and 355 transitions. [2018-10-10 15:14:53,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-10 15:14:53,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:53,173 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] [2018-10-10 15:14:53,173 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:53,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:53,174 INFO L82 PathProgramCache]: Analyzing trace with hash -1735596490, now seen corresponding path program 63 times [2018-10-10 15:14:53,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:53,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:14:55,347 INFO L134 CoverageAnalysis]: Checked inductivity of 5922 backedges. 0 proven. 5922 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:14:55,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:14:55,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:14:55,348 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:14:55,348 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:14:55,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:14:55,349 INFO L87 Difference]: Start difference. First operand 354 states and 355 transitions. Second operand 67 states. [2018-10-10 15:14:58,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:14:58,219 INFO L93 Difference]: Finished difference Result 359 states and 360 transitions. [2018-10-10 15:14:58,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:14:58,219 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 294 [2018-10-10 15:14:58,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:14:58,221 INFO L225 Difference]: With dead ends: 359 [2018-10-10 15:14:58,221 INFO L226 Difference]: Without dead ends: 359 [2018-10-10 15:14:58,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:14:58,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-10 15:14:58,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 357. [2018-10-10 15:14:58,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 357 states. [2018-10-10 15:14:58,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 357 states to 357 states and 358 transitions. [2018-10-10 15:14:58,225 INFO L78 Accepts]: Start accepts. Automaton has 357 states and 358 transitions. Word has length 294 [2018-10-10 15:14:58,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:14:58,225 INFO L481 AbstractCegarLoop]: Abstraction has 357 states and 358 transitions. [2018-10-10 15:14:58,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:14:58,225 INFO L276 IsEmpty]: Start isEmpty. Operand 357 states and 358 transitions. [2018-10-10 15:14:58,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2018-10-10 15:14:58,227 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:14:58,227 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] [2018-10-10 15:14:58,227 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:14:58,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:14:58,227 INFO L82 PathProgramCache]: Analyzing trace with hash 1363487320, now seen corresponding path program 64 times [2018-10-10 15:14:58,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:14:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:00,517 INFO L134 CoverageAnalysis]: Checked inductivity of 6112 backedges. 0 proven. 6112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:00,517 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:00,517 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:15:00,518 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:15:00,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:15:00,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:15:00,518 INFO L87 Difference]: Start difference. First operand 357 states and 358 transitions. Second operand 68 states. [2018-10-10 15:15:03,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:03,487 INFO L93 Difference]: Finished difference Result 362 states and 363 transitions. [2018-10-10 15:15:03,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:15:03,487 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 297 [2018-10-10 15:15:03,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:03,489 INFO L225 Difference]: With dead ends: 362 [2018-10-10 15:15:03,489 INFO L226 Difference]: Without dead ends: 362 [2018-10-10 15:15:03,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:15:03,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-10 15:15:03,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 360. [2018-10-10 15:15:03,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-10-10 15:15:03,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 361 transitions. [2018-10-10 15:15:03,493 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 361 transitions. Word has length 297 [2018-10-10 15:15:03,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:03,493 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 361 transitions. [2018-10-10 15:15:03,493 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:15:03,493 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 361 transitions. [2018-10-10 15:15:03,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-10 15:15:03,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:03,494 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] [2018-10-10 15:15:03,494 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:03,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:03,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1552276214, now seen corresponding path program 65 times [2018-10-10 15:15:03,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:05,881 INFO L134 CoverageAnalysis]: Checked inductivity of 6305 backedges. 0 proven. 6305 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:05,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:05,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:15:05,882 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:15:05,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:15:05,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:15:05,883 INFO L87 Difference]: Start difference. First operand 360 states and 361 transitions. Second operand 69 states. [2018-10-10 15:15:08,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:08,945 INFO L93 Difference]: Finished difference Result 365 states and 366 transitions. [2018-10-10 15:15:08,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:15:08,946 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 300 [2018-10-10 15:15:08,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:08,947 INFO L225 Difference]: With dead ends: 365 [2018-10-10 15:15:08,947 INFO L226 Difference]: Without dead ends: 365 [2018-10-10 15:15:08,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:15:08,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-10 15:15:08,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 363. [2018-10-10 15:15:08,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-10 15:15:08,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 364 transitions. [2018-10-10 15:15:08,950 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 364 transitions. Word has length 300 [2018-10-10 15:15:08,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:08,951 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 364 transitions. [2018-10-10 15:15:08,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:15:08,951 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 364 transitions. [2018-10-10 15:15:08,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2018-10-10 15:15:08,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:08,952 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] [2018-10-10 15:15:08,952 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:08,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:08,953 INFO L82 PathProgramCache]: Analyzing trace with hash -644940392, now seen corresponding path program 66 times [2018-10-10 15:15:08,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:11,219 INFO L134 CoverageAnalysis]: Checked inductivity of 6501 backedges. 0 proven. 6501 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:11,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:11,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:15:11,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:15:11,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:15:11,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:15:11,220 INFO L87 Difference]: Start difference. First operand 363 states and 364 transitions. Second operand 70 states. [2018-10-10 15:15:14,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:14,166 INFO L93 Difference]: Finished difference Result 368 states and 369 transitions. [2018-10-10 15:15:14,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:15:14,167 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 303 [2018-10-10 15:15:14,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:14,168 INFO L225 Difference]: With dead ends: 368 [2018-10-10 15:15:14,168 INFO L226 Difference]: Without dead ends: 368 [2018-10-10 15:15:14,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:15:14,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2018-10-10 15:15:14,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 366. [2018-10-10 15:15:14,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-10 15:15:14,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 367 transitions. [2018-10-10 15:15:14,171 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 367 transitions. Word has length 303 [2018-10-10 15:15:14,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:14,172 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 367 transitions. [2018-10-10 15:15:14,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:15:14,172 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 367 transitions. [2018-10-10 15:15:14,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2018-10-10 15:15:14,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:14,173 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] [2018-10-10 15:15:14,173 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:14,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash 1671708598, now seen corresponding path program 67 times [2018-10-10 15:15:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:16,612 INFO L134 CoverageAnalysis]: Checked inductivity of 6700 backedges. 0 proven. 6700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:16,613 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:16,613 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:15:16,613 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:15:16,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:15:16,614 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:15:16,614 INFO L87 Difference]: Start difference. First operand 366 states and 367 transitions. Second operand 71 states. [2018-10-10 15:15:19,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:19,741 INFO L93 Difference]: Finished difference Result 371 states and 372 transitions. [2018-10-10 15:15:19,741 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:15:19,741 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 306 [2018-10-10 15:15:19,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:19,742 INFO L225 Difference]: With dead ends: 371 [2018-10-10 15:15:19,742 INFO L226 Difference]: Without dead ends: 371 [2018-10-10 15:15:19,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:15:19,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-10 15:15:19,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 369. [2018-10-10 15:15:19,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 369 states. [2018-10-10 15:15:19,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 369 states to 369 states and 370 transitions. [2018-10-10 15:15:19,747 INFO L78 Accepts]: Start accepts. Automaton has 369 states and 370 transitions. Word has length 306 [2018-10-10 15:15:19,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:19,747 INFO L481 AbstractCegarLoop]: Abstraction has 369 states and 370 transitions. [2018-10-10 15:15:19,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:15:19,747 INFO L276 IsEmpty]: Start isEmpty. Operand 369 states and 370 transitions. [2018-10-10 15:15:19,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2018-10-10 15:15:19,748 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:19,748 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] [2018-10-10 15:15:19,749 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:19,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:19,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1132290264, now seen corresponding path program 68 times [2018-10-10 15:15:19,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:19,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:22,071 INFO L134 CoverageAnalysis]: Checked inductivity of 6902 backedges. 0 proven. 6902 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:22,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:22,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:15:22,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:15:22,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:15:22,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:15:22,073 INFO L87 Difference]: Start difference. First operand 369 states and 370 transitions. Second operand 72 states. [2018-10-10 15:15:25,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:25,624 INFO L93 Difference]: Finished difference Result 374 states and 375 transitions. [2018-10-10 15:15:25,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:15:25,624 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 309 [2018-10-10 15:15:25,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:25,625 INFO L225 Difference]: With dead ends: 374 [2018-10-10 15:15:25,625 INFO L226 Difference]: Without dead ends: 374 [2018-10-10 15:15:25,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:15:25,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-10 15:15:25,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 372. [2018-10-10 15:15:25,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 372 states. [2018-10-10 15:15:25,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 372 states to 372 states and 373 transitions. [2018-10-10 15:15:25,629 INFO L78 Accepts]: Start accepts. Automaton has 372 states and 373 transitions. Word has length 309 [2018-10-10 15:15:25,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:25,629 INFO L481 AbstractCegarLoop]: Abstraction has 372 states and 373 transitions. [2018-10-10 15:15:25,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:15:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand 372 states and 373 transitions. [2018-10-10 15:15:25,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-10 15:15:25,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:25,630 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] [2018-10-10 15:15:25,631 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:25,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:25,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1206643594, now seen corresponding path program 69 times [2018-10-10 15:15:25,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:25,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 7107 backedges. 0 proven. 7107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:27,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:27,903 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:15:27,904 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:15:27,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:15:27,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:15:27,905 INFO L87 Difference]: Start difference. First operand 372 states and 373 transitions. Second operand 73 states. [2018-10-10 15:15:31,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:31,364 INFO L93 Difference]: Finished difference Result 377 states and 378 transitions. [2018-10-10 15:15:31,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:15:31,364 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 312 [2018-10-10 15:15:31,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:31,366 INFO L225 Difference]: With dead ends: 377 [2018-10-10 15:15:31,366 INFO L226 Difference]: Without dead ends: 377 [2018-10-10 15:15:31,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:15:31,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-10 15:15:31,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 375. [2018-10-10 15:15:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-10 15:15:31,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 376 transitions. [2018-10-10 15:15:31,371 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 376 transitions. Word has length 312 [2018-10-10 15:15:31,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:31,372 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 376 transitions. [2018-10-10 15:15:31,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:15:31,372 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 376 transitions. [2018-10-10 15:15:31,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-10 15:15:31,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:31,373 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] [2018-10-10 15:15:31,374 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:31,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:31,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1164203032, now seen corresponding path program 70 times [2018-10-10 15:15:31,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:33,726 INFO L134 CoverageAnalysis]: Checked inductivity of 7315 backedges. 0 proven. 7315 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:33,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:33,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:15:33,727 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:15:33,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:15:33,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:15:33,728 INFO L87 Difference]: Start difference. First operand 375 states and 376 transitions. Second operand 74 states. [2018-10-10 15:15:37,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:37,504 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-10 15:15:37,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:15:37,505 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 315 [2018-10-10 15:15:37,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:37,506 INFO L225 Difference]: With dead ends: 380 [2018-10-10 15:15:37,506 INFO L226 Difference]: Without dead ends: 380 [2018-10-10 15:15:37,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:15:37,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-10 15:15:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 378. [2018-10-10 15:15:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 378 states. [2018-10-10 15:15:37,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 378 states to 378 states and 379 transitions. [2018-10-10 15:15:37,510 INFO L78 Accepts]: Start accepts. Automaton has 378 states and 379 transitions. Word has length 315 [2018-10-10 15:15:37,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:37,510 INFO L481 AbstractCegarLoop]: Abstraction has 378 states and 379 transitions. [2018-10-10 15:15:37,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:15:37,511 INFO L276 IsEmpty]: Start isEmpty. Operand 378 states and 379 transitions. [2018-10-10 15:15:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-10 15:15:37,512 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:37,512 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] [2018-10-10 15:15:37,512 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:37,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:37,512 INFO L82 PathProgramCache]: Analyzing trace with hash 318855478, now seen corresponding path program 71 times [2018-10-10 15:15:37,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:37,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:39,909 INFO L134 CoverageAnalysis]: Checked inductivity of 7526 backedges. 0 proven. 7526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:39,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:39,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:15:39,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:15:39,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:15:39,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:15:39,911 INFO L87 Difference]: Start difference. First operand 378 states and 379 transitions. Second operand 75 states. [2018-10-10 15:15:43,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:43,777 INFO L93 Difference]: Finished difference Result 383 states and 384 transitions. [2018-10-10 15:15:43,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:15:43,777 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 318 [2018-10-10 15:15:43,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:43,778 INFO L225 Difference]: With dead ends: 383 [2018-10-10 15:15:43,778 INFO L226 Difference]: Without dead ends: 383 [2018-10-10 15:15:43,779 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:15:43,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-10 15:15:43,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 381. [2018-10-10 15:15:43,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 381 states. [2018-10-10 15:15:43,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 382 transitions. [2018-10-10 15:15:43,782 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 382 transitions. Word has length 318 [2018-10-10 15:15:43,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:43,782 INFO L481 AbstractCegarLoop]: Abstraction has 381 states and 382 transitions. [2018-10-10 15:15:43,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:15:43,782 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 382 transitions. [2018-10-10 15:15:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2018-10-10 15:15:43,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:43,783 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] [2018-10-10 15:15:43,784 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:43,784 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:43,784 INFO L82 PathProgramCache]: Analyzing trace with hash -2036869288, now seen corresponding path program 72 times [2018-10-10 15:15:43,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 7740 backedges. 0 proven. 7740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:46,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:46,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:15:46,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:15:46,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:15:46,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:15:46,495 INFO L87 Difference]: Start difference. First operand 381 states and 382 transitions. Second operand 76 states. [2018-10-10 15:15:49,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:49,933 INFO L93 Difference]: Finished difference Result 386 states and 387 transitions. [2018-10-10 15:15:49,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:15:49,933 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 321 [2018-10-10 15:15:49,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:49,934 INFO L225 Difference]: With dead ends: 386 [2018-10-10 15:15:49,934 INFO L226 Difference]: Without dead ends: 386 [2018-10-10 15:15:49,935 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:15:49,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-10 15:15:49,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 384. [2018-10-10 15:15:49,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 384 states. [2018-10-10 15:15:49,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 385 transitions. [2018-10-10 15:15:49,938 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 385 transitions. Word has length 321 [2018-10-10 15:15:49,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:49,938 INFO L481 AbstractCegarLoop]: Abstraction has 384 states and 385 transitions. [2018-10-10 15:15:49,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:15:49,938 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 385 transitions. [2018-10-10 15:15:49,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-10 15:15:49,939 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:49,939 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] [2018-10-10 15:15:49,940 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:49,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:49,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1667756554, now seen corresponding path program 73 times [2018-10-10 15:15:49,940 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:49,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:53,001 INFO L134 CoverageAnalysis]: Checked inductivity of 7957 backedges. 0 proven. 7957 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:53,001 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:53,002 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:15:53,002 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:15:53,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:15:53,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:15:53,003 INFO L87 Difference]: Start difference. First operand 384 states and 385 transitions. Second operand 77 states. [2018-10-10 15:15:56,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:15:56,991 INFO L93 Difference]: Finished difference Result 389 states and 390 transitions. [2018-10-10 15:15:56,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:15:56,991 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 324 [2018-10-10 15:15:56,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:15:56,992 INFO L225 Difference]: With dead ends: 389 [2018-10-10 15:15:56,993 INFO L226 Difference]: Without dead ends: 389 [2018-10-10 15:15:56,993 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:15:56,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-10 15:15:56,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 387. [2018-10-10 15:15:56,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 387 states. [2018-10-10 15:15:56,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 388 transitions. [2018-10-10 15:15:56,997 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 388 transitions. Word has length 324 [2018-10-10 15:15:56,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:15:56,998 INFO L481 AbstractCegarLoop]: Abstraction has 387 states and 388 transitions. [2018-10-10 15:15:56,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:15:56,998 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 388 transitions. [2018-10-10 15:15:56,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2018-10-10 15:15:56,999 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:15:56,999 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] [2018-10-10 15:15:56,999 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:15:56,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:15:56,999 INFO L82 PathProgramCache]: Analyzing trace with hash -546575720, now seen corresponding path program 74 times [2018-10-10 15:15:57,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:15:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:15:59,642 INFO L134 CoverageAnalysis]: Checked inductivity of 8177 backedges. 0 proven. 8177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:15:59,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:15:59,642 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:15:59,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:15:59,643 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:15:59,643 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:15:59,644 INFO L87 Difference]: Start difference. First operand 387 states and 388 transitions. Second operand 78 states. [2018-10-10 15:16:03,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:03,658 INFO L93 Difference]: Finished difference Result 392 states and 393 transitions. [2018-10-10 15:16:03,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:16:03,658 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 327 [2018-10-10 15:16:03,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:03,659 INFO L225 Difference]: With dead ends: 392 [2018-10-10 15:16:03,659 INFO L226 Difference]: Without dead ends: 392 [2018-10-10 15:16:03,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:16:03,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2018-10-10 15:16:03,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 390. [2018-10-10 15:16:03,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-10 15:16:03,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 391 transitions. [2018-10-10 15:16:03,663 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 391 transitions. Word has length 327 [2018-10-10 15:16:03,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:03,663 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 391 transitions. [2018-10-10 15:16:03,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:16:03,664 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 391 transitions. [2018-10-10 15:16:03,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2018-10-10 15:16:03,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:03,665 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] [2018-10-10 15:16:03,665 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:03,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:03,665 INFO L82 PathProgramCache]: Analyzing trace with hash -1409011018, now seen corresponding path program 75 times [2018-10-10 15:16:03,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:03,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8400 backedges. 0 proven. 8400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:06,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:16:06,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:16:06,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:16:06,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:16:06,555 INFO L87 Difference]: Start difference. First operand 390 states and 391 transitions. Second operand 79 states. [2018-10-10 15:16:10,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:10,461 INFO L93 Difference]: Finished difference Result 395 states and 396 transitions. [2018-10-10 15:16:10,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:16:10,461 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 330 [2018-10-10 15:16:10,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:10,462 INFO L225 Difference]: With dead ends: 395 [2018-10-10 15:16:10,462 INFO L226 Difference]: Without dead ends: 395 [2018-10-10 15:16:10,463 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-10 15:16:10,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-10 15:16:10,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 393. [2018-10-10 15:16:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-10 15:16:10,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 394 transitions. [2018-10-10 15:16:10,466 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 394 transitions. Word has length 330 [2018-10-10 15:16:10,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:10,467 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 394 transitions. [2018-10-10 15:16:10,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:16:10,467 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 394 transitions. [2018-10-10 15:16:10,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-10 15:16:10,468 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:10,468 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] [2018-10-10 15:16:10,468 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:10,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:10,468 INFO L82 PathProgramCache]: Analyzing trace with hash -1724609064, now seen corresponding path program 76 times [2018-10-10 15:16:10,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:10,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:13,454 INFO L134 CoverageAnalysis]: Checked inductivity of 8626 backedges. 0 proven. 8626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:13,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:13,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:16:13,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:16:13,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:16:13,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:16:13,456 INFO L87 Difference]: Start difference. First operand 393 states and 394 transitions. Second operand 80 states. [2018-10-10 15:16:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:17,601 INFO L93 Difference]: Finished difference Result 398 states and 399 transitions. [2018-10-10 15:16:17,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:16:17,601 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 333 [2018-10-10 15:16:17,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:17,602 INFO L225 Difference]: With dead ends: 398 [2018-10-10 15:16:17,603 INFO L226 Difference]: Without dead ends: 398 [2018-10-10 15:16:17,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:16:17,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2018-10-10 15:16:17,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 396. [2018-10-10 15:16:17,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 396 states. [2018-10-10 15:16:17,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 396 states to 396 states and 397 transitions. [2018-10-10 15:16:17,607 INFO L78 Accepts]: Start accepts. Automaton has 396 states and 397 transitions. Word has length 333 [2018-10-10 15:16:17,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:17,607 INFO L481 AbstractCegarLoop]: Abstraction has 396 states and 397 transitions. [2018-10-10 15:16:17,607 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:16:17,607 INFO L276 IsEmpty]: Start isEmpty. Operand 396 states and 397 transitions. [2018-10-10 15:16:17,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-10 15:16:17,608 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:17,608 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] [2018-10-10 15:16:17,609 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:17,609 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:17,609 INFO L82 PathProgramCache]: Analyzing trace with hash -2022586506, now seen corresponding path program 77 times [2018-10-10 15:16:17,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:17,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:20,364 INFO L134 CoverageAnalysis]: Checked inductivity of 8855 backedges. 0 proven. 8855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:20,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:20,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:16:20,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:16:20,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:16:20,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:16:20,366 INFO L87 Difference]: Start difference. First operand 396 states and 397 transitions. Second operand 81 states. [2018-10-10 15:16:24,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:24,602 INFO L93 Difference]: Finished difference Result 401 states and 402 transitions. [2018-10-10 15:16:24,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:16:24,602 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 336 [2018-10-10 15:16:24,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:24,603 INFO L225 Difference]: With dead ends: 401 [2018-10-10 15:16:24,603 INFO L226 Difference]: Without dead ends: 401 [2018-10-10 15:16:24,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:16:24,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-10 15:16:24,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 399. [2018-10-10 15:16:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-10 15:16:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-10-10 15:16:24,608 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 336 [2018-10-10 15:16:24,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:24,608 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-10-10 15:16:24,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:16:24,608 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-10-10 15:16:24,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 340 [2018-10-10 15:16:24,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:24,609 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] [2018-10-10 15:16:24,609 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:24,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:24,610 INFO L82 PathProgramCache]: Analyzing trace with hash -1371160296, now seen corresponding path program 78 times [2018-10-10 15:16:24,610 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:24,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:27,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9087 backedges. 0 proven. 9087 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:27,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:27,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:16:27,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:16:27,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:16:27,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:16:27,760 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 82 states. [2018-10-10 15:16:32,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:32,119 INFO L93 Difference]: Finished difference Result 404 states and 405 transitions. [2018-10-10 15:16:32,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:16:32,120 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 339 [2018-10-10 15:16:32,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:32,121 INFO L225 Difference]: With dead ends: 404 [2018-10-10 15:16:32,121 INFO L226 Difference]: Without dead ends: 404 [2018-10-10 15:16:32,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:16:32,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2018-10-10 15:16:32,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 402. [2018-10-10 15:16:32,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 402 states. [2018-10-10 15:16:32,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 403 transitions. [2018-10-10 15:16:32,125 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 403 transitions. Word has length 339 [2018-10-10 15:16:32,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:32,125 INFO L481 AbstractCegarLoop]: Abstraction has 402 states and 403 transitions. [2018-10-10 15:16:32,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:16:32,126 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 403 transitions. [2018-10-10 15:16:32,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-10 15:16:32,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:32,127 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] [2018-10-10 15:16:32,127 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:32,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:32,127 INFO L82 PathProgramCache]: Analyzing trace with hash 604818486, now seen corresponding path program 79 times [2018-10-10 15:16:32,128 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:32,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:35,099 INFO L134 CoverageAnalysis]: Checked inductivity of 9322 backedges. 0 proven. 9322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:35,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:35,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:16:35,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:16:35,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:16:35,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:16:35,100 INFO L87 Difference]: Start difference. First operand 402 states and 403 transitions. Second operand 83 states. [2018-10-10 15:16:39,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:39,681 INFO L93 Difference]: Finished difference Result 407 states and 408 transitions. [2018-10-10 15:16:39,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:16:39,681 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 342 [2018-10-10 15:16:39,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:39,683 INFO L225 Difference]: With dead ends: 407 [2018-10-10 15:16:39,683 INFO L226 Difference]: Without dead ends: 407 [2018-10-10 15:16:39,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:16:39,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-10 15:16:39,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 405. [2018-10-10 15:16:39,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-10 15:16:39,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-10-10 15:16:39,687 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 342 [2018-10-10 15:16:39,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:39,687 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-10-10 15:16:39,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:16:39,687 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-10-10 15:16:39,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 346 [2018-10-10 15:16:39,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:39,688 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] [2018-10-10 15:16:39,689 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:39,689 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:39,689 INFO L82 PathProgramCache]: Analyzing trace with hash 166954072, now seen corresponding path program 80 times [2018-10-10 15:16:39,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:42,728 INFO L134 CoverageAnalysis]: Checked inductivity of 9560 backedges. 0 proven. 9560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:42,728 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:42,728 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-10 15:16:42,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-10 15:16:42,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-10 15:16:42,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3406, Invalid=3566, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:16:42,729 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 84 states. [2018-10-10 15:16:47,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:47,357 INFO L93 Difference]: Finished difference Result 410 states and 411 transitions. [2018-10-10 15:16:47,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-10 15:16:47,358 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 345 [2018-10-10 15:16:47,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:47,359 INFO L225 Difference]: With dead ends: 410 [2018-10-10 15:16:47,359 INFO L226 Difference]: Without dead ends: 410 [2018-10-10 15:16:47,361 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3240 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10126, Invalid=16606, Unknown=0, NotChecked=0, Total=26732 [2018-10-10 15:16:47,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-10 15:16:47,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 408. [2018-10-10 15:16:47,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 408 states. [2018-10-10 15:16:47,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 408 states to 408 states and 409 transitions. [2018-10-10 15:16:47,364 INFO L78 Accepts]: Start accepts. Automaton has 408 states and 409 transitions. Word has length 345 [2018-10-10 15:16:47,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:47,364 INFO L481 AbstractCegarLoop]: Abstraction has 408 states and 409 transitions. [2018-10-10 15:16:47,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-10 15:16:47,364 INFO L276 IsEmpty]: Start isEmpty. Operand 408 states and 409 transitions. [2018-10-10 15:16:47,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-10 15:16:47,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:47,366 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] [2018-10-10 15:16:47,366 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:47,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:47,366 INFO L82 PathProgramCache]: Analyzing trace with hash -436125450, now seen corresponding path program 81 times [2018-10-10 15:16:47,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:50,449 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:50,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:50,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-10 15:16:50,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-10 15:16:50,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-10 15:16:50,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3489, Invalid=3651, Unknown=0, NotChecked=0, Total=7140 [2018-10-10 15:16:50,450 INFO L87 Difference]: Start difference. First operand 408 states and 409 transitions. Second operand 85 states. [2018-10-10 15:16:54,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:16:54,940 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-10-10 15:16:54,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-10 15:16:54,940 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 348 [2018-10-10 15:16:54,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:16:54,942 INFO L225 Difference]: With dead ends: 413 [2018-10-10 15:16:54,942 INFO L226 Difference]: Without dead ends: 413 [2018-10-10 15:16:54,943 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10374, Invalid=17016, Unknown=0, NotChecked=0, Total=27390 [2018-10-10 15:16:54,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-10 15:16:54,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 411. [2018-10-10 15:16:54,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-10 15:16:54,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-10-10 15:16:54,946 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 348 [2018-10-10 15:16:54,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:16:54,946 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-10-10 15:16:54,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-10 15:16:54,946 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-10-10 15:16:54,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2018-10-10 15:16:54,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:16:54,947 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] [2018-10-10 15:16:54,948 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:16:54,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:16:54,948 INFO L82 PathProgramCache]: Analyzing trace with hash -929966184, now seen corresponding path program 82 times [2018-10-10 15:16:54,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:16:54,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:16:58,273 INFO L134 CoverageAnalysis]: Checked inductivity of 10045 backedges. 0 proven. 10045 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:16:58,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:16:58,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-10 15:16:58,274 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-10 15:16:58,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-10 15:16:58,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3573, Invalid=3737, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:16:58,275 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 86 states. [2018-10-10 15:17:03,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:03,177 INFO L93 Difference]: Finished difference Result 416 states and 417 transitions. [2018-10-10 15:17:03,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-10 15:17:03,177 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 351 [2018-10-10 15:17:03,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:03,178 INFO L225 Difference]: With dead ends: 416 [2018-10-10 15:17:03,179 INFO L226 Difference]: Without dead ends: 416 [2018-10-10 15:17:03,179 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-10 15:17:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-10 15:17:03,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 414. [2018-10-10 15:17:03,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-10 15:17:03,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 415 transitions. [2018-10-10 15:17:03,183 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 415 transitions. Word has length 351 [2018-10-10 15:17:03,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:03,183 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 415 transitions. [2018-10-10 15:17:03,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-10 15:17:03,183 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 415 transitions. [2018-10-10 15:17:03,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-10 15:17:03,184 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:03,184 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] [2018-10-10 15:17:03,185 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:03,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:03,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1618683318, now seen corresponding path program 83 times [2018-10-10 15:17:03,185 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:03,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:06,368 INFO L134 CoverageAnalysis]: Checked inductivity of 10292 backedges. 0 proven. 10292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:06,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:06,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-10 15:17:06,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-10 15:17:06,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-10 15:17:06,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3658, Invalid=3824, Unknown=0, NotChecked=0, Total=7482 [2018-10-10 15:17:06,370 INFO L87 Difference]: Start difference. First operand 414 states and 415 transitions. Second operand 87 states. [2018-10-10 15:17:10,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:10,961 INFO L93 Difference]: Finished difference Result 419 states and 420 transitions. [2018-10-10 15:17:10,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-10 15:17:10,961 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 354 [2018-10-10 15:17:10,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:10,963 INFO L225 Difference]: With dead ends: 419 [2018-10-10 15:17:10,963 INFO L226 Difference]: Without dead ends: 419 [2018-10-10 15:17:10,964 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10879, Invalid=17851, Unknown=0, NotChecked=0, Total=28730 [2018-10-10 15:17:10,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-10 15:17:10,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 417. [2018-10-10 15:17:10,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-10 15:17:10,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 418 transitions. [2018-10-10 15:17:10,967 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 418 transitions. Word has length 354 [2018-10-10 15:17:10,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:10,968 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 418 transitions. [2018-10-10 15:17:10,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-10 15:17:10,968 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 418 transitions. [2018-10-10 15:17:10,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-10 15:17:10,969 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:10,969 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] [2018-10-10 15:17:10,969 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:10,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:10,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2004138712, now seen corresponding path program 84 times [2018-10-10 15:17:10,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 10542 backedges. 0 proven. 10542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:14,447 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:14,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-10 15:17:14,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-10 15:17:14,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-10 15:17:14,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3744, Invalid=3912, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:17:14,448 INFO L87 Difference]: Start difference. First operand 417 states and 418 transitions. Second operand 88 states. [2018-10-10 15:17:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:19,453 INFO L93 Difference]: Finished difference Result 422 states and 423 transitions. [2018-10-10 15:17:19,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-10 15:17:19,454 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 357 [2018-10-10 15:17:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:19,455 INFO L225 Difference]: With dead ends: 422 [2018-10-10 15:17:19,455 INFO L226 Difference]: Without dead ends: 422 [2018-10-10 15:17:19,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3570 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11136, Invalid=18276, Unknown=0, NotChecked=0, Total=29412 [2018-10-10 15:17:19,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2018-10-10 15:17:19,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 420. [2018-10-10 15:17:19,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 420 states. [2018-10-10 15:17:19,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 421 transitions. [2018-10-10 15:17:19,460 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 421 transitions. Word has length 357 [2018-10-10 15:17:19,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:19,460 INFO L481 AbstractCegarLoop]: Abstraction has 420 states and 421 transitions. [2018-10-10 15:17:19,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-10 15:17:19,461 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 421 transitions. [2018-10-10 15:17:19,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-10 15:17:19,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:19,462 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] [2018-10-10 15:17:19,463 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:19,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:19,463 INFO L82 PathProgramCache]: Analyzing trace with hash 363231862, now seen corresponding path program 85 times [2018-10-10 15:17:19,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:19,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:23,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10795 backedges. 0 proven. 10795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:23,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:23,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-10 15:17:23,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-10 15:17:23,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-10 15:17:23,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3831, Invalid=4001, Unknown=0, NotChecked=0, Total=7832 [2018-10-10 15:17:23,049 INFO L87 Difference]: Start difference. First operand 420 states and 421 transitions. Second operand 89 states. [2018-10-10 15:17:27,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:27,854 INFO L93 Difference]: Finished difference Result 425 states and 426 transitions. [2018-10-10 15:17:27,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-10 15:17:27,854 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 360 [2018-10-10 15:17:27,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:27,856 INFO L225 Difference]: With dead ends: 425 [2018-10-10 15:17:27,856 INFO L226 Difference]: Without dead ends: 425 [2018-10-10 15:17:27,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11396, Invalid=18706, Unknown=0, NotChecked=0, Total=30102 [2018-10-10 15:17:27,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-10 15:17:27,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 423. [2018-10-10 15:17:27,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-10 15:17:27,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 424 transitions. [2018-10-10 15:17:27,860 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 424 transitions. Word has length 360 [2018-10-10 15:17:27,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:27,861 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 424 transitions. [2018-10-10 15:17:27,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-10 15:17:27,861 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 424 transitions. [2018-10-10 15:17:27,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 364 [2018-10-10 15:17:27,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:27,863 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] [2018-10-10 15:17:27,863 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:27,863 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:27,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1425026584, now seen corresponding path program 86 times [2018-10-10 15:17:27,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:27,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:31,364 INFO L134 CoverageAnalysis]: Checked inductivity of 11051 backedges. 0 proven. 11051 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:31,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:31,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-10 15:17:31,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-10 15:17:31,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-10 15:17:31,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3919, Invalid=4091, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:17:31,366 INFO L87 Difference]: Start difference. First operand 423 states and 424 transitions. Second operand 90 states. [2018-10-10 15:17:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:36,582 INFO L93 Difference]: Finished difference Result 428 states and 429 transitions. [2018-10-10 15:17:36,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-10 15:17:36,583 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 363 [2018-10-10 15:17:36,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:36,584 INFO L225 Difference]: With dead ends: 428 [2018-10-10 15:17:36,584 INFO L226 Difference]: Without dead ends: 428 [2018-10-10 15:17:36,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3741 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11659, Invalid=19141, Unknown=0, NotChecked=0, Total=30800 [2018-10-10 15:17:36,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2018-10-10 15:17:36,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 426. [2018-10-10 15:17:36,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 426 states. [2018-10-10 15:17:36,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 427 transitions. [2018-10-10 15:17:36,588 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 427 transitions. Word has length 363 [2018-10-10 15:17:36,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:36,588 INFO L481 AbstractCegarLoop]: Abstraction has 426 states and 427 transitions. [2018-10-10 15:17:36,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-10 15:17:36,588 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 427 transitions. [2018-10-10 15:17:36,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2018-10-10 15:17:36,589 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:36,590 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] [2018-10-10 15:17:36,590 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:36,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:36,590 INFO L82 PathProgramCache]: Analyzing trace with hash 917454646, now seen corresponding path program 87 times [2018-10-10 15:17:36,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:40,365 INFO L134 CoverageAnalysis]: Checked inductivity of 11310 backedges. 0 proven. 11310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:40,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:40,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-10 15:17:40,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-10 15:17:40,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-10 15:17:40,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4008, Invalid=4182, Unknown=0, NotChecked=0, Total=8190 [2018-10-10 15:17:40,367 INFO L87 Difference]: Start difference. First operand 426 states and 427 transitions. Second operand 91 states. [2018-10-10 15:17:45,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:45,647 INFO L93 Difference]: Finished difference Result 431 states and 432 transitions. [2018-10-10 15:17:45,648 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-10 15:17:45,648 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 366 [2018-10-10 15:17:45,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:45,649 INFO L225 Difference]: With dead ends: 431 [2018-10-10 15:17:45,649 INFO L226 Difference]: Without dead ends: 431 [2018-10-10 15:17:45,650 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=11925, Invalid=19581, Unknown=0, NotChecked=0, Total=31506 [2018-10-10 15:17:45,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-10 15:17:45,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 429. [2018-10-10 15:17:45,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 429 states. [2018-10-10 15:17:45,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 430 transitions. [2018-10-10 15:17:45,653 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 430 transitions. Word has length 366 [2018-10-10 15:17:45,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:45,653 INFO L481 AbstractCegarLoop]: Abstraction has 429 states and 430 transitions. [2018-10-10 15:17:45,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-10 15:17:45,653 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 430 transitions. [2018-10-10 15:17:45,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 370 [2018-10-10 15:17:45,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:45,654 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] [2018-10-10 15:17:45,655 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:45,655 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:45,655 INFO L82 PathProgramCache]: Analyzing trace with hash -1873268392, now seen corresponding path program 88 times [2018-10-10 15:17:45,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:45,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:49,418 INFO L134 CoverageAnalysis]: Checked inductivity of 11572 backedges. 0 proven. 11572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:49,418 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:49,419 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-10 15:17:49,419 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-10 15:17:49,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-10 15:17:49,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4098, Invalid=4274, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:17:49,420 INFO L87 Difference]: Start difference. First operand 429 states and 430 transitions. Second operand 92 states. [2018-10-10 15:17:54,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:17:54,688 INFO L93 Difference]: Finished difference Result 434 states and 435 transitions. [2018-10-10 15:17:54,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-10 15:17:54,689 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 369 [2018-10-10 15:17:54,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:17:54,690 INFO L225 Difference]: With dead ends: 434 [2018-10-10 15:17:54,690 INFO L226 Difference]: Without dead ends: 434 [2018-10-10 15:17:54,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3916 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12194, Invalid=20026, Unknown=0, NotChecked=0, Total=32220 [2018-10-10 15:17:54,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2018-10-10 15:17:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 432. [2018-10-10 15:17:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-10 15:17:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 433 transitions. [2018-10-10 15:17:54,695 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 433 transitions. Word has length 369 [2018-10-10 15:17:54,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:17:54,695 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 433 transitions. [2018-10-10 15:17:54,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-10 15:17:54,695 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 433 transitions. [2018-10-10 15:17:54,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-10 15:17:54,696 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:17:54,696 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] [2018-10-10 15:17:54,696 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:17:54,697 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:17:54,697 INFO L82 PathProgramCache]: Analyzing trace with hash 1673622518, now seen corresponding path program 89 times [2018-10-10 15:17:54,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:17:54,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:17:58,249 INFO L134 CoverageAnalysis]: Checked inductivity of 11837 backedges. 0 proven. 11837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:17:58,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:17:58,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-10 15:17:58,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-10 15:17:58,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-10 15:17:58,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4189, Invalid=4367, Unknown=0, NotChecked=0, Total=8556 [2018-10-10 15:17:58,251 INFO L87 Difference]: Start difference. First operand 432 states and 433 transitions. Second operand 93 states. [2018-10-10 15:18:03,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:03,615 INFO L93 Difference]: Finished difference Result 437 states and 438 transitions. [2018-10-10 15:18:03,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-10 15:18:03,616 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 372 [2018-10-10 15:18:03,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:03,617 INFO L225 Difference]: With dead ends: 437 [2018-10-10 15:18:03,617 INFO L226 Difference]: Without dead ends: 437 [2018-10-10 15:18:03,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 182 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 180 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=12466, Invalid=20476, Unknown=0, NotChecked=0, Total=32942 [2018-10-10 15:18:03,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-10 15:18:03,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 435. [2018-10-10 15:18:03,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 435 states. [2018-10-10 15:18:03,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 435 states to 435 states and 436 transitions. [2018-10-10 15:18:03,622 INFO L78 Accepts]: Start accepts. Automaton has 435 states and 436 transitions. Word has length 372 [2018-10-10 15:18:03,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:03,622 INFO L481 AbstractCegarLoop]: Abstraction has 435 states and 436 transitions. [2018-10-10 15:18:03,622 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-10 15:18:03,622 INFO L276 IsEmpty]: Start isEmpty. Operand 435 states and 436 transitions. [2018-10-10 15:18:03,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-10 15:18:03,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:03,624 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] [2018-10-10 15:18:03,624 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:03,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:03,624 INFO L82 PathProgramCache]: Analyzing trace with hash -1979661160, now seen corresponding path program 90 times [2018-10-10 15:18:03,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12105 backedges. 0 proven. 12105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:07,491 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:07,491 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-10 15:18:07,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-10 15:18:07,492 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-10 15:18:07,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4281, Invalid=4461, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:18:07,493 INFO L87 Difference]: Start difference. First operand 435 states and 436 transitions. Second operand 94 states. [2018-10-10 15:18:12,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:12,839 INFO L93 Difference]: Finished difference Result 440 states and 441 transitions. [2018-10-10 15:18:12,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-10 15:18:12,840 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 375 [2018-10-10 15:18:12,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:12,841 INFO L225 Difference]: With dead ends: 440 [2018-10-10 15:18:12,841 INFO L226 Difference]: Without dead ends: 440 [2018-10-10 15:18:12,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4095 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=12741, Invalid=20931, Unknown=0, NotChecked=0, Total=33672 [2018-10-10 15:18:12,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-10 15:18:12,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 438. [2018-10-10 15:18:12,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 438 states. [2018-10-10 15:18:12,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 438 states to 438 states and 439 transitions. [2018-10-10 15:18:12,845 INFO L78 Accepts]: Start accepts. Automaton has 438 states and 439 transitions. Word has length 375 [2018-10-10 15:18:12,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:12,846 INFO L481 AbstractCegarLoop]: Abstraction has 438 states and 439 transitions. [2018-10-10 15:18:12,846 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-10 15:18:12,846 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 439 transitions. [2018-10-10 15:18:12,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 379 [2018-10-10 15:18:12,847 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:12,847 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] [2018-10-10 15:18:12,847 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:12,847 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:12,848 INFO L82 PathProgramCache]: Analyzing trace with hash 1812535478, now seen corresponding path program 91 times [2018-10-10 15:18:12,848 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:16,870 INFO L134 CoverageAnalysis]: Checked inductivity of 12376 backedges. 0 proven. 12376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:16,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:16,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-10 15:18:16,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-10 15:18:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-10 15:18:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4374, Invalid=4556, Unknown=0, NotChecked=0, Total=8930 [2018-10-10 15:18:16,871 INFO L87 Difference]: Start difference. First operand 438 states and 439 transitions. Second operand 95 states. [2018-10-10 15:18:22,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:22,447 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-10-10 15:18:22,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-10 15:18:22,448 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 378 [2018-10-10 15:18:22,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:22,449 INFO L225 Difference]: With dead ends: 443 [2018-10-10 15:18:22,449 INFO L226 Difference]: Without dead ends: 443 [2018-10-10 15:18:22,450 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13019, Invalid=21391, Unknown=0, NotChecked=0, Total=34410 [2018-10-10 15:18:22,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-10 15:18:22,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2018-10-10 15:18:22,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 441 states. [2018-10-10 15:18:22,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 442 transitions. [2018-10-10 15:18:22,454 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 442 transitions. Word has length 378 [2018-10-10 15:18:22,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:22,454 INFO L481 AbstractCegarLoop]: Abstraction has 441 states and 442 transitions. [2018-10-10 15:18:22,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-10 15:18:22,454 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 442 transitions. [2018-10-10 15:18:22,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 382 [2018-10-10 15:18:22,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:22,456 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] [2018-10-10 15:18:22,456 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:22,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:22,456 INFO L82 PathProgramCache]: Analyzing trace with hash 322824152, now seen corresponding path program 92 times [2018-10-10 15:18:22,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:22,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 12650 backedges. 0 proven. 12650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:26,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:26,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-10 15:18:26,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-10 15:18:26,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-10 15:18:26,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4468, Invalid=4652, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:18:26,660 INFO L87 Difference]: Start difference. First operand 441 states and 442 transitions. Second operand 96 states. [2018-10-10 15:18:32,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:32,228 INFO L93 Difference]: Finished difference Result 446 states and 447 transitions. [2018-10-10 15:18:32,228 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-10 15:18:32,228 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 381 [2018-10-10 15:18:32,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:32,229 INFO L225 Difference]: With dead ends: 446 [2018-10-10 15:18:32,230 INFO L226 Difference]: Without dead ends: 446 [2018-10-10 15:18:32,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4278 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=13300, Invalid=21856, Unknown=0, NotChecked=0, Total=35156 [2018-10-10 15:18:32,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2018-10-10 15:18:32,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 444. [2018-10-10 15:18:32,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 444 states. [2018-10-10 15:18:32,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 444 states to 444 states and 445 transitions. [2018-10-10 15:18:32,234 INFO L78 Accepts]: Start accepts. Automaton has 444 states and 445 transitions. Word has length 381 [2018-10-10 15:18:32,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:32,234 INFO L481 AbstractCegarLoop]: Abstraction has 444 states and 445 transitions. [2018-10-10 15:18:32,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-10 15:18:32,234 INFO L276 IsEmpty]: Start isEmpty. Operand 444 states and 445 transitions. [2018-10-10 15:18:32,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 385 [2018-10-10 15:18:32,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:32,236 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] [2018-10-10 15:18:32,236 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:32,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:32,236 INFO L82 PathProgramCache]: Analyzing trace with hash 229780854, now seen corresponding path program 93 times [2018-10-10 15:18:32,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:32,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:36,438 INFO L134 CoverageAnalysis]: Checked inductivity of 12927 backedges. 0 proven. 12927 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:18:36,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:36,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-10 15:18:36,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-10 15:18:36,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-10 15:18:36,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4563, Invalid=4749, Unknown=0, NotChecked=0, Total=9312 [2018-10-10 15:18:36,440 INFO L87 Difference]: Start difference. First operand 444 states and 445 transitions. Second operand 97 states. [2018-10-10 15:18:42,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:42,271 INFO L93 Difference]: Finished difference Result 447 states and 448 transitions. [2018-10-10 15:18:42,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-10 15:18:42,271 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 384 [2018-10-10 15:18:42,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:42,272 INFO L225 Difference]: With dead ends: 447 [2018-10-10 15:18:42,272 INFO L226 Difference]: Without dead ends: 447 [2018-10-10 15:18:42,274 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 190 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=13584, Invalid=22326, Unknown=0, NotChecked=0, Total=35910 [2018-10-10 15:18:42,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2018-10-10 15:18:42,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 447. [2018-10-10 15:18:42,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 447 states. [2018-10-10 15:18:42,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 448 transitions. [2018-10-10 15:18:42,277 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 448 transitions. Word has length 384 [2018-10-10 15:18:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:42,277 INFO L481 AbstractCegarLoop]: Abstraction has 447 states and 448 transitions. [2018-10-10 15:18:42,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-10 15:18:42,277 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 448 transitions. [2018-10-10 15:18:42,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 388 [2018-10-10 15:18:42,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:42,279 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] [2018-10-10 15:18:42,279 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:42,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:42,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1369203944, now seen corresponding path program 94 times [2018-10-10 15:18:42,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:42,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 13207 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:18:44,198 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:18:44,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2018-10-10 15:18:44,199 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:18:44,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:18:44,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=304, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:18:44,200 INFO L87 Difference]: Start difference. First operand 447 states and 448 transitions. Second operand 19 states. [2018-10-10 15:18:44,656 WARN L178 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-10 15:18:45,126 WARN L178 SmtUtils]: Spent 153.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2018-10-10 15:18:46,021 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 32 DAG size of output: 31 [2018-10-10 15:18:47,562 WARN L178 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 75 [2018-10-10 15:18:48,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:48,836 INFO L93 Difference]: Finished difference Result 520 states and 521 transitions. [2018-10-10 15:18:48,837 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:18:48,837 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 387 [2018-10-10 15:18:48,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:48,839 INFO L225 Difference]: With dead ends: 520 [2018-10-10 15:18:48,840 INFO L226 Difference]: Without dead ends: 520 [2018-10-10 15:18:48,840 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 16 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=420, Invalid=1220, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:18:48,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-10 15:18:48,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 460. [2018-10-10 15:18:48,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-10 15:18:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 461 transitions. [2018-10-10 15:18:48,843 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 461 transitions. Word has length 387 [2018-10-10 15:18:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:48,844 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 461 transitions. [2018-10-10 15:18:48,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:18:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 461 transitions. [2018-10-10 15:18:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-10 15:18:48,846 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:48,846 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:18:48,846 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:48,846 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:48,847 INFO L82 PathProgramCache]: Analyzing trace with hash -56057476, now seen corresponding path program 1 times [2018-10-10 15:18:48,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:48,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:49,648 INFO L134 CoverageAnalysis]: Checked inductivity of 13220 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:18:49,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:49,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:18:49,649 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:18:49,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:18:49,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:18:49,649 INFO L87 Difference]: Start difference. First operand 460 states and 461 transitions. Second operand 13 states. [2018-10-10 15:18:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:50,653 INFO L93 Difference]: Finished difference Result 592 states and 593 transitions. [2018-10-10 15:18:50,654 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:18:50,654 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 459 [2018-10-10 15:18:50,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:50,657 INFO L225 Difference]: With dead ends: 592 [2018-10-10 15:18:50,657 INFO L226 Difference]: Without dead ends: 592 [2018-10-10 15:18:50,658 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=169, Invalid=383, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:18:50,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2018-10-10 15:18:50,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 532. [2018-10-10 15:18:50,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 532 states. [2018-10-10 15:18:50,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 533 transitions. [2018-10-10 15:18:50,664 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 533 transitions. Word has length 459 [2018-10-10 15:18:50,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:50,665 INFO L481 AbstractCegarLoop]: Abstraction has 532 states and 533 transitions. [2018-10-10 15:18:50,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:18:50,665 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 533 transitions. [2018-10-10 15:18:50,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 532 [2018-10-10 15:18:50,668 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:50,669 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2018-10-10 15:18:50,669 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:50,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:50,669 INFO L82 PathProgramCache]: Analyzing trace with hash -1778523168, now seen corresponding path program 2 times [2018-10-10 15:18:50,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 13305 backedges. 0 proven. 98 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:18:52,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:52,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:18:52,602 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:18:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:18:52,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:18:52,603 INFO L87 Difference]: Start difference. First operand 532 states and 533 transitions. Second operand 15 states. [2018-10-10 15:18:53,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:18:53,752 INFO L93 Difference]: Finished difference Result 664 states and 665 transitions. [2018-10-10 15:18:53,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:18:53,753 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 531 [2018-10-10 15:18:53,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:18:53,757 INFO L225 Difference]: With dead ends: 664 [2018-10-10 15:18:53,757 INFO L226 Difference]: Without dead ends: 664 [2018-10-10 15:18:53,758 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 69 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:18:53,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-10 15:18:53,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 604. [2018-10-10 15:18:53,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 604 states. [2018-10-10 15:18:53,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 604 states to 604 states and 605 transitions. [2018-10-10 15:18:53,764 INFO L78 Accepts]: Start accepts. Automaton has 604 states and 605 transitions. Word has length 531 [2018-10-10 15:18:53,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:18:53,766 INFO L481 AbstractCegarLoop]: Abstraction has 604 states and 605 transitions. [2018-10-10 15:18:53,766 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:18:53,766 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 605 transitions. [2018-10-10 15:18:53,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2018-10-10 15:18:53,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:18:53,770 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 94, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2018-10-10 15:18:53,770 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:18:53,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:18:53,771 INFO L82 PathProgramCache]: Analyzing trace with hash -1266195900, now seen corresponding path program 3 times [2018-10-10 15:18:53,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:18:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:18:58,781 INFO L134 CoverageAnalysis]: Checked inductivity of 13462 backedges. 74 proven. 181 refuted. 0 times theorem prover too weak. 13207 trivial. 0 not checked. [2018-10-10 15:18:58,781 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:18:58,782 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:18:58,783 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:18:58,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:18:58,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=1027, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:18:58,783 INFO L87 Difference]: Start difference. First operand 604 states and 605 transitions. Second operand 34 states. [2018-10-10 15:19:05,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:19:05,019 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-10 15:19:05,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:19:05,019 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 603 [2018-10-10 15:19:05,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:19:05,020 INFO L225 Difference]: With dead ends: 598 [2018-10-10 15:19:05,020 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:19:05,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 67 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1728 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=668, Invalid=4444, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:19:05,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:19:05,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:19:05,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:19:05,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:19:05,021 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 603 [2018-10-10 15:19:05,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:19:05,021 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:19:05,022 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:19:05,022 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:19:05,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:19:05,026 INFO L202 PluginConnector]: Adding new model 20051113-1.c_false-valid-memtrack.i_46.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:19:05 BoogieIcfgContainer [2018-10-10 15:19:05,027 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:19:05,028 INFO L168 Benchmark]: Toolchain (without parser) took 391130.88 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 148.9 MB). Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 20.5 MB). Peak memory consumption was 169.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:19:05,028 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:19:05,029 INFO L168 Benchmark]: Boogie Preprocessor took 91.62 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:19:05,029 INFO L168 Benchmark]: RCFGBuilder took 1076.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:19:05,030 INFO L168 Benchmark]: TraceAbstraction took 389957.72 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 148.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -21.8 MB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:19:05,032 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 91.62 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 1076.80 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 42.3 MB). Peak memory consumption was 42.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 389957.72 ms. Allocated memory was 1.5 GB in the beginning and 1.7 GB in the end (delta: 148.9 MB). Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: -21.8 MB). Peak memory consumption was 127.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 246]: 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, 169 locations, 1 error locations. SAFE Result, 389.8s OverallTime, 98 OverallIterations, 94 TraceHistogramMax, 224.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 15760 SDtfs, 38394 SDslu, 505298 SDs, 0 SdLazy, 36220 SolverSat, 5082 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 36.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9367 GetRequests, 196 SyntacticMatches, 83 SemanticMatches, 9088 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140443 ImplicationChecksByTransitivity, 325.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=604occurred in iteration=97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 98 MinimizatonAttempts, 366 StatesRemovedByMinimization, 96 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 153.9s InterpolantComputationTime, 24963 NumberOfCodeBlocks, 24963 NumberOfCodeBlocksAsserted, 98 NumberOfCheckSat, 24865 ConstructedInterpolants, 0 QuantifiedInterpolants, 32303571 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 98 InterpolantComputations, 2 PerfectInterpolantSequences, 52902/459697 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_46.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-19-05-044.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/20051113-1.c_false-valid-memtrack.i_46.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-19-05-044.csv Received shutdown request...