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/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 22:29:02,612 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 22:29:02,614 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 22:29:02,626 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 22:29:02,627 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 22:29:02,628 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 22:29:02,629 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 22:29:02,631 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 22:29:02,633 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 22:29:02,634 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 22:29:02,635 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 22:29:02,635 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 22:29:02,636 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 22:29:02,637 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 22:29:02,638 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 22:29:02,639 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 22:29:02,640 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 22:29:02,642 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 22:29:02,644 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 22:29:02,645 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 22:29:02,647 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 22:29:02,648 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 22:29:02,650 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 22:29:02,651 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 22:29:02,651 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 22:29:02,652 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 22:29:02,653 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 22:29:02,654 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 22:29:02,655 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 22:29:02,656 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 22:29:02,656 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 22:29:02,657 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 22:29:02,657 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 22:29:02,658 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 22:29:02,659 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 22:29:02,659 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 22:29:02,660 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:29:02,676 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 22:29:02,676 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 22:29:02,680 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 22:29:02,681 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 22:29:02,681 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 22:29:02,681 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 22:29:02,682 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 22:29:02,682 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 22:29:02,682 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 22:29:02,682 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 22:29:02,683 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 22:29:02,685 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 22:29:02,685 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 22:29:02,686 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 22:29:02,686 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 22:29:02,761 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 22:29:02,781 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 22:29:02,785 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 22:29:02,786 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 22:29:02,786 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 22:29:02,787 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl [2018-10-12 22:29:02,787 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl' [2018-10-12 22:29:02,852 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 22:29:02,854 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-12 22:29:02,855 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 22:29:02,855 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 22:29:02,855 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 22:29:02,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,912 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,914 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/1) ... [2018-10-12 22:29:02,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 22:29:02,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 22:29:02,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 22:29:02,918 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 22:29:02,919 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (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:29:03,005 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 22:29:03,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 22:29:03,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 22:29:03,753 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 22:29:03,754 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:03 BoogieIcfgContainer [2018-10-12 22:29:03,754 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 22:29:03,754 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-12 22:29:03,755 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-12 22:29:03,756 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-12 22:29:03,760 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:03" (1/1) ... [2018-10-12 22:29:03,767 INFO L137 apSepIcfgTransformer]: HeapSepIcfgTransformer: Starting heap partitioning [2018-10-12 22:29:03,768 INFO L138 apSepIcfgTransformer]: To be partitioned heap arrays found [#memory_int] [2018-10-12 22:29:03,812 INFO L191 apSepIcfgTransformer]: Heap separator: starting loc-array-style preprocessing [2018-10-12 22:29:03,869 INFO L219 apSepIcfgTransformer]: finished MemlocArrayUpdater [2018-10-12 22:29:03,886 INFO L282 apSepIcfgTransformer]: finished preprocessing for the equality analysis [2018-10-12 22:29:03,960 INFO L101 FixpointEngine]: Starting fixpoint engine with domain VPDomain (maxUnwinding=3, maxParallelStates=1) [2018-10-12 22:31:03,811 INFO L315 AbstractInterpreter]: Visited 115 different actions 693 times. Merged at 96 different actions 557 times. Widened at 6 different actions 16 times. Found 19 fixpoints after 9 different actions. Largest state had 0 variables. [2018-10-12 22:31:03,814 INFO L306 apSepIcfgTransformer]: finished equality analysis [2018-10-12 22:31:03,818 INFO L318 apSepIcfgTransformer]: Finished detection of select terms ("array reads") [2018-10-12 22:31:03,888 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_2_1_1| |v_ULTIMATE.start_write~int_#ptr.base_6|) at (assume #memory_int == write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]];) [2018-10-12 22:31:03,927 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |v_#locv_ULTIMATE.start_write~int_old_#memory_int_4_1_1| |v_ULTIMATE.start_write~int_#ptr.base_12|) at (assume write~int_old_#memory_int[write~int_#ptr.base := write~int_old_#memory_int[write~int_#ptr.base][write~int_#ptr.offset := write~int_#value]] == #memory_int;) [2018-10-12 22:31:03,937 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_15|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:03,938 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_15|) |v_ULTIMATE.start_read~int_#ptr.offset_10|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:03,964 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select |#loc_#memory_int_(Array-Int-#locsort1)| |v_ULTIMATE.start_read~int_#ptr.base_9|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:03,965 WARN L152 HeapPartitionManager]: No literal set constraint found for loc-array access (select (select |#loc_#memory_int_(Array-Int-(Array-Int-#locsort2))| |v_ULTIMATE.start_read~int_#ptr.base_9|) |v_ULTIMATE.start_read~int_#ptr.offset_6|) at (assume #memory_int[read~int_#ptr.base][read~int_#ptr.offset] == read~int_#value;) [2018-10-12 22:31:03,966 INFO L232 HeapPartitionManager]: partitioning result: [2018-10-12 22:31:03,967 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:03,967 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:03,967 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:03,968 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:03,968 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:03,968 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:03,968 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:03,969 INFO L237 HeapPartitionManager]: location blocks for array group [#memory_int, ULTIMATE.start_write~int_old_#memory_int] [2018-10-12 22:31:03,969 INFO L246 HeapPartitionManager]: at dimension 1 [2018-10-12 22:31:03,969 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:03,969 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:03,969 INFO L246 HeapPartitionManager]: at dimension 2 [2018-10-12 22:31:03,970 INFO L247 HeapPartitionManager]: # array writes (possibly including 1 dummy write/NoStoreIndexInfo) : 2 [2018-10-12 22:31:03,970 INFO L248 HeapPartitionManager]: # location blocks :1 [2018-10-12 22:31:03,971 INFO L145 ransitionTransformer]: executing heap partitioning transformation [2018-10-12 22:31:03,995 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:31:03 BasicIcfg [2018-10-12 22:31:03,996 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-12 22:31:03,997 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 22:31:03,997 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 22:31:04,001 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 22:31:04,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 10:29:02" (1/3) ... [2018-10-12 22:31:04,002 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575f6c9e and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 10:31:04, skipping insertion in model container [2018-10-12 22:31:04,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 10:29:03" (2/3) ... [2018-10-12 22:31:04,003 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575f6c9e and model type ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 12.10 10:31:04, skipping insertion in model container [2018-10-12 22:31:04,003 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_19.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 12.10 10:31:03" (3/3) ... [2018-10-12 22:31:04,005 INFO L112 eAbstractionObserver]: Analyzing ICFG memPartitionedIcfg [2018-10-12 22:31:04,015 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 22:31:04,024 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 22:31:04,043 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 22:31:04,068 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 22:31:04,068 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 22:31:04,069 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 22:31:04,069 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 22:31:04,069 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 22:31:04,069 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 22:31:04,069 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 22:31:04,069 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 22:31:04,070 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 22:31:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states. [2018-10-12 22:31:04,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-12 22:31:04,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:04,091 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:31:04,092 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:04,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:04,098 INFO L82 PathProgramCache]: Analyzing trace with hash 2084722416, now seen corresponding path program 1 times [2018-10-12 22:31:04,157 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:04,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:04,309 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:31:04,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 22:31:04,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-12 22:31:04,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-12 22:31:04,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-12 22:31:04,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-12 22:31:04,333 INFO L87 Difference]: Start difference. First operand 111 states. Second operand 3 states. [2018-10-12 22:31:04,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:04,621 INFO L93 Difference]: Finished difference Result 197 states and 201 transitions. [2018-10-12 22:31:04,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-12 22:31:04,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-10-12 22:31:04,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:04,635 INFO L225 Difference]: With dead ends: 197 [2018-10-12 22:31:04,636 INFO L226 Difference]: Without dead ends: 197 [2018-10-12 22:31:04,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-12 22:31:04,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-12 22:31:04,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 112. [2018-10-12 22:31:04,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-12 22:31:04,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 114 transitions. [2018-10-12 22:31:04,699 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 114 transitions. Word has length 24 [2018-10-12 22:31:04,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:04,700 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 114 transitions. [2018-10-12 22:31:04,700 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-12 22:31:04,700 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 114 transitions. [2018-10-12 22:31:04,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-12 22:31:04,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:04,706 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:04,706 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:04,706 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:04,706 INFO L82 PathProgramCache]: Analyzing trace with hash -664785867, now seen corresponding path program 1 times [2018-10-12 22:31:04,707 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:04,953 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:04,953 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:04,953 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-12 22:31:04,955 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-12 22:31:04,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-12 22:31:04,956 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-12 22:31:04,956 INFO L87 Difference]: Start difference. First operand 112 states and 114 transitions. Second operand 5 states. [2018-10-12 22:31:05,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:05,159 INFO L93 Difference]: Finished difference Result 284 states and 290 transitions. [2018-10-12 22:31:05,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-12 22:31:05,163 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 78 [2018-10-12 22:31:05,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:05,169 INFO L225 Difference]: With dead ends: 284 [2018-10-12 22:31:05,169 INFO L226 Difference]: Without dead ends: 284 [2018-10-12 22:31:05,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-12 22:31:05,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-12 22:31:05,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 199. [2018-10-12 22:31:05,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-12 22:31:05,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 203 transitions. [2018-10-12 22:31:05,198 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 203 transitions. Word has length 78 [2018-10-12 22:31:05,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:05,202 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 203 transitions. [2018-10-12 22:31:05,202 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-12 22:31:05,203 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 203 transitions. [2018-10-12 22:31:05,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-12 22:31:05,211 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:05,211 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:05,212 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:05,212 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:05,212 INFO L82 PathProgramCache]: Analyzing trace with hash 728185786, now seen corresponding path program 2 times [2018-10-12 22:31:05,213 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:05,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:05,448 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:05,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:05,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-12 22:31:05,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-12 22:31:05,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-12 22:31:05,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-12 22:31:05,450 INFO L87 Difference]: Start difference. First operand 199 states and 203 transitions. Second operand 7 states. [2018-10-12 22:31:06,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:06,012 INFO L93 Difference]: Finished difference Result 371 states and 379 transitions. [2018-10-12 22:31:06,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 22:31:06,015 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 132 [2018-10-12 22:31:06,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:06,021 INFO L225 Difference]: With dead ends: 371 [2018-10-12 22:31:06,021 INFO L226 Difference]: Without dead ends: 371 [2018-10-12 22:31:06,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-12 22:31:06,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-12 22:31:06,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 286. [2018-10-12 22:31:06,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-10-12 22:31:06,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 292 transitions. [2018-10-12 22:31:06,053 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 292 transitions. Word has length 132 [2018-10-12 22:31:06,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:06,055 INFO L481 AbstractCegarLoop]: Abstraction has 286 states and 292 transitions. [2018-10-12 22:31:06,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-12 22:31:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 292 transitions. [2018-10-12 22:31:06,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-12 22:31:06,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:06,060 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:31:06,061 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:06,061 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:06,061 INFO L82 PathProgramCache]: Analyzing trace with hash -50506369, now seen corresponding path program 3 times [2018-10-12 22:31:06,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:06,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:06,553 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 0 proven. 165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:06,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:06,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-12 22:31:06,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 22:31:06,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 22:31:06,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-12 22:31:06,558 INFO L87 Difference]: Start difference. First operand 286 states and 292 transitions. Second operand 9 states. [2018-10-12 22:31:07,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:07,121 INFO L93 Difference]: Finished difference Result 458 states and 468 transitions. [2018-10-12 22:31:07,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 22:31:07,123 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 186 [2018-10-12 22:31:07,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:07,126 INFO L225 Difference]: With dead ends: 458 [2018-10-12 22:31:07,127 INFO L226 Difference]: Without dead ends: 458 [2018-10-12 22:31:07,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-12 22:31:07,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-12 22:31:07,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 373. [2018-10-12 22:31:07,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-12 22:31:07,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 381 transitions. [2018-10-12 22:31:07,142 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 381 transitions. Word has length 186 [2018-10-12 22:31:07,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:07,143 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 381 transitions. [2018-10-12 22:31:07,143 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 22:31:07,143 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 381 transitions. [2018-10-12 22:31:07,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-12 22:31:07,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:07,148 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:07,149 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:07,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:07,149 INFO L82 PathProgramCache]: Analyzing trace with hash 206326148, now seen corresponding path program 4 times [2018-10-12 22:31:07,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:07,515 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 0 proven. 328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:07,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:07,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-12 22:31:07,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-12 22:31:07,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-12 22:31:07,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-12 22:31:07,517 INFO L87 Difference]: Start difference. First operand 373 states and 381 transitions. Second operand 11 states. [2018-10-12 22:31:07,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:07,788 INFO L93 Difference]: Finished difference Result 545 states and 557 transitions. [2018-10-12 22:31:07,789 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 22:31:07,789 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 240 [2018-10-12 22:31:07,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:07,792 INFO L225 Difference]: With dead ends: 545 [2018-10-12 22:31:07,792 INFO L226 Difference]: Without dead ends: 545 [2018-10-12 22:31:07,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-12 22:31:07,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 545 states. [2018-10-12 22:31:07,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 545 to 460. [2018-10-12 22:31:07,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-12 22:31:07,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 470 transitions. [2018-10-12 22:31:07,806 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 470 transitions. Word has length 240 [2018-10-12 22:31:07,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:07,807 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 470 transitions. [2018-10-12 22:31:07,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-12 22:31:07,807 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 470 transitions. [2018-10-12 22:31:07,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-12 22:31:07,813 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:07,813 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:07,814 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:07,814 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:07,814 INFO L82 PathProgramCache]: Analyzing trace with hash 84010953, now seen corresponding path program 5 times [2018-10-12 22:31:07,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:07,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:08,211 INFO L134 CoverageAnalysis]: Checked inductivity of 545 backedges. 0 proven. 545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:08,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:08,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 22:31:08,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 22:31:08,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 22:31:08,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-12 22:31:08,213 INFO L87 Difference]: Start difference. First operand 460 states and 470 transitions. Second operand 13 states. [2018-10-12 22:31:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:08,657 INFO L93 Difference]: Finished difference Result 632 states and 646 transitions. [2018-10-12 22:31:08,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 22:31:08,657 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 294 [2018-10-12 22:31:08,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:08,661 INFO L225 Difference]: With dead ends: 632 [2018-10-12 22:31:08,661 INFO L226 Difference]: Without dead ends: 632 [2018-10-12 22:31:08,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:31:08,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-12 22:31:08,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 547. [2018-10-12 22:31:08,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 547 states. [2018-10-12 22:31:08,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 547 states to 547 states and 559 transitions. [2018-10-12 22:31:08,672 INFO L78 Accepts]: Start accepts. Automaton has 547 states and 559 transitions. Word has length 294 [2018-10-12 22:31:08,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:08,673 INFO L481 AbstractCegarLoop]: Abstraction has 547 states and 559 transitions. [2018-10-12 22:31:08,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 22:31:08,673 INFO L276 IsEmpty]: Start isEmpty. Operand 547 states and 559 transitions. [2018-10-12 22:31:08,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-12 22:31:08,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:08,678 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:08,679 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:08,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:08,679 INFO L82 PathProgramCache]: Analyzing trace with hash 1951400014, now seen corresponding path program 6 times [2018-10-12 22:31:08,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:08,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 816 backedges. 0 proven. 816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:09,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:09,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 22:31:09,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 22:31:09,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 22:31:09,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-12 22:31:09,795 INFO L87 Difference]: Start difference. First operand 547 states and 559 transitions. Second operand 15 states. [2018-10-12 22:31:10,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:10,363 INFO L93 Difference]: Finished difference Result 719 states and 735 transitions. [2018-10-12 22:31:10,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 22:31:10,365 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 348 [2018-10-12 22:31:10,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:10,368 INFO L225 Difference]: With dead ends: 719 [2018-10-12 22:31:10,368 INFO L226 Difference]: Without dead ends: 719 [2018-10-12 22:31:10,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-12 22:31:10,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 719 states. [2018-10-12 22:31:10,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 719 to 634. [2018-10-12 22:31:10,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2018-10-12 22:31:10,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 648 transitions. [2018-10-12 22:31:10,380 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 648 transitions. Word has length 348 [2018-10-12 22:31:10,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:10,381 INFO L481 AbstractCegarLoop]: Abstraction has 634 states and 648 transitions. [2018-10-12 22:31:10,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 22:31:10,381 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 648 transitions. [2018-10-12 22:31:10,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-12 22:31:10,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:10,385 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:10,386 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:10,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:10,386 INFO L82 PathProgramCache]: Analyzing trace with hash -34839789, now seen corresponding path program 7 times [2018-10-12 22:31:10,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:10,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:11,230 INFO L134 CoverageAnalysis]: Checked inductivity of 1141 backedges. 0 proven. 1141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:11,231 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:11,231 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-12 22:31:11,232 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-12 22:31:11,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-12 22:31:11,232 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-12 22:31:11,232 INFO L87 Difference]: Start difference. First operand 634 states and 648 transitions. Second operand 17 states. [2018-10-12 22:31:12,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:12,285 INFO L93 Difference]: Finished difference Result 806 states and 824 transitions. [2018-10-12 22:31:12,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 22:31:12,288 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 402 [2018-10-12 22:31:12,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:12,295 INFO L225 Difference]: With dead ends: 806 [2018-10-12 22:31:12,295 INFO L226 Difference]: Without dead ends: 806 [2018-10-12 22:31:12,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-12 22:31:12,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-12 22:31:12,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 721. [2018-10-12 22:31:12,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 721 states. [2018-10-12 22:31:12,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 721 states to 721 states and 737 transitions. [2018-10-12 22:31:12,312 INFO L78 Accepts]: Start accepts. Automaton has 721 states and 737 transitions. Word has length 402 [2018-10-12 22:31:12,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:12,313 INFO L481 AbstractCegarLoop]: Abstraction has 721 states and 737 transitions. [2018-10-12 22:31:12,313 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-12 22:31:12,313 INFO L276 IsEmpty]: Start isEmpty. Operand 721 states and 737 transitions. [2018-10-12 22:31:12,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2018-10-12 22:31:12,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:12,318 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:12,318 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:12,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:12,319 INFO L82 PathProgramCache]: Analyzing trace with hash -787423208, now seen corresponding path program 8 times [2018-10-12 22:31:12,319 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:12,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:13,195 INFO L134 CoverageAnalysis]: Checked inductivity of 1520 backedges. 0 proven. 1520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:13,195 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:13,196 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 22:31:13,196 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 22:31:13,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 22:31:13,197 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-12 22:31:13,197 INFO L87 Difference]: Start difference. First operand 721 states and 737 transitions. Second operand 19 states. [2018-10-12 22:31:13,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:13,640 INFO L93 Difference]: Finished difference Result 893 states and 913 transitions. [2018-10-12 22:31:13,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 22:31:13,641 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 456 [2018-10-12 22:31:13,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:13,647 INFO L225 Difference]: With dead ends: 893 [2018-10-12 22:31:13,647 INFO L226 Difference]: Without dead ends: 893 [2018-10-12 22:31:13,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 22:31:13,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2018-10-12 22:31:13,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 808. [2018-10-12 22:31:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 808 states. [2018-10-12 22:31:13,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 808 states to 808 states and 826 transitions. [2018-10-12 22:31:13,660 INFO L78 Accepts]: Start accepts. Automaton has 808 states and 826 transitions. Word has length 456 [2018-10-12 22:31:13,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:13,661 INFO L481 AbstractCegarLoop]: Abstraction has 808 states and 826 transitions. [2018-10-12 22:31:13,661 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 22:31:13,662 INFO L276 IsEmpty]: Start isEmpty. Operand 808 states and 826 transitions. [2018-10-12 22:31:13,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-12 22:31:13,665 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:13,666 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:13,666 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:13,666 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:13,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1568360285, now seen corresponding path program 9 times [2018-10-12 22:31:13,667 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:14,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 0 proven. 1953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:14,673 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:14,673 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-12 22:31:14,674 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 22:31:14,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 22:31:14,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-12 22:31:14,674 INFO L87 Difference]: Start difference. First operand 808 states and 826 transitions. Second operand 21 states. [2018-10-12 22:31:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:15,220 INFO L93 Difference]: Finished difference Result 980 states and 1002 transitions. [2018-10-12 22:31:15,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 22:31:15,221 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 510 [2018-10-12 22:31:15,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:15,225 INFO L225 Difference]: With dead ends: 980 [2018-10-12 22:31:15,226 INFO L226 Difference]: Without dead ends: 980 [2018-10-12 22:31:15,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 22:31:15,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 980 states. [2018-10-12 22:31:15,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 980 to 895. [2018-10-12 22:31:15,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 895 states. [2018-10-12 22:31:15,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 895 states to 895 states and 915 transitions. [2018-10-12 22:31:15,240 INFO L78 Accepts]: Start accepts. Automaton has 895 states and 915 transitions. Word has length 510 [2018-10-12 22:31:15,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:15,241 INFO L481 AbstractCegarLoop]: Abstraction has 895 states and 915 transitions. [2018-10-12 22:31:15,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 22:31:15,241 INFO L276 IsEmpty]: Start isEmpty. Operand 895 states and 915 transitions. [2018-10-12 22:31:15,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 565 [2018-10-12 22:31:15,246 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:15,247 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:15,247 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:15,247 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:15,247 INFO L82 PathProgramCache]: Analyzing trace with hash 1215129826, now seen corresponding path program 10 times [2018-10-12 22:31:15,248 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:15,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2440 backedges. 0 proven. 2440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:15,836 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:15,836 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 22:31:15,837 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 22:31:15,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 22:31:15,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-12 22:31:15,837 INFO L87 Difference]: Start difference. First operand 895 states and 915 transitions. Second operand 23 states. [2018-10-12 22:31:16,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:16,595 INFO L93 Difference]: Finished difference Result 1067 states and 1091 transitions. [2018-10-12 22:31:16,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 22:31:16,596 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 564 [2018-10-12 22:31:16,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:16,602 INFO L225 Difference]: With dead ends: 1067 [2018-10-12 22:31:16,602 INFO L226 Difference]: Without dead ends: 1067 [2018-10-12 22:31:16,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 22:31:16,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1067 states. [2018-10-12 22:31:16,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1067 to 982. [2018-10-12 22:31:16,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 982 states. [2018-10-12 22:31:16,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1004 transitions. [2018-10-12 22:31:16,618 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1004 transitions. Word has length 564 [2018-10-12 22:31:16,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:16,619 INFO L481 AbstractCegarLoop]: Abstraction has 982 states and 1004 transitions. [2018-10-12 22:31:16,619 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 22:31:16,619 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1004 transitions. [2018-10-12 22:31:16,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 619 [2018-10-12 22:31:16,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:16,625 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:16,625 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:16,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:16,626 INFO L82 PathProgramCache]: Analyzing trace with hash -1582492505, now seen corresponding path program 11 times [2018-10-12 22:31:16,626 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 2981 backedges. 0 proven. 2981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:17,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:17,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-12 22:31:17,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-12 22:31:17,851 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-12 22:31:17,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-12 22:31:17,851 INFO L87 Difference]: Start difference. First operand 982 states and 1004 transitions. Second operand 25 states. [2018-10-12 22:31:18,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:18,385 INFO L93 Difference]: Finished difference Result 1154 states and 1180 transitions. [2018-10-12 22:31:18,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 22:31:18,385 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 618 [2018-10-12 22:31:18,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:18,391 INFO L225 Difference]: With dead ends: 1154 [2018-10-12 22:31:18,391 INFO L226 Difference]: Without dead ends: 1154 [2018-10-12 22:31:18,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 22:31:18,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-10-12 22:31:18,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 1069. [2018-10-12 22:31:18,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1069 states. [2018-10-12 22:31:18,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1069 states to 1069 states and 1093 transitions. [2018-10-12 22:31:18,408 INFO L78 Accepts]: Start accepts. Automaton has 1069 states and 1093 transitions. Word has length 618 [2018-10-12 22:31:18,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:18,409 INFO L481 AbstractCegarLoop]: Abstraction has 1069 states and 1093 transitions. [2018-10-12 22:31:18,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-12 22:31:18,409 INFO L276 IsEmpty]: Start isEmpty. Operand 1069 states and 1093 transitions. [2018-10-12 22:31:18,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-12 22:31:18,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:18,415 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:18,415 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:18,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:18,416 INFO L82 PathProgramCache]: Analyzing trace with hash 1485052588, now seen corresponding path program 12 times [2018-10-12 22:31:18,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:19,444 INFO L134 CoverageAnalysis]: Checked inductivity of 3576 backedges. 0 proven. 3576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:19,444 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:19,444 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 22:31:19,445 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 22:31:19,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 22:31:19,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-12 22:31:19,446 INFO L87 Difference]: Start difference. First operand 1069 states and 1093 transitions. Second operand 27 states. [2018-10-12 22:31:20,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:20,180 INFO L93 Difference]: Finished difference Result 1241 states and 1269 transitions. [2018-10-12 22:31:20,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 22:31:20,180 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 672 [2018-10-12 22:31:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:20,186 INFO L225 Difference]: With dead ends: 1241 [2018-10-12 22:31:20,186 INFO L226 Difference]: Without dead ends: 1241 [2018-10-12 22:31:20,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 22:31:20,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1241 states. [2018-10-12 22:31:20,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1241 to 1156. [2018-10-12 22:31:20,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2018-10-12 22:31:20,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1182 transitions. [2018-10-12 22:31:20,203 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1182 transitions. Word has length 672 [2018-10-12 22:31:20,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:20,203 INFO L481 AbstractCegarLoop]: Abstraction has 1156 states and 1182 transitions. [2018-10-12 22:31:20,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 22:31:20,203 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1182 transitions. [2018-10-12 22:31:20,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 727 [2018-10-12 22:31:20,210 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:20,210 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:20,211 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:20,211 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:20,211 INFO L82 PathProgramCache]: Analyzing trace with hash -255833359, now seen corresponding path program 13 times [2018-10-12 22:31:20,212 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:20,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:21,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:21,807 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:21,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 22:31:21,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 22:31:21,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 22:31:21,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-12 22:31:21,809 INFO L87 Difference]: Start difference. First operand 1156 states and 1182 transitions. Second operand 29 states. [2018-10-12 22:31:22,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:22,880 INFO L93 Difference]: Finished difference Result 1328 states and 1358 transitions. [2018-10-12 22:31:22,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 22:31:22,881 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 726 [2018-10-12 22:31:22,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:22,886 INFO L225 Difference]: With dead ends: 1328 [2018-10-12 22:31:22,886 INFO L226 Difference]: Without dead ends: 1328 [2018-10-12 22:31:22,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 22:31:22,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1328 states. [2018-10-12 22:31:22,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1328 to 1243. [2018-10-12 22:31:22,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1243 states. [2018-10-12 22:31:22,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1243 states to 1243 states and 1271 transitions. [2018-10-12 22:31:22,903 INFO L78 Accepts]: Start accepts. Automaton has 1243 states and 1271 transitions. Word has length 726 [2018-10-12 22:31:22,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:22,904 INFO L481 AbstractCegarLoop]: Abstraction has 1243 states and 1271 transitions. [2018-10-12 22:31:22,904 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 22:31:22,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1243 states and 1271 transitions. [2018-10-12 22:31:22,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 781 [2018-10-12 22:31:22,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:22,912 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:22,912 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:22,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:22,913 INFO L82 PathProgramCache]: Analyzing trace with hash 2008249718, now seen corresponding path program 14 times [2018-10-12 22:31:22,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:22,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:23,846 INFO L134 CoverageAnalysis]: Checked inductivity of 4928 backedges. 0 proven. 4928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:23,846 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:23,846 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 22:31:23,847 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 22:31:23,847 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 22:31:23,848 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-12 22:31:23,848 INFO L87 Difference]: Start difference. First operand 1243 states and 1271 transitions. Second operand 31 states. [2018-10-12 22:31:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:24,767 INFO L93 Difference]: Finished difference Result 1415 states and 1447 transitions. [2018-10-12 22:31:24,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 22:31:24,767 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 780 [2018-10-12 22:31:24,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:24,773 INFO L225 Difference]: With dead ends: 1415 [2018-10-12 22:31:24,774 INFO L226 Difference]: Without dead ends: 1415 [2018-10-12 22:31:24,775 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 22:31:24,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1415 states. [2018-10-12 22:31:24,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1415 to 1330. [2018-10-12 22:31:24,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1330 states. [2018-10-12 22:31:24,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1330 states to 1330 states and 1360 transitions. [2018-10-12 22:31:24,792 INFO L78 Accepts]: Start accepts. Automaton has 1330 states and 1360 transitions. Word has length 780 [2018-10-12 22:31:24,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:24,792 INFO L481 AbstractCegarLoop]: Abstraction has 1330 states and 1360 transitions. [2018-10-12 22:31:24,792 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 22:31:24,793 INFO L276 IsEmpty]: Start isEmpty. Operand 1330 states and 1360 transitions. [2018-10-12 22:31:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 835 [2018-10-12 22:31:24,800 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:24,801 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:24,801 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:24,801 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:24,802 INFO L82 PathProgramCache]: Analyzing trace with hash -1187812805, now seen corresponding path program 15 times [2018-10-12 22:31:24,802 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:24,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:26,792 INFO L134 CoverageAnalysis]: Checked inductivity of 5685 backedges. 0 proven. 5685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:26,792 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:26,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 22:31:26,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 22:31:26,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 22:31:26,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 22:31:26,795 INFO L87 Difference]: Start difference. First operand 1330 states and 1360 transitions. Second operand 33 states. [2018-10-12 22:31:27,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:27,722 INFO L93 Difference]: Finished difference Result 1502 states and 1536 transitions. [2018-10-12 22:31:27,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 22:31:27,724 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 834 [2018-10-12 22:31:27,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:27,730 INFO L225 Difference]: With dead ends: 1502 [2018-10-12 22:31:27,730 INFO L226 Difference]: Without dead ends: 1502 [2018-10-12 22:31:27,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 22:31:27,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1502 states. [2018-10-12 22:31:27,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1502 to 1417. [2018-10-12 22:31:27,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1417 states. [2018-10-12 22:31:27,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1417 states to 1417 states and 1449 transitions. [2018-10-12 22:31:27,750 INFO L78 Accepts]: Start accepts. Automaton has 1417 states and 1449 transitions. Word has length 834 [2018-10-12 22:31:27,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:27,751 INFO L481 AbstractCegarLoop]: Abstraction has 1417 states and 1449 transitions. [2018-10-12 22:31:27,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 22:31:27,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1417 states and 1449 transitions. [2018-10-12 22:31:27,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 889 [2018-10-12 22:31:27,759 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:27,760 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:27,760 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:27,760 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:27,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1264977600, now seen corresponding path program 16 times [2018-10-12 22:31:27,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:27,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:29,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6496 backedges. 0 proven. 6496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:29,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:29,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 22:31:29,324 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 22:31:29,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 22:31:29,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 22:31:29,325 INFO L87 Difference]: Start difference. First operand 1417 states and 1449 transitions. Second operand 35 states. [2018-10-12 22:31:30,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:30,256 INFO L93 Difference]: Finished difference Result 1589 states and 1625 transitions. [2018-10-12 22:31:30,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 22:31:30,257 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 888 [2018-10-12 22:31:30,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:30,261 INFO L225 Difference]: With dead ends: 1589 [2018-10-12 22:31:30,261 INFO L226 Difference]: Without dead ends: 1589 [2018-10-12 22:31:30,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 22:31:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1589 states. [2018-10-12 22:31:30,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1589 to 1504. [2018-10-12 22:31:30,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1504 states. [2018-10-12 22:31:30,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1504 states to 1504 states and 1538 transitions. [2018-10-12 22:31:30,279 INFO L78 Accepts]: Start accepts. Automaton has 1504 states and 1538 transitions. Word has length 888 [2018-10-12 22:31:30,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:30,280 INFO L481 AbstractCegarLoop]: Abstraction has 1504 states and 1538 transitions. [2018-10-12 22:31:30,280 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 22:31:30,280 INFO L276 IsEmpty]: Start isEmpty. Operand 1504 states and 1538 transitions. [2018-10-12 22:31:30,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 943 [2018-10-12 22:31:30,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:30,290 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:30,290 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:30,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:30,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1371861637, now seen corresponding path program 17 times [2018-10-12 22:31:30,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:30,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7361 backedges. 0 proven. 7361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:31,594 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:31,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 22:31:31,594 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 22:31:31,595 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 22:31:31,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 22:31:31,595 INFO L87 Difference]: Start difference. First operand 1504 states and 1538 transitions. Second operand 37 states. [2018-10-12 22:31:32,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:32,764 INFO L93 Difference]: Finished difference Result 1676 states and 1714 transitions. [2018-10-12 22:31:32,764 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 22:31:32,764 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 942 [2018-10-12 22:31:32,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:32,770 INFO L225 Difference]: With dead ends: 1676 [2018-10-12 22:31:32,770 INFO L226 Difference]: Without dead ends: 1676 [2018-10-12 22:31:32,772 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 22:31:32,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1676 states. [2018-10-12 22:31:32,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1676 to 1591. [2018-10-12 22:31:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1591 states. [2018-10-12 22:31:32,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 1627 transitions. [2018-10-12 22:31:32,786 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 1627 transitions. Word has length 942 [2018-10-12 22:31:32,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:32,787 INFO L481 AbstractCegarLoop]: Abstraction has 1591 states and 1627 transitions. [2018-10-12 22:31:32,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 22:31:32,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 1627 transitions. [2018-10-12 22:31:32,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 997 [2018-10-12 22:31:32,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:32,797 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:32,797 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:32,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:32,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1444292106, now seen corresponding path program 18 times [2018-10-12 22:31:32,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:32,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:34,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8280 backedges. 0 proven. 8280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:34,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:34,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 22:31:34,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 22:31:34,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 22:31:34,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 22:31:34,270 INFO L87 Difference]: Start difference. First operand 1591 states and 1627 transitions. Second operand 39 states. [2018-10-12 22:31:35,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:35,388 INFO L93 Difference]: Finished difference Result 1763 states and 1803 transitions. [2018-10-12 22:31:35,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-12 22:31:35,389 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 996 [2018-10-12 22:31:35,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:35,395 INFO L225 Difference]: With dead ends: 1763 [2018-10-12 22:31:35,395 INFO L226 Difference]: Without dead ends: 1763 [2018-10-12 22:31:35,397 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 22:31:35,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1763 states. [2018-10-12 22:31:35,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1763 to 1678. [2018-10-12 22:31:35,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1678 states. [2018-10-12 22:31:35,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1678 states to 1678 states and 1716 transitions. [2018-10-12 22:31:35,413 INFO L78 Accepts]: Start accepts. Automaton has 1678 states and 1716 transitions. Word has length 996 [2018-10-12 22:31:35,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:35,414 INFO L481 AbstractCegarLoop]: Abstraction has 1678 states and 1716 transitions. [2018-10-12 22:31:35,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 22:31:35,414 INFO L276 IsEmpty]: Start isEmpty. Operand 1678 states and 1716 transitions. [2018-10-12 22:31:35,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1051 [2018-10-12 22:31:35,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:35,426 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:35,426 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:35,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:35,426 INFO L82 PathProgramCache]: Analyzing trace with hash -1720491057, now seen corresponding path program 19 times [2018-10-12 22:31:35,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:35,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:37,233 INFO L134 CoverageAnalysis]: Checked inductivity of 9253 backedges. 0 proven. 9253 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:37,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:37,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-12 22:31:37,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-12 22:31:37,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-12 22:31:37,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 22:31:37,235 INFO L87 Difference]: Start difference. First operand 1678 states and 1716 transitions. Second operand 41 states. [2018-10-12 22:31:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:38,426 INFO L93 Difference]: Finished difference Result 1850 states and 1892 transitions. [2018-10-12 22:31:38,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 22:31:38,427 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 1050 [2018-10-12 22:31:38,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:38,433 INFO L225 Difference]: With dead ends: 1850 [2018-10-12 22:31:38,433 INFO L226 Difference]: Without dead ends: 1850 [2018-10-12 22:31:38,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 22:31:38,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1850 states. [2018-10-12 22:31:38,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1850 to 1765. [2018-10-12 22:31:38,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1765 states. [2018-10-12 22:31:38,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 1805 transitions. [2018-10-12 22:31:38,450 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 1805 transitions. Word has length 1050 [2018-10-12 22:31:38,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:38,451 INFO L481 AbstractCegarLoop]: Abstraction has 1765 states and 1805 transitions. [2018-10-12 22:31:38,451 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-12 22:31:38,451 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 1805 transitions. [2018-10-12 22:31:38,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1105 [2018-10-12 22:31:38,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:38,463 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:38,463 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:38,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:38,464 INFO L82 PathProgramCache]: Analyzing trace with hash 2068216788, now seen corresponding path program 20 times [2018-10-12 22:31:38,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:40,186 INFO L134 CoverageAnalysis]: Checked inductivity of 10280 backedges. 0 proven. 10280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:40,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:40,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 22:31:40,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 22:31:40,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 22:31:40,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 22:31:40,189 INFO L87 Difference]: Start difference. First operand 1765 states and 1805 transitions. Second operand 43 states. [2018-10-12 22:31:41,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:41,464 INFO L93 Difference]: Finished difference Result 1937 states and 1981 transitions. [2018-10-12 22:31:41,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-12 22:31:41,465 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 1104 [2018-10-12 22:31:41,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:41,471 INFO L225 Difference]: With dead ends: 1937 [2018-10-12 22:31:41,471 INFO L226 Difference]: Without dead ends: 1937 [2018-10-12 22:31:41,473 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 22:31:41,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1937 states. [2018-10-12 22:31:41,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1937 to 1852. [2018-10-12 22:31:41,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1852 states. [2018-10-12 22:31:41,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 1894 transitions. [2018-10-12 22:31:41,488 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 1894 transitions. Word has length 1104 [2018-10-12 22:31:41,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:41,489 INFO L481 AbstractCegarLoop]: Abstraction has 1852 states and 1894 transitions. [2018-10-12 22:31:41,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 22:31:41,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 1894 transitions. [2018-10-12 22:31:41,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1159 [2018-10-12 22:31:41,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:41,502 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:41,502 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:41,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:41,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1753399783, now seen corresponding path program 21 times [2018-10-12 22:31:41,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:41,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:43,391 INFO L134 CoverageAnalysis]: Checked inductivity of 11361 backedges. 0 proven. 11361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:43,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:43,392 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-12 22:31:43,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-12 22:31:43,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-12 22:31:43,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 22:31:43,394 INFO L87 Difference]: Start difference. First operand 1852 states and 1894 transitions. Second operand 45 states. [2018-10-12 22:31:44,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:44,856 INFO L93 Difference]: Finished difference Result 2024 states and 2070 transitions. [2018-10-12 22:31:44,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 22:31:44,858 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 1158 [2018-10-12 22:31:44,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:44,866 INFO L225 Difference]: With dead ends: 2024 [2018-10-12 22:31:44,866 INFO L226 Difference]: Without dead ends: 2024 [2018-10-12 22:31:44,867 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 22:31:44,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states. [2018-10-12 22:31:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 1939. [2018-10-12 22:31:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1939 states. [2018-10-12 22:31:44,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1939 states to 1939 states and 1983 transitions. [2018-10-12 22:31:44,881 INFO L78 Accepts]: Start accepts. Automaton has 1939 states and 1983 transitions. Word has length 1158 [2018-10-12 22:31:44,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:44,881 INFO L481 AbstractCegarLoop]: Abstraction has 1939 states and 1983 transitions. [2018-10-12 22:31:44,881 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-12 22:31:44,881 INFO L276 IsEmpty]: Start isEmpty. Operand 1939 states and 1983 transitions. [2018-10-12 22:31:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2018-10-12 22:31:44,893 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:44,894 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:44,894 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:44,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:44,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1148618082, now seen corresponding path program 22 times [2018-10-12 22:31:44,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:44,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:46,822 INFO L134 CoverageAnalysis]: Checked inductivity of 12496 backedges. 0 proven. 12496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:46,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:46,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 22:31:46,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 22:31:46,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 22:31:46,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 22:31:46,825 INFO L87 Difference]: Start difference. First operand 1939 states and 1983 transitions. Second operand 47 states. [2018-10-12 22:31:48,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:48,698 INFO L93 Difference]: Finished difference Result 2111 states and 2159 transitions. [2018-10-12 22:31:48,698 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-12 22:31:48,698 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1212 [2018-10-12 22:31:48,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:48,705 INFO L225 Difference]: With dead ends: 2111 [2018-10-12 22:31:48,705 INFO L226 Difference]: Without dead ends: 2111 [2018-10-12 22:31:48,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 22:31:48,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2111 states. [2018-10-12 22:31:48,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2111 to 2026. [2018-10-12 22:31:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-12 22:31:48,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2072 transitions. [2018-10-12 22:31:48,720 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2072 transitions. Word has length 1212 [2018-10-12 22:31:48,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:48,721 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2072 transitions. [2018-10-12 22:31:48,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 22:31:48,721 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2072 transitions. [2018-10-12 22:31:48,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-12 22:31:48,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:48,739 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:48,739 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:48,740 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:48,740 INFO L82 PathProgramCache]: Analyzing trace with hash 459342179, now seen corresponding path program 23 times [2018-10-12 22:31:48,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:50,888 INFO L134 CoverageAnalysis]: Checked inductivity of 13685 backedges. 0 proven. 13685 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:50,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:50,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 22:31:50,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 22:31:50,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 22:31:50,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 22:31:50,891 INFO L87 Difference]: Start difference. First operand 2026 states and 2072 transitions. Second operand 49 states. [2018-10-12 22:31:52,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:52,786 INFO L93 Difference]: Finished difference Result 2198 states and 2248 transitions. [2018-10-12 22:31:52,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 22:31:52,786 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1266 [2018-10-12 22:31:52,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:52,794 INFO L225 Difference]: With dead ends: 2198 [2018-10-12 22:31:52,794 INFO L226 Difference]: Without dead ends: 2198 [2018-10-12 22:31:52,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 22:31:52,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2198 states. [2018-10-12 22:31:52,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2198 to 2113. [2018-10-12 22:31:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2113 states. [2018-10-12 22:31:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2113 states to 2113 states and 2161 transitions. [2018-10-12 22:31:52,810 INFO L78 Accepts]: Start accepts. Automaton has 2113 states and 2161 transitions. Word has length 1266 [2018-10-12 22:31:52,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:52,811 INFO L481 AbstractCegarLoop]: Abstraction has 2113 states and 2161 transitions. [2018-10-12 22:31:52,811 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 22:31:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2113 states and 2161 transitions. [2018-10-12 22:31:52,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1321 [2018-10-12 22:31:52,823 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:52,824 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:52,824 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:52,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:52,825 INFO L82 PathProgramCache]: Analyzing trace with hash -964844952, now seen corresponding path program 24 times [2018-10-12 22:31:52,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:52,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:55,187 INFO L134 CoverageAnalysis]: Checked inductivity of 14928 backedges. 0 proven. 14928 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:55,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:55,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 22:31:55,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 22:31:55,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 22:31:55,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 22:31:55,190 INFO L87 Difference]: Start difference. First operand 2113 states and 2161 transitions. Second operand 51 states. [2018-10-12 22:31:57,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:31:57,296 INFO L93 Difference]: Finished difference Result 2285 states and 2337 transitions. [2018-10-12 22:31:57,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-12 22:31:57,297 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1320 [2018-10-12 22:31:57,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:31:57,306 INFO L225 Difference]: With dead ends: 2285 [2018-10-12 22:31:57,306 INFO L226 Difference]: Without dead ends: 2285 [2018-10-12 22:31:57,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 22:31:57,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2285 states. [2018-10-12 22:31:57,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2285 to 2200. [2018-10-12 22:31:57,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2200 states. [2018-10-12 22:31:57,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2200 states to 2200 states and 2250 transitions. [2018-10-12 22:31:57,330 INFO L78 Accepts]: Start accepts. Automaton has 2200 states and 2250 transitions. Word has length 1320 [2018-10-12 22:31:57,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:31:57,331 INFO L481 AbstractCegarLoop]: Abstraction has 2200 states and 2250 transitions. [2018-10-12 22:31:57,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 22:31:57,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2200 states and 2250 transitions. [2018-10-12 22:31:57,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1375 [2018-10-12 22:31:57,353 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:31:57,354 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 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, 1, 1, 1, 1, 1] [2018-10-12 22:31:57,354 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:31:57,355 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:31:57,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1557999021, now seen corresponding path program 25 times [2018-10-12 22:31:57,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:31:57,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:31:59,756 INFO L134 CoverageAnalysis]: Checked inductivity of 16225 backedges. 0 proven. 16225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:31:59,756 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:31:59,756 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 22:31:59,757 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 22:31:59,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 22:31:59,758 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 22:31:59,758 INFO L87 Difference]: Start difference. First operand 2200 states and 2250 transitions. Second operand 53 states. [2018-10-12 22:32:01,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:01,600 INFO L93 Difference]: Finished difference Result 2372 states and 2426 transitions. [2018-10-12 22:32:01,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 22:32:01,600 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1374 [2018-10-12 22:32:01,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:01,607 INFO L225 Difference]: With dead ends: 2372 [2018-10-12 22:32:01,607 INFO L226 Difference]: Without dead ends: 2372 [2018-10-12 22:32:01,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 22:32:01,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2372 states. [2018-10-12 22:32:01,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2372 to 2287. [2018-10-12 22:32:01,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2287 states. [2018-10-12 22:32:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2287 states to 2287 states and 2339 transitions. [2018-10-12 22:32:01,629 INFO L78 Accepts]: Start accepts. Automaton has 2287 states and 2339 transitions. Word has length 1374 [2018-10-12 22:32:01,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:01,630 INFO L481 AbstractCegarLoop]: Abstraction has 2287 states and 2339 transitions. [2018-10-12 22:32:01,630 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 22:32:01,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2287 states and 2339 transitions. [2018-10-12 22:32:01,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1429 [2018-10-12 22:32:01,646 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:01,647 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:01,647 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:01,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:01,648 INFO L82 PathProgramCache]: Analyzing trace with hash 67203890, now seen corresponding path program 26 times [2018-10-12 22:32:01,648 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:01,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:04,616 INFO L134 CoverageAnalysis]: Checked inductivity of 17576 backedges. 0 proven. 17576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:04,617 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:04,617 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 22:32:04,618 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 22:32:04,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 22:32:04,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 22:32:04,618 INFO L87 Difference]: Start difference. First operand 2287 states and 2339 transitions. Second operand 55 states. [2018-10-12 22:32:06,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:06,670 INFO L93 Difference]: Finished difference Result 2459 states and 2515 transitions. [2018-10-12 22:32:06,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 22:32:06,670 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1428 [2018-10-12 22:32:06,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:06,676 INFO L225 Difference]: With dead ends: 2459 [2018-10-12 22:32:06,677 INFO L226 Difference]: Without dead ends: 2459 [2018-10-12 22:32:06,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 22:32:06,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2459 states. [2018-10-12 22:32:06,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2459 to 2374. [2018-10-12 22:32:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2374 states. [2018-10-12 22:32:06,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2374 states to 2374 states and 2428 transitions. [2018-10-12 22:32:06,694 INFO L78 Accepts]: Start accepts. Automaton has 2374 states and 2428 transitions. Word has length 1428 [2018-10-12 22:32:06,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:06,695 INFO L481 AbstractCegarLoop]: Abstraction has 2374 states and 2428 transitions. [2018-10-12 22:32:06,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 22:32:06,695 INFO L276 IsEmpty]: Start isEmpty. Operand 2374 states and 2428 transitions. [2018-10-12 22:32:06,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1483 [2018-10-12 22:32:06,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:06,719 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:06,719 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:06,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:06,719 INFO L82 PathProgramCache]: Analyzing trace with hash -1678753033, now seen corresponding path program 27 times [2018-10-12 22:32:06,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:06,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:09,734 INFO L134 CoverageAnalysis]: Checked inductivity of 18981 backedges. 0 proven. 18981 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:09,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:09,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-12 22:32:09,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-12 22:32:09,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-12 22:32:09,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 22:32:09,736 INFO L87 Difference]: Start difference. First operand 2374 states and 2428 transitions. Second operand 57 states. [2018-10-12 22:32:12,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:12,127 INFO L93 Difference]: Finished difference Result 2546 states and 2604 transitions. [2018-10-12 22:32:12,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 22:32:12,127 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 1482 [2018-10-12 22:32:12,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:12,131 INFO L225 Difference]: With dead ends: 2546 [2018-10-12 22:32:12,131 INFO L226 Difference]: Without dead ends: 2546 [2018-10-12 22:32:12,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 22:32:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2546 states. [2018-10-12 22:32:12,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2546 to 2461. [2018-10-12 22:32:12,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2461 states. [2018-10-12 22:32:12,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2461 states to 2461 states and 2517 transitions. [2018-10-12 22:32:12,148 INFO L78 Accepts]: Start accepts. Automaton has 2461 states and 2517 transitions. Word has length 1482 [2018-10-12 22:32:12,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:12,148 INFO L481 AbstractCegarLoop]: Abstraction has 2461 states and 2517 transitions. [2018-10-12 22:32:12,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-12 22:32:12,149 INFO L276 IsEmpty]: Start isEmpty. Operand 2461 states and 2517 transitions. [2018-10-12 22:32:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1537 [2018-10-12 22:32:12,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:12,176 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:12,176 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:12,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 875785468, now seen corresponding path program 28 times [2018-10-12 22:32:12,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:12,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:15,157 INFO L134 CoverageAnalysis]: Checked inductivity of 20440 backedges. 0 proven. 20440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:15,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:15,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-12 22:32:15,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-12 22:32:15,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-12 22:32:15,159 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 22:32:15,160 INFO L87 Difference]: Start difference. First operand 2461 states and 2517 transitions. Second operand 59 states. [2018-10-12 22:32:17,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:17,479 INFO L93 Difference]: Finished difference Result 2633 states and 2693 transitions. [2018-10-12 22:32:17,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 22:32:17,479 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 1536 [2018-10-12 22:32:17,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:17,485 INFO L225 Difference]: With dead ends: 2633 [2018-10-12 22:32:17,485 INFO L226 Difference]: Without dead ends: 2633 [2018-10-12 22:32:17,486 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-12 22:32:17,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2633 states. [2018-10-12 22:32:17,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2633 to 2548. [2018-10-12 22:32:17,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2548 states. [2018-10-12 22:32:17,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 2606 transitions. [2018-10-12 22:32:17,507 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 2606 transitions. Word has length 1536 [2018-10-12 22:32:17,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:17,508 INFO L481 AbstractCegarLoop]: Abstraction has 2548 states and 2606 transitions. [2018-10-12 22:32:17,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-12 22:32:17,508 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 2606 transitions. [2018-10-12 22:32:17,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1591 [2018-10-12 22:32:17,530 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:17,531 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:17,531 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:17,531 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:17,532 INFO L82 PathProgramCache]: Analyzing trace with hash -1059536575, now seen corresponding path program 29 times [2018-10-12 22:32:17,532 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:20,521 INFO L134 CoverageAnalysis]: Checked inductivity of 21953 backedges. 0 proven. 21953 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:20,522 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:20,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-12 22:32:20,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-12 22:32:20,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-12 22:32:20,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-12 22:32:20,524 INFO L87 Difference]: Start difference. First operand 2548 states and 2606 transitions. Second operand 61 states. [2018-10-12 22:32:23,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:23,430 INFO L93 Difference]: Finished difference Result 2720 states and 2782 transitions. [2018-10-12 22:32:23,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 22:32:23,430 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 1590 [2018-10-12 22:32:23,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:23,436 INFO L225 Difference]: With dead ends: 2720 [2018-10-12 22:32:23,436 INFO L226 Difference]: Without dead ends: 2720 [2018-10-12 22:32:23,438 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-12 22:32:23,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2720 states. [2018-10-12 22:32:23,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2720 to 2635. [2018-10-12 22:32:23,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2635 states. [2018-10-12 22:32:23,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2635 states to 2635 states and 2695 transitions. [2018-10-12 22:32:23,459 INFO L78 Accepts]: Start accepts. Automaton has 2635 states and 2695 transitions. Word has length 1590 [2018-10-12 22:32:23,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:23,461 INFO L481 AbstractCegarLoop]: Abstraction has 2635 states and 2695 transitions. [2018-10-12 22:32:23,461 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-12 22:32:23,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2635 states and 2695 transitions. [2018-10-12 22:32:23,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1645 [2018-10-12 22:32:23,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:23,486 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:23,487 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:23,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:23,487 INFO L82 PathProgramCache]: Analyzing trace with hash 259133382, now seen corresponding path program 30 times [2018-10-12 22:32:23,488 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:27,492 INFO L134 CoverageAnalysis]: Checked inductivity of 23520 backedges. 0 proven. 23520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:27,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:27,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-12 22:32:27,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-12 22:32:27,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-12 22:32:27,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 22:32:27,494 INFO L87 Difference]: Start difference. First operand 2635 states and 2695 transitions. Second operand 63 states. [2018-10-12 22:32:30,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:30,370 INFO L93 Difference]: Finished difference Result 2807 states and 2871 transitions. [2018-10-12 22:32:30,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-12 22:32:30,370 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 1644 [2018-10-12 22:32:30,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:30,375 INFO L225 Difference]: With dead ends: 2807 [2018-10-12 22:32:30,375 INFO L226 Difference]: Without dead ends: 2807 [2018-10-12 22:32:30,377 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-12 22:32:30,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2807 states. [2018-10-12 22:32:30,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2807 to 2722. [2018-10-12 22:32:30,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2722 states. [2018-10-12 22:32:30,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2722 states to 2722 states and 2784 transitions. [2018-10-12 22:32:30,398 INFO L78 Accepts]: Start accepts. Automaton has 2722 states and 2784 transitions. Word has length 1644 [2018-10-12 22:32:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:30,400 INFO L481 AbstractCegarLoop]: Abstraction has 2722 states and 2784 transitions. [2018-10-12 22:32:30,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-12 22:32:30,400 INFO L276 IsEmpty]: Start isEmpty. Operand 2722 states and 2784 transitions. [2018-10-12 22:32:30,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1699 [2018-10-12 22:32:30,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:30,429 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:30,429 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:30,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:30,430 INFO L82 PathProgramCache]: Analyzing trace with hash -65722229, now seen corresponding path program 31 times [2018-10-12 22:32:30,431 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:30,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:33,823 INFO L134 CoverageAnalysis]: Checked inductivity of 25141 backedges. 0 proven. 25141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:33,823 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:33,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-12 22:32:33,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-12 22:32:33,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-12 22:32:33,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 22:32:33,825 INFO L87 Difference]: Start difference. First operand 2722 states and 2784 transitions. Second operand 65 states. [2018-10-12 22:32:36,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:36,804 INFO L93 Difference]: Finished difference Result 2894 states and 2960 transitions. [2018-10-12 22:32:36,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 22:32:36,805 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 1698 [2018-10-12 22:32:36,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:36,809 INFO L225 Difference]: With dead ends: 2894 [2018-10-12 22:32:36,809 INFO L226 Difference]: Without dead ends: 2894 [2018-10-12 22:32:36,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-12 22:32:36,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2894 states. [2018-10-12 22:32:36,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2894 to 2809. [2018-10-12 22:32:36,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2809 states. [2018-10-12 22:32:36,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2809 states to 2809 states and 2873 transitions. [2018-10-12 22:32:36,838 INFO L78 Accepts]: Start accepts. Automaton has 2809 states and 2873 transitions. Word has length 1698 [2018-10-12 22:32:36,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:36,840 INFO L481 AbstractCegarLoop]: Abstraction has 2809 states and 2873 transitions. [2018-10-12 22:32:36,840 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-12 22:32:36,840 INFO L276 IsEmpty]: Start isEmpty. Operand 2809 states and 2873 transitions. [2018-10-12 22:32:36,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1753 [2018-10-12 22:32:36,867 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:36,868 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:36,868 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:36,868 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:36,868 INFO L82 PathProgramCache]: Analyzing trace with hash -430187632, now seen corresponding path program 32 times [2018-10-12 22:32:36,869 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:36,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:40,539 INFO L134 CoverageAnalysis]: Checked inductivity of 26816 backedges. 0 proven. 26816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:40,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:40,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-12 22:32:40,542 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-12 22:32:40,542 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-12 22:32:40,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 22:32:40,543 INFO L87 Difference]: Start difference. First operand 2809 states and 2873 transitions. Second operand 67 states. [2018-10-12 22:32:43,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:43,966 INFO L93 Difference]: Finished difference Result 2981 states and 3049 transitions. [2018-10-12 22:32:43,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-12 22:32:43,966 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 1752 [2018-10-12 22:32:43,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:43,969 INFO L225 Difference]: With dead ends: 2981 [2018-10-12 22:32:43,969 INFO L226 Difference]: Without dead ends: 2981 [2018-10-12 22:32:43,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-12 22:32:43,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2981 states. [2018-10-12 22:32:43,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2981 to 2896. [2018-10-12 22:32:43,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2896 states. [2018-10-12 22:32:43,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2896 states to 2896 states and 2962 transitions. [2018-10-12 22:32:43,988 INFO L78 Accepts]: Start accepts. Automaton has 2896 states and 2962 transitions. Word has length 1752 [2018-10-12 22:32:43,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:43,989 INFO L481 AbstractCegarLoop]: Abstraction has 2896 states and 2962 transitions. [2018-10-12 22:32:43,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-12 22:32:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand 2896 states and 2962 transitions. [2018-10-12 22:32:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1807 [2018-10-12 22:32:44,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:44,012 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:44,013 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:44,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:44,013 INFO L82 PathProgramCache]: Analyzing trace with hash 1717827797, now seen corresponding path program 33 times [2018-10-12 22:32:44,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:44,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:47,599 INFO L134 CoverageAnalysis]: Checked inductivity of 28545 backedges. 0 proven. 28545 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:47,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:47,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-12 22:32:47,601 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-12 22:32:47,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-12 22:32:47,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 22:32:47,601 INFO L87 Difference]: Start difference. First operand 2896 states and 2962 transitions. Second operand 69 states. [2018-10-12 22:32:51,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:51,004 INFO L93 Difference]: Finished difference Result 3068 states and 3138 transitions. [2018-10-12 22:32:51,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 22:32:51,004 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 1806 [2018-10-12 22:32:51,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:51,007 INFO L225 Difference]: With dead ends: 3068 [2018-10-12 22:32:51,007 INFO L226 Difference]: Without dead ends: 3068 [2018-10-12 22:32:51,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-12 22:32:51,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3068 states. [2018-10-12 22:32:51,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3068 to 2983. [2018-10-12 22:32:51,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2983 states. [2018-10-12 22:32:51,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2983 states to 2983 states and 3051 transitions. [2018-10-12 22:32:51,025 INFO L78 Accepts]: Start accepts. Automaton has 2983 states and 3051 transitions. Word has length 1806 [2018-10-12 22:32:51,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:51,026 INFO L481 AbstractCegarLoop]: Abstraction has 2983 states and 3051 transitions. [2018-10-12 22:32:51,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-12 22:32:51,026 INFO L276 IsEmpty]: Start isEmpty. Operand 2983 states and 3051 transitions. [2018-10-12 22:32:51,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1861 [2018-10-12 22:32:51,067 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:51,068 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:51,068 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:51,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:51,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1104105562, now seen corresponding path program 34 times [2018-10-12 22:32:51,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:51,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:32:54,827 INFO L134 CoverageAnalysis]: Checked inductivity of 30328 backedges. 0 proven. 30328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:32:54,828 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:32:54,828 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-12 22:32:54,829 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-12 22:32:54,830 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-12 22:32:54,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 22:32:54,830 INFO L87 Difference]: Start difference. First operand 2983 states and 3051 transitions. Second operand 71 states. [2018-10-12 22:32:58,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:32:58,070 INFO L93 Difference]: Finished difference Result 3155 states and 3227 transitions. [2018-10-12 22:32:58,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-12 22:32:58,070 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 1860 [2018-10-12 22:32:58,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:32:58,074 INFO L225 Difference]: With dead ends: 3155 [2018-10-12 22:32:58,074 INFO L226 Difference]: Without dead ends: 3155 [2018-10-12 22:32:58,076 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-12 22:32:58,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3155 states. [2018-10-12 22:32:58,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3155 to 3070. [2018-10-12 22:32:58,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3070 states. [2018-10-12 22:32:58,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3070 states to 3070 states and 3140 transitions. [2018-10-12 22:32:58,094 INFO L78 Accepts]: Start accepts. Automaton has 3070 states and 3140 transitions. Word has length 1860 [2018-10-12 22:32:58,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:32:58,095 INFO L481 AbstractCegarLoop]: Abstraction has 3070 states and 3140 transitions. [2018-10-12 22:32:58,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-12 22:32:58,095 INFO L276 IsEmpty]: Start isEmpty. Operand 3070 states and 3140 transitions. [2018-10-12 22:32:58,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1915 [2018-10-12 22:32:58,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:32:58,130 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 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, 1, 1, 1, 1, 1] [2018-10-12 22:32:58,131 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:32:58,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:32:58,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1597787617, now seen corresponding path program 35 times [2018-10-12 22:32:58,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:32:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:02,310 INFO L134 CoverageAnalysis]: Checked inductivity of 32165 backedges. 0 proven. 32165 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:02,310 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:02,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-12 22:33:02,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-12 22:33:02,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-12 22:33:02,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 22:33:02,312 INFO L87 Difference]: Start difference. First operand 3070 states and 3140 transitions. Second operand 73 states. [2018-10-12 22:33:06,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:06,399 INFO L93 Difference]: Finished difference Result 3242 states and 3316 transitions. [2018-10-12 22:33:06,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-12 22:33:06,400 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 1914 [2018-10-12 22:33:06,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:06,402 INFO L225 Difference]: With dead ends: 3242 [2018-10-12 22:33:06,402 INFO L226 Difference]: Without dead ends: 3242 [2018-10-12 22:33:06,404 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-12 22:33:06,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3242 states. [2018-10-12 22:33:06,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3242 to 3157. [2018-10-12 22:33:06,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3157 states. [2018-10-12 22:33:06,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3157 states to 3157 states and 3229 transitions. [2018-10-12 22:33:06,421 INFO L78 Accepts]: Start accepts. Automaton has 3157 states and 3229 transitions. Word has length 1914 [2018-10-12 22:33:06,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:06,422 INFO L481 AbstractCegarLoop]: Abstraction has 3157 states and 3229 transitions. [2018-10-12 22:33:06,422 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-12 22:33:06,422 INFO L276 IsEmpty]: Start isEmpty. Operand 3157 states and 3229 transitions. [2018-10-12 22:33:06,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1969 [2018-10-12 22:33:06,445 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:06,446 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 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, 1, 1, 1, 1, 1] [2018-10-12 22:33:06,446 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:06,446 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:06,447 INFO L82 PathProgramCache]: Analyzing trace with hash -2098532828, now seen corresponding path program 36 times [2018-10-12 22:33:06,447 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:06,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:10,692 INFO L134 CoverageAnalysis]: Checked inductivity of 34056 backedges. 0 proven. 34056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:10,693 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:10,693 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-12 22:33:10,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-12 22:33:10,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-12 22:33:10,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 22:33:10,696 INFO L87 Difference]: Start difference. First operand 3157 states and 3229 transitions. Second operand 75 states. [2018-10-12 22:33:14,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:14,632 INFO L93 Difference]: Finished difference Result 3329 states and 3405 transitions. [2018-10-12 22:33:14,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 22:33:14,632 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 1968 [2018-10-12 22:33:14,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:14,636 INFO L225 Difference]: With dead ends: 3329 [2018-10-12 22:33:14,636 INFO L226 Difference]: Without dead ends: 3329 [2018-10-12 22:33:14,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-12 22:33:14,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3329 states. [2018-10-12 22:33:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3329 to 3244. [2018-10-12 22:33:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3244 states. [2018-10-12 22:33:14,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3244 states to 3244 states and 3318 transitions. [2018-10-12 22:33:14,658 INFO L78 Accepts]: Start accepts. Automaton has 3244 states and 3318 transitions. Word has length 1968 [2018-10-12 22:33:14,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:14,659 INFO L481 AbstractCegarLoop]: Abstraction has 3244 states and 3318 transitions. [2018-10-12 22:33:14,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-12 22:33:14,659 INFO L276 IsEmpty]: Start isEmpty. Operand 3244 states and 3318 transitions. [2018-10-12 22:33:14,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2023 [2018-10-12 22:33:14,694 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:14,695 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 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, 1, 1, 1, 1, 1] [2018-10-12 22:33:14,695 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:14,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:14,696 INFO L82 PathProgramCache]: Analyzing trace with hash 1953682537, now seen corresponding path program 37 times [2018-10-12 22:33:14,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:19,101 INFO L134 CoverageAnalysis]: Checked inductivity of 36001 backedges. 0 proven. 36001 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:19,101 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:19,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-12 22:33:19,103 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-12 22:33:19,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-12 22:33:19,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 22:33:19,104 INFO L87 Difference]: Start difference. First operand 3244 states and 3318 transitions. Second operand 77 states. [2018-10-12 22:33:23,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:23,025 INFO L93 Difference]: Finished difference Result 3416 states and 3494 transitions. [2018-10-12 22:33:23,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-12 22:33:23,025 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 2022 [2018-10-12 22:33:23,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:23,029 INFO L225 Difference]: With dead ends: 3416 [2018-10-12 22:33:23,029 INFO L226 Difference]: Without dead ends: 3416 [2018-10-12 22:33:23,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-12 22:33:23,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3416 states. [2018-10-12 22:33:23,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3416 to 3331. [2018-10-12 22:33:23,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3331 states. [2018-10-12 22:33:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3331 states to 3331 states and 3407 transitions. [2018-10-12 22:33:23,050 INFO L78 Accepts]: Start accepts. Automaton has 3331 states and 3407 transitions. Word has length 2022 [2018-10-12 22:33:23,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:23,050 INFO L481 AbstractCegarLoop]: Abstraction has 3331 states and 3407 transitions. [2018-10-12 22:33:23,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-12 22:33:23,051 INFO L276 IsEmpty]: Start isEmpty. Operand 3331 states and 3407 transitions. [2018-10-12 22:33:23,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2077 [2018-10-12 22:33:23,092 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:23,093 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 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, 1, 1, 1, 1, 1] [2018-10-12 22:33:23,093 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:23,093 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:23,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2096286482, now seen corresponding path program 38 times [2018-10-12 22:33:23,094 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:23,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:28,078 INFO L134 CoverageAnalysis]: Checked inductivity of 38000 backedges. 0 proven. 38000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:28,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:28,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-12 22:33:28,079 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-12 22:33:28,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-12 22:33:28,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 22:33:28,080 INFO L87 Difference]: Start difference. First operand 3331 states and 3407 transitions. Second operand 79 states. [2018-10-12 22:33:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:32,321 INFO L93 Difference]: Finished difference Result 3503 states and 3583 transitions. [2018-10-12 22:33:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-12 22:33:32,321 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 2076 [2018-10-12 22:33:32,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:32,325 INFO L225 Difference]: With dead ends: 3503 [2018-10-12 22:33:32,325 INFO L226 Difference]: Without dead ends: 3503 [2018-10-12 22:33:32,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-12 22:33:32,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3503 states. [2018-10-12 22:33:32,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3503 to 3418. [2018-10-12 22:33:32,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3418 states. [2018-10-12 22:33:32,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3418 states to 3418 states and 3496 transitions. [2018-10-12 22:33:32,350 INFO L78 Accepts]: Start accepts. Automaton has 3418 states and 3496 transitions. Word has length 2076 [2018-10-12 22:33:32,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:32,351 INFO L481 AbstractCegarLoop]: Abstraction has 3418 states and 3496 transitions. [2018-10-12 22:33:32,352 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-12 22:33:32,352 INFO L276 IsEmpty]: Start isEmpty. Operand 3418 states and 3496 transitions. [2018-10-12 22:33:32,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2131 [2018-10-12 22:33:32,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:32,378 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 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, 1, 1, 1, 1, 1] [2018-10-12 22:33:32,379 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:32,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:32,379 INFO L82 PathProgramCache]: Analyzing trace with hash 1928322995, now seen corresponding path program 39 times [2018-10-12 22:33:32,379 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:32,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:37,446 INFO L134 CoverageAnalysis]: Checked inductivity of 40053 backedges. 0 proven. 40053 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:37,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:37,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-12 22:33:37,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-12 22:33:37,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-12 22:33:37,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 22:33:37,449 INFO L87 Difference]: Start difference. First operand 3418 states and 3496 transitions. Second operand 81 states. [2018-10-12 22:33:42,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:42,300 INFO L93 Difference]: Finished difference Result 3590 states and 3672 transitions. [2018-10-12 22:33:42,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 22:33:42,300 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 2130 [2018-10-12 22:33:42,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:42,304 INFO L225 Difference]: With dead ends: 3590 [2018-10-12 22:33:42,304 INFO L226 Difference]: Without dead ends: 3590 [2018-10-12 22:33:42,305 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-12 22:33:42,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3590 states. [2018-10-12 22:33:42,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3590 to 3505. [2018-10-12 22:33:42,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3505 states. [2018-10-12 22:33:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3505 states to 3505 states and 3585 transitions. [2018-10-12 22:33:42,321 INFO L78 Accepts]: Start accepts. Automaton has 3505 states and 3585 transitions. Word has length 2130 [2018-10-12 22:33:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:42,322 INFO L481 AbstractCegarLoop]: Abstraction has 3505 states and 3585 transitions. [2018-10-12 22:33:42,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-12 22:33:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 3505 states and 3585 transitions. [2018-10-12 22:33:42,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2185 [2018-10-12 22:33:42,376 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:42,377 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:42,377 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:42,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:42,377 INFO L82 PathProgramCache]: Analyzing trace with hash 869573816, now seen corresponding path program 40 times [2018-10-12 22:33:42,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:42,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:47,525 INFO L134 CoverageAnalysis]: Checked inductivity of 42160 backedges. 0 proven. 42160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:47,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:47,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-12 22:33:47,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-12 22:33:47,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-12 22:33:47,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 22:33:47,528 INFO L87 Difference]: Start difference. First operand 3505 states and 3585 transitions. Second operand 83 states. [2018-10-12 22:33:52,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:33:52,451 INFO L93 Difference]: Finished difference Result 3677 states and 3761 transitions. [2018-10-12 22:33:52,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-12 22:33:52,451 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 2184 [2018-10-12 22:33:52,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:33:52,455 INFO L225 Difference]: With dead ends: 3677 [2018-10-12 22:33:52,455 INFO L226 Difference]: Without dead ends: 3677 [2018-10-12 22:33:52,457 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 22:33:52,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3677 states. [2018-10-12 22:33:52,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3677 to 3592. [2018-10-12 22:33:52,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3592 states. [2018-10-12 22:33:52,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3592 states to 3592 states and 3674 transitions. [2018-10-12 22:33:52,478 INFO L78 Accepts]: Start accepts. Automaton has 3592 states and 3674 transitions. Word has length 2184 [2018-10-12 22:33:52,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:33:52,479 INFO L481 AbstractCegarLoop]: Abstraction has 3592 states and 3674 transitions. [2018-10-12 22:33:52,479 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-12 22:33:52,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3592 states and 3674 transitions. [2018-10-12 22:33:52,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2239 [2018-10-12 22:33:52,507 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:33:52,508 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:33:52,508 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:33:52,508 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:33:52,509 INFO L82 PathProgramCache]: Analyzing trace with hash -1778822147, now seen corresponding path program 41 times [2018-10-12 22:33:52,509 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:33:52,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:33:57,700 INFO L134 CoverageAnalysis]: Checked inductivity of 44321 backedges. 0 proven. 44321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:33:57,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:33:57,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-12 22:33:57,702 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-12 22:33:57,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-12 22:33:57,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 22:33:57,703 INFO L87 Difference]: Start difference. First operand 3592 states and 3674 transitions. Second operand 85 states. [2018-10-12 22:34:03,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:03,028 INFO L93 Difference]: Finished difference Result 3764 states and 3850 transitions. [2018-10-12 22:34:03,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-12 22:34:03,029 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 2238 [2018-10-12 22:34:03,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:03,033 INFO L225 Difference]: With dead ends: 3764 [2018-10-12 22:34:03,033 INFO L226 Difference]: Without dead ends: 3764 [2018-10-12 22:34:03,035 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-12 22:34:03,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3764 states. [2018-10-12 22:34:03,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3764 to 3679. [2018-10-12 22:34:03,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3679 states. [2018-10-12 22:34:03,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3679 states to 3679 states and 3763 transitions. [2018-10-12 22:34:03,054 INFO L78 Accepts]: Start accepts. Automaton has 3679 states and 3763 transitions. Word has length 2238 [2018-10-12 22:34:03,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:03,055 INFO L481 AbstractCegarLoop]: Abstraction has 3679 states and 3763 transitions. [2018-10-12 22:34:03,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-12 22:34:03,056 INFO L276 IsEmpty]: Start isEmpty. Operand 3679 states and 3763 transitions. [2018-10-12 22:34:03,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2293 [2018-10-12 22:34:03,107 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:03,107 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:03,108 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:03,108 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:03,108 INFO L82 PathProgramCache]: Analyzing trace with hash 1059044738, now seen corresponding path program 42 times [2018-10-12 22:34:03,109 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:03,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:09,198 INFO L134 CoverageAnalysis]: Checked inductivity of 46536 backedges. 0 proven. 46536 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:09,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:09,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-12 22:34:09,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-12 22:34:09,201 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-12 22:34:09,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 22:34:09,202 INFO L87 Difference]: Start difference. First operand 3679 states and 3763 transitions. Second operand 87 states. [2018-10-12 22:34:14,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:14,457 INFO L93 Difference]: Finished difference Result 3851 states and 3939 transitions. [2018-10-12 22:34:14,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-12 22:34:14,457 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 2292 [2018-10-12 22:34:14,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:14,462 INFO L225 Difference]: With dead ends: 3851 [2018-10-12 22:34:14,463 INFO L226 Difference]: Without dead ends: 3851 [2018-10-12 22:34:14,465 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-12 22:34:14,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3851 states. [2018-10-12 22:34:14,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3851 to 3766. [2018-10-12 22:34:14,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3766 states. [2018-10-12 22:34:14,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3766 states to 3766 states and 3852 transitions. [2018-10-12 22:34:14,486 INFO L78 Accepts]: Start accepts. Automaton has 3766 states and 3852 transitions. Word has length 2292 [2018-10-12 22:34:14,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:14,487 INFO L481 AbstractCegarLoop]: Abstraction has 3766 states and 3852 transitions. [2018-10-12 22:34:14,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-12 22:34:14,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3766 states and 3852 transitions. [2018-10-12 22:34:14,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2347 [2018-10-12 22:34:14,516 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:14,517 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:14,517 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:14,517 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:14,518 INFO L82 PathProgramCache]: Analyzing trace with hash -544362169, now seen corresponding path program 43 times [2018-10-12 22:34:14,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:20,628 INFO L134 CoverageAnalysis]: Checked inductivity of 48805 backedges. 0 proven. 48805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:20,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:20,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-12 22:34:20,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-12 22:34:20,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-12 22:34:20,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-12 22:34:20,631 INFO L87 Difference]: Start difference. First operand 3766 states and 3852 transitions. Second operand 89 states. [2018-10-12 22:34:26,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:26,135 INFO L93 Difference]: Finished difference Result 3938 states and 4028 transitions. [2018-10-12 22:34:26,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-12 22:34:26,135 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 2346 [2018-10-12 22:34:26,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:26,140 INFO L225 Difference]: With dead ends: 3938 [2018-10-12 22:34:26,140 INFO L226 Difference]: Without dead ends: 3938 [2018-10-12 22:34:26,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-12 22:34:26,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3938 states. [2018-10-12 22:34:26,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3938 to 3853. [2018-10-12 22:34:26,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3853 states. [2018-10-12 22:34:26,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 3941 transitions. [2018-10-12 22:34:26,164 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 3941 transitions. Word has length 2346 [2018-10-12 22:34:26,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:26,166 INFO L481 AbstractCegarLoop]: Abstraction has 3853 states and 3941 transitions. [2018-10-12 22:34:26,166 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-12 22:34:26,166 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 3941 transitions. [2018-10-12 22:34:26,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2401 [2018-10-12 22:34:26,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:26,205 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:26,205 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:26,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:26,205 INFO L82 PathProgramCache]: Analyzing trace with hash -1492320436, now seen corresponding path program 44 times [2018-10-12 22:34:26,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:26,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:32,157 INFO L134 CoverageAnalysis]: Checked inductivity of 51128 backedges. 0 proven. 51128 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:32,158 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:32,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-12 22:34:32,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-12 22:34:32,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-12 22:34:32,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 22:34:32,161 INFO L87 Difference]: Start difference. First operand 3853 states and 3941 transitions. Second operand 91 states. [2018-10-12 22:34:38,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:38,033 INFO L93 Difference]: Finished difference Result 4025 states and 4117 transitions. [2018-10-12 22:34:38,034 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-12 22:34:38,034 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 2400 [2018-10-12 22:34:38,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:38,038 INFO L225 Difference]: With dead ends: 4025 [2018-10-12 22:34:38,038 INFO L226 Difference]: Without dead ends: 4025 [2018-10-12 22:34:38,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-12 22:34:38,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4025 states. [2018-10-12 22:34:38,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4025 to 3940. [2018-10-12 22:34:38,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3940 states. [2018-10-12 22:34:38,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3940 states to 3940 states and 4030 transitions. [2018-10-12 22:34:38,060 INFO L78 Accepts]: Start accepts. Automaton has 3940 states and 4030 transitions. Word has length 2400 [2018-10-12 22:34:38,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:38,061 INFO L481 AbstractCegarLoop]: Abstraction has 3940 states and 4030 transitions. [2018-10-12 22:34:38,061 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-12 22:34:38,061 INFO L276 IsEmpty]: Start isEmpty. Operand 3940 states and 4030 transitions. [2018-10-12 22:34:38,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2455 [2018-10-12 22:34:38,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:38,115 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:38,115 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:38,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:38,115 INFO L82 PathProgramCache]: Analyzing trace with hash -102008943, now seen corresponding path program 45 times [2018-10-12 22:34:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:38,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:44,182 INFO L134 CoverageAnalysis]: Checked inductivity of 53505 backedges. 0 proven. 53505 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:44,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:44,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-12 22:34:44,184 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-12 22:34:44,184 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-12 22:34:44,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 22:34:44,184 INFO L87 Difference]: Start difference. First operand 3940 states and 4030 transitions. Second operand 93 states. [2018-10-12 22:34:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:34:50,254 INFO L93 Difference]: Finished difference Result 4112 states and 4206 transitions. [2018-10-12 22:34:50,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-12 22:34:50,255 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 2454 [2018-10-12 22:34:50,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:34:50,260 INFO L225 Difference]: With dead ends: 4112 [2018-10-12 22:34:50,261 INFO L226 Difference]: Without dead ends: 4112 [2018-10-12 22:34:50,264 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-12 22:34:50,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4112 states. [2018-10-12 22:34:50,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4112 to 4027. [2018-10-12 22:34:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4027 states. [2018-10-12 22:34:50,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4027 states to 4027 states and 4119 transitions. [2018-10-12 22:34:50,293 INFO L78 Accepts]: Start accepts. Automaton has 4027 states and 4119 transitions. Word has length 2454 [2018-10-12 22:34:50,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:34:50,295 INFO L481 AbstractCegarLoop]: Abstraction has 4027 states and 4119 transitions. [2018-10-12 22:34:50,295 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-12 22:34:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 4027 states and 4119 transitions. [2018-10-12 22:34:50,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2509 [2018-10-12 22:34:50,343 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:34:50,344 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:34:50,345 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:34:50,345 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:34:50,345 INFO L82 PathProgramCache]: Analyzing trace with hash 1710942742, now seen corresponding path program 46 times [2018-10-12 22:34:50,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:34:50,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:34:57,078 INFO L134 CoverageAnalysis]: Checked inductivity of 55936 backedges. 0 proven. 55936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:34:57,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:34:57,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-12 22:34:57,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-12 22:34:57,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-12 22:34:57,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 22:34:57,080 INFO L87 Difference]: Start difference. First operand 4027 states and 4119 transitions. Second operand 95 states. [2018-10-12 22:35:03,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:03,566 INFO L93 Difference]: Finished difference Result 4199 states and 4295 transitions. [2018-10-12 22:35:03,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-12 22:35:03,567 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 2508 [2018-10-12 22:35:03,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:03,572 INFO L225 Difference]: With dead ends: 4199 [2018-10-12 22:35:03,572 INFO L226 Difference]: Without dead ends: 4199 [2018-10-12 22:35:03,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-12 22:35:03,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4199 states. [2018-10-12 22:35:03,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4199 to 4114. [2018-10-12 22:35:03,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4114 states. [2018-10-12 22:35:03,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4114 states to 4114 states and 4208 transitions. [2018-10-12 22:35:03,600 INFO L78 Accepts]: Start accepts. Automaton has 4114 states and 4208 transitions. Word has length 2508 [2018-10-12 22:35:03,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:03,601 INFO L481 AbstractCegarLoop]: Abstraction has 4114 states and 4208 transitions. [2018-10-12 22:35:03,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-12 22:35:03,602 INFO L276 IsEmpty]: Start isEmpty. Operand 4114 states and 4208 transitions. [2018-10-12 22:35:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2563 [2018-10-12 22:35:03,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:03,657 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:03,657 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:03,657 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:03,657 INFO L82 PathProgramCache]: Analyzing trace with hash -678353189, now seen corresponding path program 47 times [2018-10-12 22:35:03,658 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:03,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:11,108 INFO L134 CoverageAnalysis]: Checked inductivity of 58421 backedges. 0 proven. 58421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:35:11,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:11,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-12 22:35:11,111 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-12 22:35:11,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-12 22:35:11,112 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 22:35:11,112 INFO L87 Difference]: Start difference. First operand 4114 states and 4208 transitions. Second operand 97 states. [2018-10-12 22:35:17,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:17,839 INFO L93 Difference]: Finished difference Result 4286 states and 4384 transitions. [2018-10-12 22:35:17,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-12 22:35:17,840 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 2562 [2018-10-12 22:35:17,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:17,844 INFO L225 Difference]: With dead ends: 4286 [2018-10-12 22:35:17,844 INFO L226 Difference]: Without dead ends: 4286 [2018-10-12 22:35:17,846 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-12 22:35:17,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4286 states. [2018-10-12 22:35:17,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4286 to 4201. [2018-10-12 22:35:17,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4201 states. [2018-10-12 22:35:17,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4201 states to 4201 states and 4297 transitions. [2018-10-12 22:35:17,877 INFO L78 Accepts]: Start accepts. Automaton has 4201 states and 4297 transitions. Word has length 2562 [2018-10-12 22:35:17,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:17,878 INFO L481 AbstractCegarLoop]: Abstraction has 4201 states and 4297 transitions. [2018-10-12 22:35:17,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-12 22:35:17,878 INFO L276 IsEmpty]: Start isEmpty. Operand 4201 states and 4297 transitions. [2018-10-12 22:35:17,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2617 [2018-10-12 22:35:17,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:17,927 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:17,928 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:17,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 243793376, now seen corresponding path program 48 times [2018-10-12 22:35:17,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:18,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:24,952 INFO L134 CoverageAnalysis]: Checked inductivity of 60960 backedges. 0 proven. 60960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:35:24,952 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:24,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-12 22:35:24,954 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-12 22:35:24,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-12 22:35:24,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 22:35:24,955 INFO L87 Difference]: Start difference. First operand 4201 states and 4297 transitions. Second operand 99 states. [2018-10-12 22:35:31,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:31,850 INFO L93 Difference]: Finished difference Result 4373 states and 4473 transitions. [2018-10-12 22:35:31,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-12 22:35:31,850 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 2616 [2018-10-12 22:35:31,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:31,854 INFO L225 Difference]: With dead ends: 4373 [2018-10-12 22:35:31,854 INFO L226 Difference]: Without dead ends: 4373 [2018-10-12 22:35:31,857 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-12 22:35:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states. [2018-10-12 22:35:31,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4288. [2018-10-12 22:35:31,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4288 states. [2018-10-12 22:35:31,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4288 states to 4288 states and 4386 transitions. [2018-10-12 22:35:31,878 INFO L78 Accepts]: Start accepts. Automaton has 4288 states and 4386 transitions. Word has length 2616 [2018-10-12 22:35:31,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:31,880 INFO L481 AbstractCegarLoop]: Abstraction has 4288 states and 4386 transitions. [2018-10-12 22:35:31,880 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-12 22:35:31,880 INFO L276 IsEmpty]: Start isEmpty. Operand 4288 states and 4386 transitions. [2018-10-12 22:35:31,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2671 [2018-10-12 22:35:31,920 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:31,920 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:31,920 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:31,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:31,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1396522789, now seen corresponding path program 49 times [2018-10-12 22:35:31,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:32,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 63553 backedges. 0 proven. 63553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:35:40,663 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:40,664 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-12 22:35:40,665 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-12 22:35:40,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-12 22:35:40,666 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-12 22:35:40,666 INFO L87 Difference]: Start difference. First operand 4288 states and 4386 transitions. Second operand 101 states. [2018-10-12 22:35:48,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:35:48,246 INFO L93 Difference]: Finished difference Result 4460 states and 4562 transitions. [2018-10-12 22:35:48,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-12 22:35:48,247 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 2670 [2018-10-12 22:35:48,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:35:48,250 INFO L225 Difference]: With dead ends: 4460 [2018-10-12 22:35:48,250 INFO L226 Difference]: Without dead ends: 4460 [2018-10-12 22:35:48,253 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-12 22:35:48,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4460 states. [2018-10-12 22:35:48,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4460 to 4375. [2018-10-12 22:35:48,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4375 states. [2018-10-12 22:35:48,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4375 states to 4375 states and 4475 transitions. [2018-10-12 22:35:48,281 INFO L78 Accepts]: Start accepts. Automaton has 4375 states and 4475 transitions. Word has length 2670 [2018-10-12 22:35:48,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:35:48,283 INFO L481 AbstractCegarLoop]: Abstraction has 4375 states and 4475 transitions. [2018-10-12 22:35:48,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-12 22:35:48,283 INFO L276 IsEmpty]: Start isEmpty. Operand 4375 states and 4475 transitions. [2018-10-12 22:35:48,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2725 [2018-10-12 22:35:48,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:35:48,331 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:35:48,331 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:35:48,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:35:48,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1804778154, now seen corresponding path program 50 times [2018-10-12 22:35:48,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:35:48,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:35:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 66200 backedges. 0 proven. 66200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:35:55,893 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:35:55,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-12 22:35:55,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-12 22:35:55,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-12 22:35:55,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 22:35:55,896 INFO L87 Difference]: Start difference. First operand 4375 states and 4475 transitions. Second operand 103 states. [2018-10-12 22:36:03,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:03,827 INFO L93 Difference]: Finished difference Result 4547 states and 4651 transitions. [2018-10-12 22:36:03,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-12 22:36:03,828 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 2724 [2018-10-12 22:36:03,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:03,834 INFO L225 Difference]: With dead ends: 4547 [2018-10-12 22:36:03,834 INFO L226 Difference]: Without dead ends: 4547 [2018-10-12 22:36:03,838 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 22:36:03,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4547 states. [2018-10-12 22:36:03,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4547 to 4462. [2018-10-12 22:36:03,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4462 states. [2018-10-12 22:36:03,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4462 states to 4462 states and 4564 transitions. [2018-10-12 22:36:03,866 INFO L78 Accepts]: Start accepts. Automaton has 4462 states and 4564 transitions. Word has length 2724 [2018-10-12 22:36:03,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:03,868 INFO L481 AbstractCegarLoop]: Abstraction has 4462 states and 4564 transitions. [2018-10-12 22:36:03,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-12 22:36:03,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4462 states and 4564 transitions. [2018-10-12 22:36:03,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2779 [2018-10-12 22:36:03,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:03,949 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:03,949 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:03,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:03,950 INFO L82 PathProgramCache]: Analyzing trace with hash -806469521, now seen corresponding path program 51 times [2018-10-12 22:36:03,951 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:04,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:11,780 INFO L134 CoverageAnalysis]: Checked inductivity of 68901 backedges. 0 proven. 68901 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:36:11,780 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:11,780 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-12 22:36:11,781 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-12 22:36:11,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-12 22:36:11,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-12 22:36:11,782 INFO L87 Difference]: Start difference. First operand 4462 states and 4564 transitions. Second operand 105 states. [2018-10-12 22:36:20,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:20,280 INFO L93 Difference]: Finished difference Result 4634 states and 4740 transitions. [2018-10-12 22:36:20,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-12 22:36:20,281 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 2778 [2018-10-12 22:36:20,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:20,286 INFO L225 Difference]: With dead ends: 4634 [2018-10-12 22:36:20,286 INFO L226 Difference]: Without dead ends: 4634 [2018-10-12 22:36:20,290 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-12 22:36:20,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4634 states. [2018-10-12 22:36:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4634 to 4549. [2018-10-12 22:36:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4549 states. [2018-10-12 22:36:20,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4549 states to 4549 states and 4653 transitions. [2018-10-12 22:36:20,320 INFO L78 Accepts]: Start accepts. Automaton has 4549 states and 4653 transitions. Word has length 2778 [2018-10-12 22:36:20,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:20,321 INFO L481 AbstractCegarLoop]: Abstraction has 4549 states and 4653 transitions. [2018-10-12 22:36:20,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-12 22:36:20,322 INFO L276 IsEmpty]: Start isEmpty. Operand 4549 states and 4653 transitions. [2018-10-12 22:36:20,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2833 [2018-10-12 22:36:20,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:20,381 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:20,381 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:20,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:20,382 INFO L82 PathProgramCache]: Analyzing trace with hash 540647540, now seen corresponding path program 52 times [2018-10-12 22:36:20,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:29,804 INFO L134 CoverageAnalysis]: Checked inductivity of 71656 backedges. 0 proven. 71656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:36:29,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:29,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-12 22:36:29,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-12 22:36:29,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-12 22:36:29,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-12 22:36:29,806 INFO L87 Difference]: Start difference. First operand 4549 states and 4653 transitions. Second operand 107 states. [2018-10-12 22:36:37,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:37,930 INFO L93 Difference]: Finished difference Result 4721 states and 4829 transitions. [2018-10-12 22:36:37,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-12 22:36:37,930 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 2832 [2018-10-12 22:36:37,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:37,935 INFO L225 Difference]: With dead ends: 4721 [2018-10-12 22:36:37,935 INFO L226 Difference]: Without dead ends: 4721 [2018-10-12 22:36:37,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 10.0s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-12 22:36:37,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4721 states. [2018-10-12 22:36:37,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4721 to 4636. [2018-10-12 22:36:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4636 states. [2018-10-12 22:36:37,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4636 states to 4636 states and 4742 transitions. [2018-10-12 22:36:37,961 INFO L78 Accepts]: Start accepts. Automaton has 4636 states and 4742 transitions. Word has length 2832 [2018-10-12 22:36:37,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:37,962 INFO L481 AbstractCegarLoop]: Abstraction has 4636 states and 4742 transitions. [2018-10-12 22:36:37,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-12 22:36:37,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4636 states and 4742 transitions. [2018-10-12 22:36:38,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2887 [2018-10-12 22:36:38,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:38,014 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:38,015 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:38,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:38,015 INFO L82 PathProgramCache]: Analyzing trace with hash -656233799, now seen corresponding path program 53 times [2018-10-12 22:36:38,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:38,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:36:47,223 INFO L134 CoverageAnalysis]: Checked inductivity of 74465 backedges. 0 proven. 74465 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:36:47,224 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:36:47,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-12 22:36:47,225 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-12 22:36:47,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-12 22:36:47,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-12 22:36:47,226 INFO L87 Difference]: Start difference. First operand 4636 states and 4742 transitions. Second operand 109 states. [2018-10-12 22:36:56,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:36:56,441 INFO L93 Difference]: Finished difference Result 4808 states and 4918 transitions. [2018-10-12 22:36:56,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-12 22:36:56,442 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 2886 [2018-10-12 22:36:56,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:36:56,446 INFO L225 Difference]: With dead ends: 4808 [2018-10-12 22:36:56,446 INFO L226 Difference]: Without dead ends: 4808 [2018-10-12 22:36:56,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-12 22:36:56,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4808 states. [2018-10-12 22:36:56,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4808 to 4723. [2018-10-12 22:36:56,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4723 states. [2018-10-12 22:36:56,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4723 states to 4723 states and 4831 transitions. [2018-10-12 22:36:56,473 INFO L78 Accepts]: Start accepts. Automaton has 4723 states and 4831 transitions. Word has length 2886 [2018-10-12 22:36:56,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:36:56,474 INFO L481 AbstractCegarLoop]: Abstraction has 4723 states and 4831 transitions. [2018-10-12 22:36:56,474 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-12 22:36:56,474 INFO L276 IsEmpty]: Start isEmpty. Operand 4723 states and 4831 transitions. [2018-10-12 22:36:56,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2941 [2018-10-12 22:36:56,541 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:36:56,541 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:36:56,542 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:36:56,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:36:56,542 INFO L82 PathProgramCache]: Analyzing trace with hash 1205546814, now seen corresponding path program 54 times [2018-10-12 22:36:56,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:36:56,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 22:37:05,869 INFO L134 CoverageAnalysis]: Checked inductivity of 77328 backedges. 0 proven. 77328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 22:37:05,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 22:37:05,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-12 22:37:05,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-12 22:37:05,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-12 22:37:05,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-12 22:37:05,871 INFO L87 Difference]: Start difference. First operand 4723 states and 4831 transitions. Second operand 111 states. [2018-10-12 22:37:15,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 22:37:15,633 INFO L93 Difference]: Finished difference Result 4895 states and 5007 transitions. [2018-10-12 22:37:15,634 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-12 22:37:15,634 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 2940 [2018-10-12 22:37:15,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 22:37:15,638 INFO L225 Difference]: With dead ends: 4895 [2018-10-12 22:37:15,638 INFO L226 Difference]: Without dead ends: 4895 [2018-10-12 22:37:15,641 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-12 22:37:15,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4895 states. [2018-10-12 22:37:15,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4895 to 4810. [2018-10-12 22:37:15,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4810 states. [2018-10-12 22:37:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4810 states to 4810 states and 4920 transitions. [2018-10-12 22:37:15,669 INFO L78 Accepts]: Start accepts. Automaton has 4810 states and 4920 transitions. Word has length 2940 [2018-10-12 22:37:15,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 22:37:15,670 INFO L481 AbstractCegarLoop]: Abstraction has 4810 states and 4920 transitions. [2018-10-12 22:37:15,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-12 22:37:15,671 INFO L276 IsEmpty]: Start isEmpty. Operand 4810 states and 4920 transitions. [2018-10-12 22:37:15,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2995 [2018-10-12 22:37:15,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 22:37:15,754 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 22:37:15,754 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 22:37:15,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 22:37:15,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1046938109, now seen corresponding path program 55 times [2018-10-12 22:37:15,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 22:37:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat