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/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 22:38:18,787 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:38:18,790 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:38:18,808 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:38:18,808 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:38:18,809 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:38:18,811 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:38:18,812 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:38:18,814 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:38:18,815 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:38:18,816 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:38:18,816 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:38:18,817 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:38:18,818 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:38:18,819 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:38:18,820 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:38:18,821 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:38:18,823 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:38:18,825 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:38:18,827 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:38:18,828 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:38:18,829 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:38:18,831 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:38:18,831 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:38:18,832 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:38:18,833 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:38:18,834 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:38:18,835 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:38:18,835 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:38:18,836 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:38:18,837 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:38:18,837 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:38:18,838 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:38:18,838 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:38:18,839 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:38:18,840 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:38:18,840 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 22:38:18,857 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:38:18,857 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:38:18,858 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:38:18,858 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:38:18,858 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:38:18,859 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:38:18,861 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:38:18,861 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:38:18,861 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:38:18,861 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:38:18,862 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:38:18,862 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:38:18,862 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:38:18,864 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:38:18,864 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:38:18,911 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:38:18,928 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:38:18,932 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:38:18,934 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:38:18,935 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:38:18,936 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl [2018-10-12 22:38:18,936 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl' [2018-10-12 22:38:18,999 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:38:19,001 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:38:19,001 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:38:19,002 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:38:19,002 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:38:19,036 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,055 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,060 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,064 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,065 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... [2018-10-12 22:38:19,067 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:38:19,068 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:38:19,069 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:38:19,069 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:38:19,071 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 22:38:19,148 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:38:19,149 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:38:19,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:38:19,674 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:38:19,675 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:38:19 BoogieIcfgContainer [2018-10-12 22:38:19,675 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:38:19,676 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:38:19,676 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:38:19,677 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:38:19,681 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:38:19" (1/1) ... [2018-10-12 22:38:19,690 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:38:19,691 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:38:19,726 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:38:19,768 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:38:19,786 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:38:19,861 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:38:21,833 INFO L315 AbstractInterpreter]: Visited 35 different actions 55 times. Merged at 16 different actions 19 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 0 variables. [2018-10-12 22:38:21,835 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:38:21,840 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:38:21,954 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:38:21,955 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:38:21,955 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:38:21,956 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:38:21,956 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-12 22:38:21,956 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:38:21,956 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-12 22:38:21,957 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-12 22:38:21,957 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:38:21,957 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:38:21,957 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:38:21,957 INFO L248 HeapPartitionManager]: # location blocks :2 [2018-10-12 22:38:21,958 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:38:21,958 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 0 [2018-10-12 22:38:21,959 INFO L248 HeapPartitionManager]: # location blocks :0 [2018-10-12 22:38:21,962 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:38:21,977 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:38:21 BasicIcfg [2018-10-12 22:38:21,978 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:38:21,979 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:38:21,979 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:38:21,986 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:38:21,986 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:38:18" (1/3) ... [2018-10-12 22:38:21,988 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d6b9fc and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:38:21, skipping insertion in model container [2018-10-12 22:38:21,988 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:38:19" (2/3) ... [2018-10-12 22:38:21,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d6b9fc and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:38:21, skipping insertion in model container [2018-10-12 22:38:21,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:38:21" (3/3) ... [2018-10-12 22:38:21,995 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:38:22,007 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:38:22,017 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:38:22,036 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:38:22,065 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:38:22,066 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:38:22,066 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:38:22,066 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:38:22,067 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:38:22,067 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:38:22,067 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:38:22,071 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:38:22,071 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:38:22,087 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-12 22:38:22,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-12 22:38:22,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:22,102 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] [2018-10-12 22:38:22,104 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:22,110 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:22,111 INFO L82 PathProgramCache]: Analyzing trace with hash 1256127758, now seen corresponding path program 1 times [2018-10-12 22:38:22,179 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:22,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:22,721 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:22,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:38:22,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-12 22:38:22,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 22:38:22,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 22:38:22,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-12 22:38:22,743 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 9 states. [2018-10-12 22:38:23,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:23,433 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-12 22:38:23,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 22:38:23,436 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-12 22:38:23,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:23,447 INFO L225 Difference]: With dead ends: 46 [2018-10-12 22:38:23,447 INFO L226 Difference]: Without dead ends: 46 [2018-10-12 22:38:23,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-12 22:38:23,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-12 22:38:23,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-10-12 22:38:23,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-12 22:38:23,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-12 22:38:23,559 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 24 [2018-10-12 22:38:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:23,560 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-12 22:38:23,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 22:38:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-12 22:38:23,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-12 22:38:23,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:23,562 INFO L375 BasicCegarLoop]: trace histogram [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] [2018-10-12 22:38:23,564 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:23,564 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:23,564 INFO L82 PathProgramCache]: Analyzing trace with hash -919393243, now seen corresponding path program 1 times [2018-10-12 22:38:23,566 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:23,954 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:23,954 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:23,955 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 22:38:23,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 22:38:23,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 22:38:23,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 22:38:23,959 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-10-12 22:38:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:24,781 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-12 22:38:24,781 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 22:38:24,782 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-12 22:38:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:24,784 INFO L225 Difference]: With dead ends: 65 [2018-10-12 22:38:24,784 INFO L226 Difference]: Without dead ends: 65 [2018-10-12 22:38:24,785 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:38:24,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-12 22:38:24,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-10-12 22:38:24,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-12 22:38:24,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-12 22:38:24,792 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 38 [2018-10-12 22:38:24,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:24,793 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-12 22:38:24,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 22:38:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-12 22:38:24,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-12 22:38:24,795 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:24,795 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 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] [2018-10-12 22:38:24,795 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:24,796 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:24,796 INFO L82 PathProgramCache]: Analyzing trace with hash -4217092, now seen corresponding path program 2 times [2018-10-12 22:38:24,797 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:24,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:25,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:25,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 22:38:25,172 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 22:38:25,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 22:38:25,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 22:38:25,173 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-10-12 22:38:26,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:26,070 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-12 22:38:26,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 22:38:26,071 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-10-12 22:38:26,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:26,073 INFO L225 Difference]: With dead ends: 79 [2018-10-12 22:38:26,073 INFO L226 Difference]: Without dead ends: 79 [2018-10-12 22:38:26,074 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:38:26,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-12 22:38:26,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-10-12 22:38:26,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-12 22:38:26,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-12 22:38:26,081 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 52 [2018-10-12 22:38:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:26,082 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-12 22:38:26,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 22:38:26,082 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-12 22:38:26,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-12 22:38:26,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:26,085 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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] [2018-10-12 22:38:26,085 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:26,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:26,085 INFO L82 PathProgramCache]: Analyzing trace with hash -650846829, now seen corresponding path program 3 times [2018-10-12 22:38:26,086 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:26,601 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:26,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:26,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 22:38:26,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 22:38:26,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 22:38:26,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-10-12 22:38:26,604 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 16 states. [2018-10-12 22:38:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:27,767 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-12 22:38:27,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-12 22:38:27,774 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-10-12 22:38:27,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:27,775 INFO L225 Difference]: With dead ends: 93 [2018-10-12 22:38:27,775 INFO L226 Difference]: Without dead ends: 93 [2018-10-12 22:38:27,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:38:27,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-12 22:38:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-10-12 22:38:27,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-12 22:38:27,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-12 22:38:27,783 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 66 [2018-10-12 22:38:27,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:27,784 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-12 22:38:27,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 22:38:27,784 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-12 22:38:27,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-12 22:38:27,786 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:27,786 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:27,786 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:27,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:27,787 INFO L82 PathProgramCache]: Analyzing trace with hash -893435926, now seen corresponding path program 4 times [2018-10-12 22:38:27,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:28,175 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:28,176 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:28,176 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 22:38:28,176 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 22:38:28,177 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 22:38:28,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 22:38:28,177 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 16 states. [2018-10-12 22:38:29,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:29,095 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-12 22:38:29,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 22:38:29,099 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-10-12 22:38:29,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:29,101 INFO L225 Difference]: With dead ends: 107 [2018-10-12 22:38:29,101 INFO L226 Difference]: Without dead ends: 107 [2018-10-12 22:38:29,102 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 22:38:29,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-12 22:38:29,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-12 22:38:29,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-12 22:38:29,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-12 22:38:29,115 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 80 [2018-10-12 22:38:29,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:29,116 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-12 22:38:29,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 22:38:29,116 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-12 22:38:29,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-12 22:38:29,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:29,118 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:29,118 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:29,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:29,118 INFO L82 PathProgramCache]: Analyzing trace with hash -888717823, now seen corresponding path program 5 times [2018-10-12 22:38:29,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:30,538 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:30,539 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:30,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 22:38:30,540 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 22:38:30,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 22:38:30,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-12 22:38:30,541 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 18 states. [2018-10-12 22:38:32,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:32,362 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-12 22:38:32,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 22:38:32,363 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-10-12 22:38:32,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:32,365 INFO L225 Difference]: With dead ends: 121 [2018-10-12 22:38:32,365 INFO L226 Difference]: Without dead ends: 121 [2018-10-12 22:38:32,366 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 22:38:32,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-12 22:38:32,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-10-12 22:38:32,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-12 22:38:32,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-12 22:38:32,373 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 94 [2018-10-12 22:38:32,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:32,374 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-12 22:38:32,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 22:38:32,374 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-12 22:38:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-12 22:38:32,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:32,376 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:32,377 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:32,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:32,377 INFO L82 PathProgramCache]: Analyzing trace with hash 154224600, now seen corresponding path program 6 times [2018-10-12 22:38:32,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:32,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:32,870 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:32,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:32,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 22:38:32,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 22:38:32,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 22:38:32,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-12 22:38:32,871 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 20 states. [2018-10-12 22:38:34,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:34,441 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-12 22:38:34,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 22:38:34,441 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-10-12 22:38:34,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:34,442 INFO L225 Difference]: With dead ends: 135 [2018-10-12 22:38:34,442 INFO L226 Difference]: Without dead ends: 135 [2018-10-12 22:38:34,444 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 22:38:34,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-12 22:38:34,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-10-12 22:38:34,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-12 22:38:34,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-12 22:38:34,451 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 108 [2018-10-12 22:38:34,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:34,452 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-12 22:38:34,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 22:38:34,452 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-12 22:38:34,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-12 22:38:34,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:34,454 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:34,454 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:34,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:34,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1675480431, now seen corresponding path program 7 times [2018-10-12 22:38:34,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:34,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:35,032 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:35,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:35,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 22:38:35,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 22:38:35,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 22:38:35,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-12 22:38:35,034 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 22 states. [2018-10-12 22:38:37,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:37,030 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-12 22:38:37,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 22:38:37,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2018-10-12 22:38:37,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:37,032 INFO L225 Difference]: With dead ends: 149 [2018-10-12 22:38:37,032 INFO L226 Difference]: Without dead ends: 149 [2018-10-12 22:38:37,034 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 22:38:37,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-12 22:38:37,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2018-10-12 22:38:37,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-12 22:38:37,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-12 22:38:37,041 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 122 [2018-10-12 22:38:37,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:37,042 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-12 22:38:37,042 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 22:38:37,042 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-12 22:38:37,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-12 22:38:37,044 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:37,044 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:37,044 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:37,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:37,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1607909690, now seen corresponding path program 8 times [2018-10-12 22:38:37,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:37,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:37,661 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:37,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:37,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 22:38:37,662 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 22:38:37,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 22:38:37,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-12 22:38:37,663 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-10-12 22:38:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:40,208 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-12 22:38:40,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 22:38:40,211 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-10-12 22:38:40,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:40,212 INFO L225 Difference]: With dead ends: 163 [2018-10-12 22:38:40,213 INFO L226 Difference]: Without dead ends: 163 [2018-10-12 22:38:40,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 22:38:40,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-12 22:38:40,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-10-12 22:38:40,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-12 22:38:40,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-12 22:38:40,219 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 136 [2018-10-12 22:38:40,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:40,220 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-12 22:38:40,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 22:38:40,220 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-12 22:38:40,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-12 22:38:40,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:40,222 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:40,223 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:40,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:40,223 INFO L82 PathProgramCache]: Analyzing trace with hash 1621887965, now seen corresponding path program 9 times [2018-10-12 22:38:40,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:40,887 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:40,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 22:38:40,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 22:38:40,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 22:38:40,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-10-12 22:38:40,888 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 26 states. [2018-10-12 22:38:43,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:43,523 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-12 22:38:43,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 22:38:43,531 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150 [2018-10-12 22:38:43,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:43,532 INFO L225 Difference]: With dead ends: 177 [2018-10-12 22:38:43,533 INFO L226 Difference]: Without dead ends: 177 [2018-10-12 22:38:43,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 22:38:43,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-12 22:38:43,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2018-10-12 22:38:43,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-12 22:38:43,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-12 22:38:43,541 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 150 [2018-10-12 22:38:43,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:43,541 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-12 22:38:43,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 22:38:43,542 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-12 22:38:43,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-12 22:38:43,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:43,544 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:43,544 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:43,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:43,545 INFO L82 PathProgramCache]: Analyzing trace with hash -595942220, now seen corresponding path program 10 times [2018-10-12 22:38:43,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:44,324 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:38:45,230 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:45,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:45,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 22:38:45,231 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 22:38:45,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 22:38:45,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-10-12 22:38:45,232 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 28 states. [2018-10-12 22:38:48,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:48,272 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-12 22:38:48,272 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 22:38:48,272 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2018-10-12 22:38:48,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:48,274 INFO L225 Difference]: With dead ends: 191 [2018-10-12 22:38:48,274 INFO L226 Difference]: Without dead ends: 191 [2018-10-12 22:38:48,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=427, Invalid=3479, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 22:38:48,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-12 22:38:48,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2018-10-12 22:38:48,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-12 22:38:48,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-12 22:38:48,280 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 164 [2018-10-12 22:38:48,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:48,281 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-12 22:38:48,281 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 22:38:48,281 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-12 22:38:48,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-12 22:38:48,282 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:48,282 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:48,283 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:48,283 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:48,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1445296459, now seen corresponding path program 11 times [2018-10-12 22:38:48,284 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:49,164 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:49,164 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:49,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 22:38:49,165 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 22:38:49,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 22:38:49,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-10-12 22:38:49,165 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 30 states. [2018-10-12 22:38:52,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:52,593 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-12 22:38:52,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 22:38:52,594 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-10-12 22:38:52,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:52,596 INFO L225 Difference]: With dead ends: 205 [2018-10-12 22:38:52,596 INFO L226 Difference]: Without dead ends: 205 [2018-10-12 22:38:52,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=464, Invalid=4092, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 22:38:52,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-12 22:38:52,601 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-10-12 22:38:52,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-12 22:38:52,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-12 22:38:52,602 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 178 [2018-10-12 22:38:52,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:52,603 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-12 22:38:52,603 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 22:38:52,603 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-12 22:38:52,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-12 22:38:52,604 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:52,604 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:52,605 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:52,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:52,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1387854242, now seen corresponding path program 12 times [2018-10-12 22:38:52,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:52,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:54,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:54,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 22:38:54,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 22:38:54,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 22:38:54,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2018-10-12 22:38:54,233 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 32 states. [2018-10-12 22:38:55,223 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-12 22:38:58,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:38:58,585 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-12 22:38:58,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 22:38:58,586 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 192 [2018-10-12 22:38:58,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:38:58,588 INFO L225 Difference]: With dead ends: 219 [2018-10-12 22:38:58,588 INFO L226 Difference]: Without dead ends: 219 [2018-10-12 22:38:58,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=501, Invalid=4755, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 22:38:58,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-12 22:38:58,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2018-10-12 22:38:58,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-12 22:38:58,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-12 22:38:58,594 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 192 [2018-10-12 22:38:58,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:38:58,594 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-12 22:38:58,595 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 22:38:58,595 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-12 22:38:58,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-12 22:38:58,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:38:58,596 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:38:58,596 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:38:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:38:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1866623559, now seen corresponding path program 13 times [2018-10-12 22:38:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:38:58,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:38:59,663 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:38:59,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:38:59,663 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 22:38:59,664 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 22:38:59,664 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 22:38:59,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 22:38:59,665 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 34 states. [2018-10-12 22:39:02,039 WARN L178 SmtUtils]: Spent 205.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-12 22:39:04,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:04,263 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-12 22:39:04,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 22:39:04,264 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 206 [2018-10-12 22:39:04,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:04,266 INFO L225 Difference]: With dead ends: 233 [2018-10-12 22:39:04,266 INFO L226 Difference]: Without dead ends: 233 [2018-10-12 22:39:04,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=538, Invalid=5468, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 22:39:04,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-12 22:39:04,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2018-10-12 22:39:04,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-12 22:39:04,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-12 22:39:04,273 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 206 [2018-10-12 22:39:04,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:04,274 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-12 22:39:04,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 22:39:04,274 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-12 22:39:04,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-12 22:39:04,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:04,275 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:04,275 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:04,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:04,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1086866032, now seen corresponding path program 14 times [2018-10-12 22:39:04,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:06,308 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 1358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:06,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:06,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 22:39:06,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 22:39:06,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 22:39:06,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 22:39:06,310 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 36 states. [2018-10-12 22:39:11,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:11,219 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-12 22:39:11,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 22:39:11,220 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 220 [2018-10-12 22:39:11,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:11,222 INFO L225 Difference]: With dead ends: 247 [2018-10-12 22:39:11,222 INFO L226 Difference]: Without dead ends: 247 [2018-10-12 22:39:11,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=575, Invalid=6231, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 22:39:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-12 22:39:11,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2018-10-12 22:39:11,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-12 22:39:11,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-12 22:39:11,229 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 220 [2018-10-12 22:39:11,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:11,230 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-12 22:39:11,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 22:39:11,230 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-12 22:39:11,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-12 22:39:11,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:11,231 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:11,231 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:11,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:11,232 INFO L82 PathProgramCache]: Analyzing trace with hash -190324441, now seen corresponding path program 15 times [2018-10-12 22:39:11,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:11,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:12,585 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:12,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:12,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 22:39:12,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 22:39:12,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 22:39:12,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 22:39:12,587 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 38 states. [2018-10-12 22:39:18,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:18,073 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-12 22:39:18,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 22:39:18,074 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 234 [2018-10-12 22:39:18,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:18,075 INFO L225 Difference]: With dead ends: 261 [2018-10-12 22:39:18,075 INFO L226 Difference]: Without dead ends: 261 [2018-10-12 22:39:18,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=612, Invalid=7044, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 22:39:18,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-12 22:39:18,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2018-10-12 22:39:18,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-12 22:39:18,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-12 22:39:18,082 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 234 [2018-10-12 22:39:18,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:18,082 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-12 22:39:18,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 22:39:18,082 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-12 22:39:18,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-12 22:39:18,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:18,083 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:18,083 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:18,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:18,084 INFO L82 PathProgramCache]: Analyzing trace with hash -435523458, now seen corresponding path program 16 times [2018-10-12 22:39:18,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:18,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:20,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 0 proven. 1776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:20,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:20,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 22:39:20,044 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 22:39:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 22:39:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 22:39:20,045 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 40 states. [2018-10-12 22:39:25,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:25,864 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-12 22:39:25,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-12 22:39:25,865 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 248 [2018-10-12 22:39:25,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:25,866 INFO L225 Difference]: With dead ends: 275 [2018-10-12 22:39:25,866 INFO L226 Difference]: Without dead ends: 275 [2018-10-12 22:39:25,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=649, Invalid=7907, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 22:39:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-12 22:39:25,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2018-10-12 22:39:25,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-12 22:39:25,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-12 22:39:25,873 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 248 [2018-10-12 22:39:25,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:25,874 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-12 22:39:25,874 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 22:39:25,874 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-12 22:39:25,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-12 22:39:25,875 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:25,876 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:25,876 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:25,876 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:25,876 INFO L82 PathProgramCache]: Analyzing trace with hash -573056107, now seen corresponding path program 17 times [2018-10-12 22:39:25,877 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:25,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:27,452 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 0 proven. 2006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:27,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:27,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 22:39:27,453 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 22:39:27,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 22:39:27,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 22:39:27,453 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 42 states. [2018-10-12 22:39:34,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:34,261 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-12 22:39:34,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 22:39:34,262 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 262 [2018-10-12 22:39:34,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:34,264 INFO L225 Difference]: With dead ends: 289 [2018-10-12 22:39:34,264 INFO L226 Difference]: Without dead ends: 289 [2018-10-12 22:39:34,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=686, Invalid=8820, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 22:39:34,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-12 22:39:34,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2018-10-12 22:39:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-12 22:39:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-12 22:39:34,272 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 262 [2018-10-12 22:39:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:34,272 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-12 22:39:34,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 22:39:34,273 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-12 22:39:34,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-12 22:39:34,274 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:34,274 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:34,275 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:34,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:34,275 INFO L82 PathProgramCache]: Analyzing trace with hash 1929679468, now seen corresponding path program 18 times [2018-10-12 22:39:34,278 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:34,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:36,183 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 2250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:36,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:36,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 22:39:36,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 22:39:36,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 22:39:36,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 22:39:36,185 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 44 states. [2018-10-12 22:39:43,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:43,341 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-12 22:39:43,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-12 22:39:43,341 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 276 [2018-10-12 22:39:43,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:43,346 INFO L225 Difference]: With dead ends: 303 [2018-10-12 22:39:43,346 INFO L226 Difference]: Without dead ends: 303 [2018-10-12 22:39:43,347 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=723, Invalid=9783, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 22:39:43,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-12 22:39:43,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2018-10-12 22:39:43,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-12 22:39:43,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-12 22:39:43,353 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 276 [2018-10-12 22:39:43,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:43,354 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-12 22:39:43,354 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 22:39:43,354 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-12 22:39:43,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-12 22:39:43,356 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:43,356 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:43,356 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:43,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:43,357 INFO L82 PathProgramCache]: Analyzing trace with hash 66819, now seen corresponding path program 19 times [2018-10-12 22:39:43,358 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:43,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:45,140 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:45,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:45,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 22:39:45,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 22:39:45,141 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 22:39:45,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 22:39:45,142 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 46 states. [2018-10-12 22:39:53,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:39:53,569 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-12 22:39:53,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:39:53,570 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 290 [2018-10-12 22:39:53,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:39:53,573 INFO L225 Difference]: With dead ends: 317 [2018-10-12 22:39:53,573 INFO L226 Difference]: Without dead ends: 317 [2018-10-12 22:39:53,575 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=760, Invalid=10796, Unknown=0, NotChecked=0, Total=11556 [2018-10-12 22:39:53,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-12 22:39:53,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2018-10-12 22:39:53,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-12 22:39:53,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-12 22:39:53,580 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 290 [2018-10-12 22:39:53,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:39:53,580 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-12 22:39:53,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 22:39:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-12 22:39:53,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-12 22:39:53,582 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:39:53,582 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:39:53,582 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:39:53,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:39:53,583 INFO L82 PathProgramCache]: Analyzing trace with hash -642145446, now seen corresponding path program 20 times [2018-10-12 22:39:53,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:39:53,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:39:55,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 0 proven. 2780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:39:55,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:39:55,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 22:39:55,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 22:39:55,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 22:39:55,622 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 22:39:55,622 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 48 states. [2018-10-12 22:40:04,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:04,138 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-12 22:40:04,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-12 22:40:04,139 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 304 [2018-10-12 22:40:04,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:04,141 INFO L225 Difference]: With dead ends: 331 [2018-10-12 22:40:04,141 INFO L226 Difference]: Without dead ends: 331 [2018-10-12 22:40:04,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=797, Invalid=11859, Unknown=0, NotChecked=0, Total=12656 [2018-10-12 22:40:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-12 22:40:04,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 319. [2018-10-12 22:40:04,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-12 22:40:04,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-12 22:40:04,148 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 304 [2018-10-12 22:40:04,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:04,148 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-12 22:40:04,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 22:40:04,149 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-12 22:40:04,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-12 22:40:04,150 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:04,151 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:40:04,151 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:04,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:04,151 INFO L82 PathProgramCache]: Analyzing trace with hash 1184292209, now seen corresponding path program 21 times [2018-10-12 22:40:04,152 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:04,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:05,406 WARN L178 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:40:07,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3066 backedges. 0 proven. 3066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:40:07,318 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:07,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 22:40:07,319 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 22:40:07,319 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 22:40:07,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2309, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 22:40:07,319 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 50 states. [2018-10-12 22:40:16,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:16,594 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-12 22:40:16,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 22:40:16,596 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 318 [2018-10-12 22:40:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:16,598 INFO L225 Difference]: With dead ends: 345 [2018-10-12 22:40:16,598 INFO L226 Difference]: Without dead ends: 345 [2018-10-12 22:40:16,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=834, Invalid=12972, Unknown=0, NotChecked=0, Total=13806 [2018-10-12 22:40:16,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-12 22:40:16,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2018-10-12 22:40:16,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-12 22:40:16,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-12 22:40:16,604 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 318 [2018-10-12 22:40:16,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:16,604 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-12 22:40:16,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 22:40:16,604 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-12 22:40:16,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-12 22:40:16,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:16,607 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:40:16,607 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:16,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:16,607 INFO L82 PathProgramCache]: Analyzing trace with hash 897393480, now seen corresponding path program 22 times [2018-10-12 22:40:16,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:19,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3366 backedges. 0 proven. 3366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:40:19,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:19,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 22:40:19,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 22:40:19,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 22:40:19,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 22:40:19,909 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 52 states. [2018-10-12 22:40:29,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:29,933 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-12 22:40:29,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-12 22:40:29,934 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 332 [2018-10-12 22:40:29,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:29,936 INFO L225 Difference]: With dead ends: 359 [2018-10-12 22:40:29,936 INFO L226 Difference]: Without dead ends: 359 [2018-10-12 22:40:29,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=871, Invalid=14135, Unknown=0, NotChecked=0, Total=15006 [2018-10-12 22:40:29,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-12 22:40:29,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2018-10-12 22:40:29,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 22:40:29,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-12 22:40:29,942 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 332 [2018-10-12 22:40:29,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:29,943 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-12 22:40:29,943 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 22:40:29,943 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-12 22:40:29,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-12 22:40:29,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:29,945 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:40:29,946 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:29,946 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:29,946 INFO L82 PathProgramCache]: Analyzing trace with hash -1261640481, now seen corresponding path program 23 times [2018-10-12 22:40:29,947 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:29,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:32,717 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:40:32,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:32,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 22:40:32,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 22:40:32,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 22:40:32,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2709, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 22:40:32,719 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 54 states. [2018-10-12 22:40:43,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:43,466 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-12 22:40:43,467 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 22:40:43,467 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-10-12 22:40:43,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:43,468 INFO L225 Difference]: With dead ends: 373 [2018-10-12 22:40:43,469 INFO L226 Difference]: Without dead ends: 373 [2018-10-12 22:40:43,470 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=908, Invalid=15348, Unknown=0, NotChecked=0, Total=16256 [2018-10-12 22:40:43,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-12 22:40:43,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2018-10-12 22:40:43,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-12 22:40:43,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-12 22:40:43,475 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 346 [2018-10-12 22:40:43,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:43,475 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-12 22:40:43,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 22:40:43,475 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-12 22:40:43,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-12 22:40:43,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:43,478 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:40:43,478 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:43,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:43,478 INFO L82 PathProgramCache]: Analyzing trace with hash 694325814, now seen corresponding path program 24 times [2018-10-12 22:40:43,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:43,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:40:46,476 INFO L134 CoverageAnalysis]: Checked inductivity of 4008 backedges. 0 proven. 4008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:40:46,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:40:46,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 22:40:46,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 22:40:46,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 22:40:46,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 22:40:46,477 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 56 states. [2018-10-12 22:40:58,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:40:58,007 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-12 22:40:58,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 22:40:58,007 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 360 [2018-10-12 22:40:58,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:40:58,009 INFO L225 Difference]: With dead ends: 387 [2018-10-12 22:40:58,009 INFO L226 Difference]: Without dead ends: 387 [2018-10-12 22:40:58,010 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=945, Invalid=16611, Unknown=0, NotChecked=0, Total=17556 [2018-10-12 22:40:58,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-12 22:40:58,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2018-10-12 22:40:58,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-12 22:40:58,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-12 22:40:58,015 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 360 [2018-10-12 22:40:58,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:40:58,016 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-12 22:40:58,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 22:40:58,016 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-12 22:40:58,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-12 22:40:58,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:40:58,018 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:40:58,018 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:40:58,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:40:58,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1167498061, now seen corresponding path program 25 times [2018-10-12 22:40:58,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:40:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 4350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:41:01,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:01,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 22:41:01,772 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 22:41:01,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 22:41:01,772 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3141, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 22:41:01,772 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 58 states. [2018-10-12 22:41:14,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:41:14,255 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-12 22:41:14,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 22:41:14,255 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 374 [2018-10-12 22:41:14,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:41:14,257 INFO L225 Difference]: With dead ends: 401 [2018-10-12 22:41:14,257 INFO L226 Difference]: Without dead ends: 401 [2018-10-12 22:41:14,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=982, Invalid=17924, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 22:41:14,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-12 22:41:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2018-10-12 22:41:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-12 22:41:14,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-12 22:41:14,263 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 374 [2018-10-12 22:41:14,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:41:14,264 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-12 22:41:14,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 22:41:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-12 22:41:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-12 22:41:14,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:41:14,266 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:41:14,266 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:41:14,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:41:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -1069715420, now seen corresponding path program 26 times [2018-10-12 22:41:14,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:41:14,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:17,693 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 0 proven. 4706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:41:17,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:17,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 22:41:17,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 22:41:17,694 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 22:41:17,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3369, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 22:41:17,695 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 60 states. [2018-10-12 22:41:31,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:41:31,082 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-12 22:41:31,082 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 22:41:31,082 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 388 [2018-10-12 22:41:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:41:31,084 INFO L225 Difference]: With dead ends: 415 [2018-10-12 22:41:31,085 INFO L226 Difference]: Without dead ends: 415 [2018-10-12 22:41:31,086 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=1019, Invalid=19287, Unknown=0, NotChecked=0, Total=20306 [2018-10-12 22:41:31,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-12 22:41:31,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2018-10-12 22:41:31,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-12 22:41:31,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-12 22:41:31,091 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 388 [2018-10-12 22:41:31,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:41:31,092 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-12 22:41:31,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 22:41:31,092 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-12 22:41:31,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-12 22:41:31,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:41:31,094 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:41:31,095 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:41:31,095 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:41:31,095 INFO L82 PathProgramCache]: Analyzing trace with hash -878214981, now seen corresponding path program 27 times [2018-10-12 22:41:31,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:41:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:32,362 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:41:32,926 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:41:36,041 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:41:36,042 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:36,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 22:41:36,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 22:41:36,043 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 22:41:36,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3605, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 22:41:36,043 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 62 states. [2018-10-12 22:41:50,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:41:50,522 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-12 22:41:50,523 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 22:41:50,523 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 402 [2018-10-12 22:41:50,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:41:50,525 INFO L225 Difference]: With dead ends: 429 [2018-10-12 22:41:50,525 INFO L226 Difference]: Without dead ends: 429 [2018-10-12 22:41:50,526 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1056, Invalid=20700, Unknown=0, NotChecked=0, Total=21756 [2018-10-12 22:41:50,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-12 22:41:50,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2018-10-12 22:41:50,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-12 22:41:50,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-12 22:41:50,531 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 402 [2018-10-12 22:41:50,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:41:50,532 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-12 22:41:50,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 22:41:50,532 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-12 22:41:50,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-12 22:41:50,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:41:50,534 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:41:50,535 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:41:50,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:41:50,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1285635346, now seen corresponding path program 28 times [2018-10-12 22:41:50,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:41:50,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:41:51,406 WARN L178 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 22:41:54,454 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:41:54,455 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:41:54,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 22:41:54,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 22:41:54,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 22:41:54,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3849, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 22:41:54,456 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 64 states. [2018-10-12 22:42:09,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:42:09,671 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-12 22:42:09,671 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-12 22:42:09,671 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 416 [2018-10-12 22:42:09,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:42:09,673 INFO L225 Difference]: With dead ends: 443 [2018-10-12 22:42:09,673 INFO L226 Difference]: Without dead ends: 443 [2018-10-12 22:42:09,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=1093, Invalid=22163, Unknown=0, NotChecked=0, Total=23256 [2018-10-12 22:42:09,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-12 22:42:09,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 431. [2018-10-12 22:42:09,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-12 22:42:09,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-12 22:42:09,679 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 416 [2018-10-12 22:42:09,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:42:09,680 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-12 22:42:09,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 22:42:09,680 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-12 22:42:09,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-12 22:42:09,683 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:42:09,683 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:42:09,683 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:42:09,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:42:09,684 INFO L82 PathProgramCache]: Analyzing trace with hash -780987095, now seen corresponding path program 29 times [2018-10-12 22:42:09,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:42:09,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:42:11,199 WARN L178 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 22:42:13,785 INFO L134 CoverageAnalysis]: Checked inductivity of 5858 backedges. 0 proven. 5858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:42:13,785 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:42:13,786 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 22:42:13,786 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 22:42:13,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 22:42:13,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4101, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 22:42:13,787 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 66 states. [2018-10-12 22:42:29,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:42:29,924 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-12 22:42:29,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 22:42:29,924 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 430 [2018-10-12 22:42:29,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:42:29,926 INFO L225 Difference]: With dead ends: 457 [2018-10-12 22:42:29,926 INFO L226 Difference]: Without dead ends: 457 [2018-10-12 22:42:29,927 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1130, Invalid=23676, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 22:42:29,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-12 22:42:29,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2018-10-12 22:42:29,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-12 22:42:29,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-12 22:42:29,931 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 430 [2018-10-12 22:42:29,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:42:29,932 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-12 22:42:29,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-12 22:42:29,932 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-12 22:42:29,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-12 22:42:29,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:42:29,935 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:42:29,935 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:42:29,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:42:29,935 INFO L82 PathProgramCache]: Analyzing trace with hash 1222736128, now seen corresponding path program 30 times [2018-10-12 22:42:29,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:42:29,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:42:34,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 0 proven. 6270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:42:34,274 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:42:34,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 22:42:34,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 22:42:34,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 22:42:34,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4361, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 22:42:34,275 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 68 states. [2018-10-12 22:42:51,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:42:51,414 INFO L93 Difference]: Finished difference Result 471 states and 471 transitions. [2018-10-12 22:42:51,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-12 22:42:51,415 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 444 [2018-10-12 22:42:51,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:42:51,416 INFO L225 Difference]: With dead ends: 471 [2018-10-12 22:42:51,417 INFO L226 Difference]: Without dead ends: 471 [2018-10-12 22:42:51,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1167, Invalid=25239, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 22:42:51,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-12 22:42:51,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 459. [2018-10-12 22:42:51,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-12 22:42:51,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-12 22:42:51,423 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 444 [2018-10-12 22:42:51,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:42:51,423 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-12 22:42:51,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-12 22:42:51,423 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-12 22:42:51,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-12 22:42:51,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:42:51,426 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:42:51,426 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:42:51,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:42:51,427 INFO L82 PathProgramCache]: Analyzing trace with hash 2032982167, now seen corresponding path program 31 times [2018-10-12 22:42:51,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:42:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:42:56,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6696 backedges. 0 proven. 6696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:42:56,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:42:56,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-12 22:42:56,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-12 22:42:56,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-12 22:42:56,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4629, Unknown=0, NotChecked=0, Total=4830 [2018-10-12 22:42:56,148 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 70 states. [2018-10-12 22:43:14,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:43:14,776 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-10-12 22:43:14,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 22:43:14,777 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 458 [2018-10-12 22:43:14,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:43:14,779 INFO L225 Difference]: With dead ends: 485 [2018-10-12 22:43:14,779 INFO L226 Difference]: Without dead ends: 485 [2018-10-12 22:43:14,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=1204, Invalid=26852, Unknown=0, NotChecked=0, Total=28056 [2018-10-12 22:43:14,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-12 22:43:14,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2018-10-12 22:43:14,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-12 22:43:14,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-12 22:43:14,784 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 458 [2018-10-12 22:43:14,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:43:14,784 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-12 22:43:14,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-12 22:43:14,785 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-12 22:43:14,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-12 22:43:14,787 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:43:14,787 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:43:14,787 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:43:14,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:43:14,787 INFO L82 PathProgramCache]: Analyzing trace with hash 923902958, now seen corresponding path program 32 times [2018-10-12 22:43:14,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:43:14,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:43:18,932 INFO L134 CoverageAnalysis]: Checked inductivity of 7136 backedges. 0 proven. 7136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:43:18,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:43:18,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-12 22:43:18,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-12 22:43:18,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-12 22:43:18,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4905, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 22:43:18,934 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 72 states. [2018-10-12 22:43:38,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:43:38,308 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-12 22:43:38,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-12 22:43:38,308 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 472 [2018-10-12 22:43:38,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:43:38,310 INFO L225 Difference]: With dead ends: 499 [2018-10-12 22:43:38,310 INFO L226 Difference]: Without dead ends: 499 [2018-10-12 22:43:38,311 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=1241, Invalid=28515, Unknown=0, NotChecked=0, Total=29756 [2018-10-12 22:43:38,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-12 22:43:38,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 487. [2018-10-12 22:43:38,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-12 22:43:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 487 transitions. [2018-10-12 22:43:38,317 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 487 transitions. Word has length 472 [2018-10-12 22:43:38,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:43:38,317 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 487 transitions. [2018-10-12 22:43:38,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-12 22:43:38,317 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 487 transitions. [2018-10-12 22:43:38,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-12 22:43:38,320 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:43:38,321 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:43:38,321 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:43:38,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:43:38,321 INFO L82 PathProgramCache]: Analyzing trace with hash 1556630277, now seen corresponding path program 33 times [2018-10-12 22:43:38,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:43:38,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:43:42,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:43:42,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:43:42,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-12 22:43:42,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-12 22:43:42,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-12 22:43:42,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5189, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 22:43:42,701 INFO L87 Difference]: Start difference. First operand 487 states and 487 transitions. Second operand 74 states. [2018-10-12 22:44:03,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:44:03,325 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-12 22:44:03,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-12 22:44:03,326 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 486 [2018-10-12 22:44:03,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:44:03,328 INFO L225 Difference]: With dead ends: 513 [2018-10-12 22:44:03,328 INFO L226 Difference]: Without dead ends: 513 [2018-10-12 22:44:03,329 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1278, Invalid=30228, Unknown=0, NotChecked=0, Total=31506 [2018-10-12 22:44:03,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-12 22:44:03,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2018-10-12 22:44:03,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-12 22:44:03,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-10-12 22:44:03,333 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 486 [2018-10-12 22:44:03,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:44:03,333 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-10-12 22:44:03,334 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-12 22:44:03,334 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-10-12 22:44:03,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-12 22:44:03,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:44:03,337 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:44:03,337 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:44:03,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:44:03,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2130362916, now seen corresponding path program 34 times [2018-10-12 22:44:03,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:44:03,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:44:08,083 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 8058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:44:08,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:44:08,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-12 22:44:08,085 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-12 22:44:08,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-12 22:44:08,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5481, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 22:44:08,085 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 76 states. [2018-10-12 22:44:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:44:30,049 INFO L93 Difference]: Finished difference Result 527 states and 527 transitions. [2018-10-12 22:44:30,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 22:44:30,050 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 500 [2018-10-12 22:44:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:44:30,052 INFO L225 Difference]: With dead ends: 527 [2018-10-12 22:44:30,052 INFO L226 Difference]: Without dead ends: 527 [2018-10-12 22:44:30,053 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5635 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1315, Invalid=31991, Unknown=0, NotChecked=0, Total=33306 [2018-10-12 22:44:30,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-12 22:44:30,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2018-10-12 22:44:30,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-12 22:44:30,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-12 22:44:30,057 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 500 [2018-10-12 22:44:30,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:44:30,058 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-12 22:44:30,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-12 22:44:30,058 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-12 22:44:30,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-12 22:44:30,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:44:30,061 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:44:30,062 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:44:30,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:44:30,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1845030003, now seen corresponding path program 35 times [2018-10-12 22:44:30,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:44:30,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:44:34,794 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 8540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:44:34,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:44:34,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-12 22:44:34,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-12 22:44:34,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-12 22:44:34,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5781, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 22:44:34,796 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 78 states. [2018-10-12 22:44:57,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:44:57,985 INFO L93 Difference]: Finished difference Result 541 states and 541 transitions. [2018-10-12 22:44:57,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-12 22:44:57,985 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 514 [2018-10-12 22:44:57,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:44:57,987 INFO L225 Difference]: With dead ends: 541 [2018-10-12 22:44:57,987 INFO L226 Difference]: Without dead ends: 541 [2018-10-12 22:44:57,988 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5958 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=1352, Invalid=33804, Unknown=0, NotChecked=0, Total=35156 [2018-10-12 22:44:57,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-12 22:44:57,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 529. [2018-10-12 22:44:57,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-12 22:44:57,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 529 transitions. [2018-10-12 22:44:57,993 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 529 transitions. Word has length 514 [2018-10-12 22:44:57,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:44:57,993 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 529 transitions. [2018-10-12 22:44:57,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-12 22:44:57,993 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 529 transitions. [2018-10-12 22:44:57,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-12 22:44:57,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:44:57,997 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:44:57,997 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:44:57,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:44:57,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1481623242, now seen corresponding path program 36 times [2018-10-12 22:44:57,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:44:58,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:45:03,294 INFO L134 CoverageAnalysis]: Checked inductivity of 9036 backedges. 0 proven. 9036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:45:03,294 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:45:03,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-12 22:45:03,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-12 22:45:03,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-12 22:45:03,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=6089, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 22:45:03,296 INFO L87 Difference]: Start difference. First operand 529 states and 529 transitions. Second operand 80 states. [2018-10-12 22:45:27,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:45:27,566 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-12 22:45:27,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-12 22:45:27,566 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 528 [2018-10-12 22:45:27,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:45:27,569 INFO L225 Difference]: With dead ends: 555 [2018-10-12 22:45:27,569 INFO L226 Difference]: Without dead ends: 555 [2018-10-12 22:45:27,571 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6290 ImplicationChecksByTransitivity, 12.1s TimeCoverageRelationStatistics Valid=1389, Invalid=35667, Unknown=0, NotChecked=0, Total=37056 [2018-10-12 22:45:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-12 22:45:27,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2018-10-12 22:45:27,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-12 22:45:27,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-12 22:45:27,575 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 528 [2018-10-12 22:45:27,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:45:27,575 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-12 22:45:27,575 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-12 22:45:27,575 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-12 22:45:27,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-12 22:45:27,579 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:45:27,579 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:45:27,579 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:45:27,579 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:45:27,580 INFO L82 PathProgramCache]: Analyzing trace with hash -701350687, now seen corresponding path program 37 times [2018-10-12 22:45:27,580 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:45:27,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:45:33,477 INFO L134 CoverageAnalysis]: Checked inductivity of 9546 backedges. 0 proven. 9546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:45:33,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:45:33,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-12 22:45:33,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-12 22:45:33,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-12 22:45:33,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6405, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 22:45:33,479 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 82 states. [2018-10-12 22:45:59,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:45:59,108 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-12 22:45:59,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 22:45:59,108 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 542 [2018-10-12 22:45:59,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:45:59,110 INFO L225 Difference]: With dead ends: 569 [2018-10-12 22:45:59,110 INFO L226 Difference]: Without dead ends: 569 [2018-10-12 22:45:59,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6631 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=1426, Invalid=37580, Unknown=0, NotChecked=0, Total=39006 [2018-10-12 22:45:59,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-12 22:45:59,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-10-12 22:45:59,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-12 22:45:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 557 transitions. [2018-10-12 22:45:59,116 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 557 transitions. Word has length 542 [2018-10-12 22:45:59,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:45:59,116 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 557 transitions. [2018-10-12 22:45:59,116 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-12 22:45:59,116 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 557 transitions. [2018-10-12 22:45:59,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-12 22:45:59,119 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:45:59,119 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:45:59,119 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:45:59,119 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:45:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1773879624, now seen corresponding path program 38 times [2018-10-12 22:45:59,120 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:45:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:46:05,047 INFO L134 CoverageAnalysis]: Checked inductivity of 10070 backedges. 0 proven. 10070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:46:05,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:46:05,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-12 22:46:05,048 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-12 22:46:05,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-12 22:46:05,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6729, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 22:46:05,049 INFO L87 Difference]: Start difference. First operand 557 states and 557 transitions. Second operand 84 states. [2018-10-12 22:46:31,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:46:31,726 INFO L93 Difference]: Finished difference Result 583 states and 583 transitions. [2018-10-12 22:46:31,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-12 22:46:31,727 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 556 [2018-10-12 22:46:31,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:46:31,730 INFO L225 Difference]: With dead ends: 583 [2018-10-12 22:46:31,730 INFO L226 Difference]: Without dead ends: 583 [2018-10-12 22:46:31,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6981 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=1463, Invalid=39543, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 22:46:31,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-10-12 22:46:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2018-10-12 22:46:31,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-12 22:46:31,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-12 22:46:31,735 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 556 [2018-10-12 22:46:31,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:46:31,736 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-12 22:46:31,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-12 22:46:31,736 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-12 22:46:31,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-12 22:46:31,739 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:46:31,740 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:46:31,740 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:46:31,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:46:31,740 INFO L82 PathProgramCache]: Analyzing trace with hash -693650353, now seen corresponding path program 39 times [2018-10-12 22:46:31,741 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:46:31,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:46:37,837 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 0 proven. 10608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:46:37,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:46:37,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-12 22:46:37,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-12 22:46:37,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-12 22:46:37,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7061, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 22:46:37,839 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 86 states.