java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:24:45,896 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:24:45,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:24:45,912 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:24:45,913 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:24:45,915 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:24:45,918 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:24:45,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:24:45,922 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:24:45,923 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:24:45,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:24:45,925 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:24:45,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:24:45,929 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:24:45,930 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:24:45,939 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:24:45,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:24:45,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:24:45,945 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:24:45,949 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:24:45,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:24:45,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:24:45,958 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:24:45,958 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:24:45,958 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:24:45,960 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:24:45,961 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:24:45,961 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:24:45,964 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:24:45,966 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:24:45,966 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:24:45,967 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:24:45,967 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:24:45,967 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:24:45,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:24:45,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:24:45,972 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-14 16:24:45,988 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:24:45,988 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:24:45,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:24:45,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:24:45,990 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:24:45,991 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:24:45,992 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:24:45,992 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:24:45,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:24:45,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:24:45,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:24:45,993 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:24:45,993 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:24:45,997 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:24:45,997 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:24:46,061 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:24:46,075 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:24:46,078 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:24:46,079 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:24:46,079 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:24:46,080 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_20.bpl [2018-10-14 16:24:46,080 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl' [2018-10-14 16:24:46,158 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:24:46,159 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:24:46,160 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:24:46,160 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:24:46,160 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:24:46,185 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,187 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,204 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,214 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,220 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,223 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/1) ... [2018-10-14 16:24:46,226 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:24:46,227 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:24:46,227 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:24:46,227 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:24:46,228 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (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-14 16:24:46,310 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:24:46,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:24:46,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:24:47,089 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:24:47,089 INFO L202 PluginConnector]: Adding new model ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:47 BoogieIcfgContainer [2018-10-14 16:24:47,089 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:24:47,091 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:24:47,091 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:24:47,095 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:24:47,095 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:24:46" (1/2) ... [2018-10-14 16:24:47,096 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e2e8547 and model type ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:24:47, skipping insertion in model container [2018-10-14 16:24:47,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:24:47" (2/2) ... [2018-10-14 16:24:47,101 INFO L112 eAbstractionObserver]: Analyzing ICFG ArraysOfVariableLength2_true-valid-memsafety.c_20.bpl [2018-10-14 16:24:47,113 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:24:47,122 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:24:47,143 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:24:47,173 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:24:47,174 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:24:47,174 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:24:47,174 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:24:47,174 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:24:47,174 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:24:47,174 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:24:47,175 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:24:47,175 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:24:47,195 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states. [2018-10-14 16:24:47,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-14 16:24:47,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:47,206 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] [2018-10-14 16:24:47,208 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:47,214 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:47,214 INFO L82 PathProgramCache]: Analyzing trace with hash 1733824129, now seen corresponding path program 1 times [2018-10-14 16:24:47,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:47,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:47,516 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-14 16:24:47,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:24:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-14 16:24:47,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-14 16:24:47,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-14 16:24:47,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-14 16:24:47,540 INFO L87 Difference]: Start difference. First operand 108 states. Second operand 6 states. [2018-10-14 16:24:47,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:47,838 INFO L93 Difference]: Finished difference Result 177 states and 180 transitions. [2018-10-14 16:24:47,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-14 16:24:47,840 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 41 [2018-10-14 16:24:47,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:47,855 INFO L225 Difference]: With dead ends: 177 [2018-10-14 16:24:47,856 INFO L226 Difference]: Without dead ends: 177 [2018-10-14 16:24:47,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:24:47,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-14 16:24:47,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 126. [2018-10-14 16:24:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-14 16:24:47,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 128 transitions. [2018-10-14 16:24:47,908 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 128 transitions. Word has length 41 [2018-10-14 16:24:47,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:47,909 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 128 transitions. [2018-10-14 16:24:47,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-14 16:24:47,910 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 128 transitions. [2018-10-14 16:24:47,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-14 16:24:47,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:47,914 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:24:47,914 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:47,915 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:47,915 INFO L82 PathProgramCache]: Analyzing trace with hash 1786245376, now seen corresponding path program 1 times [2018-10-14 16:24:47,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:47,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:49,602 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-14 16:24:49,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:49,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:24:49,605 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:24:49,605 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:24:49,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=297, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:24:49,606 INFO L87 Difference]: Start difference. First operand 126 states and 128 transitions. Second operand 19 states. [2018-10-14 16:24:52,987 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-14 16:24:53,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:53,164 INFO L93 Difference]: Finished difference Result 246 states and 252 transitions. [2018-10-14 16:24:53,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:24:53,165 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 95 [2018-10-14 16:24:53,166 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:53,168 INFO L225 Difference]: With dead ends: 246 [2018-10-14 16:24:53,169 INFO L226 Difference]: Without dead ends: 246 [2018-10-14 16:24:53,171 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 492 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=461, Invalid=1891, Unknown=0, NotChecked=0, Total=2352 [2018-10-14 16:24:53,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-14 16:24:53,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 130. [2018-10-14 16:24:53,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-14 16:24:53,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 133 transitions. [2018-10-14 16:24:53,186 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 133 transitions. Word has length 95 [2018-10-14 16:24:53,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:53,187 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 133 transitions. [2018-10-14 16:24:53,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:24:53,188 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 133 transitions. [2018-10-14 16:24:53,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-14 16:24:53,192 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:53,192 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:24:53,193 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:53,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:53,193 INFO L82 PathProgramCache]: Analyzing trace with hash -656087443, now seen corresponding path program 1 times [2018-10-14 16:24:53,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:53,466 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:24:53,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:53,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:24:53,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:24:53,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:24:53,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:24:53,469 INFO L87 Difference]: Start difference. First operand 130 states and 133 transitions. Second operand 10 states. [2018-10-14 16:24:53,969 WARN L179 SmtUtils]: Spent 185.00 ms on a formula simplification. DAG size of input: 14 DAG size of output: 13 [2018-10-14 16:24:54,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:54,384 INFO L93 Difference]: Finished difference Result 320 states and 327 transitions. [2018-10-14 16:24:54,385 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:24:54,385 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 116 [2018-10-14 16:24:54,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:54,390 INFO L225 Difference]: With dead ends: 320 [2018-10-14 16:24:54,390 INFO L226 Difference]: Without dead ends: 320 [2018-10-14 16:24:54,391 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=197, Invalid=505, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:24:54,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-14 16:24:54,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 218. [2018-10-14 16:24:54,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 16:24:54,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 223 transitions. [2018-10-14 16:24:54,408 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 223 transitions. Word has length 116 [2018-10-14 16:24:54,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:54,409 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 223 transitions. [2018-10-14 16:24:54,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:24:54,409 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 223 transitions. [2018-10-14 16:24:54,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-14 16:24:54,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:54,416 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:24:54,417 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:54,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:54,417 INFO L82 PathProgramCache]: Analyzing trace with hash -1275902322, now seen corresponding path program 2 times [2018-10-14 16:24:54,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:54,635 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 76 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-10-14 16:24:54,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:54,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-14 16:24:54,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:24:54,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:24:54,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:24:54,637 INFO L87 Difference]: Start difference. First operand 218 states and 223 transitions. Second operand 8 states. [2018-10-14 16:24:54,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:54,906 INFO L93 Difference]: Finished difference Result 269 states and 274 transitions. [2018-10-14 16:24:54,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-14 16:24:54,906 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 170 [2018-10-14 16:24:54,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:54,909 INFO L225 Difference]: With dead ends: 269 [2018-10-14 16:24:54,909 INFO L226 Difference]: Without dead ends: 269 [2018-10-14 16:24:54,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:24:54,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-14 16:24:54,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 218. [2018-10-14 16:24:54,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-14 16:24:54,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 222 transitions. [2018-10-14 16:24:54,922 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 222 transitions. Word has length 170 [2018-10-14 16:24:54,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:54,923 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 222 transitions. [2018-10-14 16:24:54,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:24:54,923 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 222 transitions. [2018-10-14 16:24:54,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-14 16:24:54,927 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:54,927 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, 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] [2018-10-14 16:24:54,927 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:54,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:54,928 INFO L82 PathProgramCache]: Analyzing trace with hash -61766911, now seen corresponding path program 3 times [2018-10-14 16:24:54,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:54,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:55,181 INFO L134 CoverageAnalysis]: Checked inductivity of 127 backedges. 92 proven. 30 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-10-14 16:24:55,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:55,182 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:24:55,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:24:55,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:24:55,183 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:24:55,183 INFO L87 Difference]: Start difference. First operand 218 states and 222 transitions. Second operand 10 states. [2018-10-14 16:24:55,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:24:55,640 INFO L93 Difference]: Finished difference Result 327 states and 334 transitions. [2018-10-14 16:24:55,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:24:55,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 191 [2018-10-14 16:24:55,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:24:55,643 INFO L225 Difference]: With dead ends: 327 [2018-10-14 16:24:55,643 INFO L226 Difference]: Without dead ends: 327 [2018-10-14 16:24:55,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=90, Invalid=290, Unknown=0, NotChecked=0, Total=380 [2018-10-14 16:24:55,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-14 16:24:55,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 227. [2018-10-14 16:24:55,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-14 16:24:55,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 231 transitions. [2018-10-14 16:24:55,654 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 231 transitions. Word has length 191 [2018-10-14 16:24:55,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:24:55,654 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 231 transitions. [2018-10-14 16:24:55,655 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:24:55,655 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 231 transitions. [2018-10-14 16:24:55,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-14 16:24:55,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:24:55,663 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:24:55,663 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:24:55,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:24:55,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1555615578, now seen corresponding path program 1 times [2018-10-14 16:24:55,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:24:55,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:24:56,884 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 128 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-10-14 16:24:56,884 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:24:56,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:24:56,885 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:24:56,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:24:56,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=445, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:24:56,888 INFO L87 Difference]: Start difference. First operand 227 states and 231 transitions. Second operand 23 states. [2018-10-14 16:25:00,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:00,703 INFO L93 Difference]: Finished difference Result 552 states and 565 transitions. [2018-10-14 16:25:00,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:25:00,705 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 205 [2018-10-14 16:25:00,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:00,710 INFO L225 Difference]: With dead ends: 552 [2018-10-14 16:25:00,710 INFO L226 Difference]: Without dead ends: 552 [2018-10-14 16:25:00,712 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 886 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=480, Invalid=3060, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:25:00,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-14 16:25:00,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 306. [2018-10-14 16:25:00,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-14 16:25:00,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 312 transitions. [2018-10-14 16:25:00,726 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 312 transitions. Word has length 205 [2018-10-14 16:25:00,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:00,727 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 312 transitions. [2018-10-14 16:25:00,727 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:25:00,727 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 312 transitions. [2018-10-14 16:25:00,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-14 16:25:00,730 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:00,731 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:00,731 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:00,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:00,731 INFO L82 PathProgramCache]: Analyzing trace with hash 293495891, now seen corresponding path program 2 times [2018-10-14 16:25:00,732 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:01,012 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 11 proven. 164 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-14 16:25:01,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:01,013 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:25:01,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:25:01,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:25:01,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:25:01,014 INFO L87 Difference]: Start difference. First operand 306 states and 312 transitions. Second operand 14 states. [2018-10-14 16:25:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:01,916 INFO L93 Difference]: Finished difference Result 430 states and 439 transitions. [2018-10-14 16:25:01,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:25:01,917 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 226 [2018-10-14 16:25:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:01,920 INFO L225 Difference]: With dead ends: 430 [2018-10-14 16:25:01,920 INFO L226 Difference]: Without dead ends: 430 [2018-10-14 16:25:01,921 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 489 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=434, Invalid=1458, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:25:01,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-14 16:25:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 328. [2018-10-14 16:25:01,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 16:25:01,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 335 transitions. [2018-10-14 16:25:01,930 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 335 transitions. Word has length 226 [2018-10-14 16:25:01,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:01,931 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 335 transitions. [2018-10-14 16:25:01,931 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:25:01,931 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 335 transitions. [2018-10-14 16:25:01,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-14 16:25:01,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:01,935 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:01,935 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:01,935 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:01,935 INFO L82 PathProgramCache]: Analyzing trace with hash -337896517, now seen corresponding path program 3 times [2018-10-14 16:25:01,936 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:01,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:02,854 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 160 proven. 94 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-14 16:25:02,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:02,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:25:02,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:25:02,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:25:02,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:25:02,856 INFO L87 Difference]: Start difference. First operand 328 states and 335 transitions. Second operand 10 states. [2018-10-14 16:25:03,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:03,175 INFO L93 Difference]: Finished difference Result 344 states and 349 transitions. [2018-10-14 16:25:03,175 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-14 16:25:03,175 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 259 [2018-10-14 16:25:03,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:03,178 INFO L225 Difference]: With dead ends: 344 [2018-10-14 16:25:03,179 INFO L226 Difference]: Without dead ends: 344 [2018-10-14 16:25:03,180 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=69, Invalid=237, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:25:03,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2018-10-14 16:25:03,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 328. [2018-10-14 16:25:03,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 328 states. [2018-10-14 16:25:03,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 333 transitions. [2018-10-14 16:25:03,186 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 333 transitions. Word has length 259 [2018-10-14 16:25:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:03,187 INFO L481 AbstractCegarLoop]: Abstraction has 328 states and 333 transitions. [2018-10-14 16:25:03,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:25:03,187 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 333 transitions. [2018-10-14 16:25:03,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-14 16:25:03,190 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:03,191 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:03,191 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:03,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:03,191 INFO L82 PathProgramCache]: Analyzing trace with hash 791780340, now seen corresponding path program 4 times [2018-10-14 16:25:03,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:03,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:03,542 INFO L134 CoverageAnalysis]: Checked inductivity of 309 backedges. 185 proven. 118 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-10-14 16:25:03,542 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:03,542 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:25:03,543 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:25:03,543 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:25:03,543 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:25:03,544 INFO L87 Difference]: Start difference. First operand 328 states and 333 transitions. Second operand 12 states. [2018-10-14 16:25:04,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:04,027 INFO L93 Difference]: Finished difference Result 346 states and 350 transitions. [2018-10-14 16:25:04,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-14 16:25:04,028 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 280 [2018-10-14 16:25:04,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:04,031 INFO L225 Difference]: With dead ends: 346 [2018-10-14 16:25:04,031 INFO L226 Difference]: Without dead ends: 346 [2018-10-14 16:25:04,032 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=119, Invalid=433, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:25:04,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-14 16:25:04,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2018-10-14 16:25:04,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 346 states. [2018-10-14 16:25:04,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 350 transitions. [2018-10-14 16:25:04,040 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 350 transitions. Word has length 280 [2018-10-14 16:25:04,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:04,040 INFO L481 AbstractCegarLoop]: Abstraction has 346 states and 350 transitions. [2018-10-14 16:25:04,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:25:04,041 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 350 transitions. [2018-10-14 16:25:04,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-14 16:25:04,043 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:04,043 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:04,044 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:04,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:04,044 INFO L82 PathProgramCache]: Analyzing trace with hash -1810716325, now seen corresponding path program 5 times [2018-10-14 16:25:04,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:04,429 INFO L134 CoverageAnalysis]: Checked inductivity of 379 backedges. 191 proven. 159 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-14 16:25:04,430 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:04,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:25:04,431 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:25:04,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:25:04,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:25:04,431 INFO L87 Difference]: Start difference. First operand 346 states and 350 transitions. Second operand 12 states. [2018-10-14 16:25:04,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:04,961 INFO L93 Difference]: Finished difference Result 362 states and 366 transitions. [2018-10-14 16:25:04,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-14 16:25:04,962 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 301 [2018-10-14 16:25:04,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:04,965 INFO L225 Difference]: With dead ends: 362 [2018-10-14 16:25:04,966 INFO L226 Difference]: Without dead ends: 362 [2018-10-14 16:25:04,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=112, Invalid=394, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:25:04,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 362 states. [2018-10-14 16:25:04,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 362 to 347. [2018-10-14 16:25:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-14 16:25:04,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 351 transitions. [2018-10-14 16:25:04,973 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 351 transitions. Word has length 301 [2018-10-14 16:25:04,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:04,974 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 351 transitions. [2018-10-14 16:25:04,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:25:04,974 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 351 transitions. [2018-10-14 16:25:04,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2018-10-14 16:25:04,976 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:04,976 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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, 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] [2018-10-14 16:25:04,976 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:04,977 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:04,977 INFO L82 PathProgramCache]: Analyzing trace with hash -140324812, now seen corresponding path program 6 times [2018-10-14 16:25:04,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:05,316 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 191 proven. 176 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2018-10-14 16:25:05,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:05,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:25:05,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:25:05,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:25:05,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:25:05,317 INFO L87 Difference]: Start difference. First operand 347 states and 351 transitions. Second operand 14 states. [2018-10-14 16:25:06,038 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2018-10-14 16:25:06,406 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:25:06,753 WARN L179 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-14 16:25:07,200 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-14 16:25:07,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:07,401 INFO L93 Difference]: Finished difference Result 364 states and 368 transitions. [2018-10-14 16:25:07,402 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:25:07,402 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 315 [2018-10-14 16:25:07,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:07,405 INFO L225 Difference]: With dead ends: 364 [2018-10-14 16:25:07,405 INFO L226 Difference]: Without dead ends: 364 [2018-10-14 16:25:07,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=181, Invalid=689, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:25:07,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2018-10-14 16:25:07,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 361. [2018-10-14 16:25:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-14 16:25:07,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 365 transitions. [2018-10-14 16:25:07,412 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 365 transitions. Word has length 315 [2018-10-14 16:25:07,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:07,413 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 365 transitions. [2018-10-14 16:25:07,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:25:07,413 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 365 transitions. [2018-10-14 16:25:07,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-14 16:25:07,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:07,415 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 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, 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] [2018-10-14 16:25:07,416 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:07,416 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:07,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1678407859, now seen corresponding path program 7 times [2018-10-14 16:25:07,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:09,062 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 121 proven. 286 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:25:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:25:09,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:25:09,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:25:09,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:25:09,064 INFO L87 Difference]: Start difference. First operand 361 states and 365 transitions. Second operand 26 states. [2018-10-14 16:25:13,566 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-14 16:25:13,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:13,574 INFO L93 Difference]: Finished difference Result 459 states and 465 transitions. [2018-10-14 16:25:13,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:25:13,575 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 329 [2018-10-14 16:25:13,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:13,579 INFO L225 Difference]: With dead ends: 459 [2018-10-14 16:25:13,579 INFO L226 Difference]: Without dead ends: 459 [2018-10-14 16:25:13,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 865 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=849, Invalid=3441, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:25:13,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-14 16:25:13,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 364. [2018-10-14 16:25:13,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 364 states. [2018-10-14 16:25:13,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 364 states to 364 states and 368 transitions. [2018-10-14 16:25:13,588 INFO L78 Accepts]: Start accepts. Automaton has 364 states and 368 transitions. Word has length 329 [2018-10-14 16:25:13,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:13,589 INFO L481 AbstractCegarLoop]: Abstraction has 364 states and 368 transitions. [2018-10-14 16:25:13,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:25:13,589 INFO L276 IsEmpty]: Start isEmpty. Operand 364 states and 368 transitions. [2018-10-14 16:25:13,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2018-10-14 16:25:13,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:13,591 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:13,591 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:13,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:13,592 INFO L82 PathProgramCache]: Analyzing trace with hash 958018112, now seen corresponding path program 8 times [2018-10-14 16:25:13,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:13,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:14,180 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:14,427 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:14,680 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:14,976 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:15,261 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:15,642 WARN L179 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-14 16:25:16,060 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 12 DAG size of output: 10 [2018-10-14 16:25:17,187 INFO L134 CoverageAnalysis]: Checked inductivity of 518 backedges. 121 proven. 377 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2018-10-14 16:25:17,187 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:17,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-14 16:25:17,188 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-14 16:25:17,188 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-14 16:25:17,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=724, Unknown=0, NotChecked=0, Total=812 [2018-10-14 16:25:17,189 INFO L87 Difference]: Start difference. First operand 364 states and 368 transitions. Second operand 29 states. [2018-10-14 16:25:23,925 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 44 [2018-10-14 16:25:23,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:23,927 INFO L93 Difference]: Finished difference Result 546 states and 554 transitions. [2018-10-14 16:25:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:25:23,927 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 350 [2018-10-14 16:25:23,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:23,929 INFO L225 Difference]: With dead ends: 546 [2018-10-14 16:25:23,930 INFO L226 Difference]: Without dead ends: 546 [2018-10-14 16:25:23,932 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1333 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=1139, Invalid=4867, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:25:23,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2018-10-14 16:25:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 385. [2018-10-14 16:25:23,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 385 states. [2018-10-14 16:25:23,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 390 transitions. [2018-10-14 16:25:23,939 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 390 transitions. Word has length 350 [2018-10-14 16:25:23,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:23,940 INFO L481 AbstractCegarLoop]: Abstraction has 385 states and 390 transitions. [2018-10-14 16:25:23,940 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-14 16:25:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 390 transitions. [2018-10-14 16:25:23,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2018-10-14 16:25:23,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:23,943 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:25:23,943 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:23,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:23,943 INFO L82 PathProgramCache]: Analyzing trace with hash 2035543341, now seen corresponding path program 9 times [2018-10-14 16:25:23,944 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:23,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:25,392 INFO L134 CoverageAnalysis]: Checked inductivity of 630 backedges. 43 proven. 546 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2018-10-14 16:25:25,392 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:25,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:25:25,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:25:25,394 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:25:25,394 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:25:25,394 INFO L87 Difference]: Start difference. First operand 385 states and 390 transitions. Second operand 18 states. [2018-10-14 16:25:26,506 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:25:27,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:27,163 INFO L93 Difference]: Finished difference Result 596 states and 604 transitions. [2018-10-14 16:25:27,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:25:27,168 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 371 [2018-10-14 16:25:27,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:27,171 INFO L225 Difference]: With dead ends: 596 [2018-10-14 16:25:27,171 INFO L226 Difference]: Without dead ends: 596 [2018-10-14 16:25:27,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1034 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=733, Invalid=2807, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:25:27,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2018-10-14 16:25:27,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 530. [2018-10-14 16:25:27,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-14 16:25:27,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 537 transitions. [2018-10-14 16:25:27,181 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 537 transitions. Word has length 371 [2018-10-14 16:25:27,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:27,182 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 537 transitions. [2018-10-14 16:25:27,182 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:25:27,182 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 537 transitions. [2018-10-14 16:25:27,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 496 [2018-10-14 16:25:27,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:27,185 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 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] [2018-10-14 16:25:27,186 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:27,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:27,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1529603808, now seen corresponding path program 10 times [2018-10-14 16:25:27,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:27,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 758 proven. 326 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2018-10-14 16:25:27,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:27,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:25:27,734 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:25:27,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:25:27,735 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:25:27,735 INFO L87 Difference]: Start difference. First operand 530 states and 537 transitions. Second operand 16 states. [2018-10-14 16:25:28,688 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2018-10-14 16:25:28,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:28,804 INFO L93 Difference]: Finished difference Result 530 states and 535 transitions. [2018-10-14 16:25:28,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:25:28,804 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 495 [2018-10-14 16:25:28,805 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:28,809 INFO L225 Difference]: With dead ends: 530 [2018-10-14 16:25:28,809 INFO L226 Difference]: Without dead ends: 530 [2018-10-14 16:25:28,813 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=228, Invalid=894, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:25:28,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-14 16:25:28,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 530. [2018-10-14 16:25:28,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-14 16:25:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 535 transitions. [2018-10-14 16:25:28,821 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 535 transitions. Word has length 495 [2018-10-14 16:25:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:28,822 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 535 transitions. [2018-10-14 16:25:28,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:25:28,822 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 535 transitions. [2018-10-14 16:25:28,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-14 16:25:28,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:28,825 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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, 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] [2018-10-14 16:25:28,826 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:28,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:28,826 INFO L82 PathProgramCache]: Analyzing trace with hash -768765037, now seen corresponding path program 11 times [2018-10-14 16:25:28,827 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:29,370 INFO L134 CoverageAnalysis]: Checked inductivity of 1392 backedges. 895 proven. 80 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2018-10-14 16:25:29,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:29,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-14 16:25:29,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-14 16:25:29,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-14 16:25:29,372 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=176, Unknown=0, NotChecked=0, Total=210 [2018-10-14 16:25:29,372 INFO L87 Difference]: Start difference. First operand 530 states and 535 transitions. Second operand 15 states. [2018-10-14 16:25:30,662 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-14 16:25:31,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:31,071 INFO L93 Difference]: Finished difference Result 547 states and 552 transitions. [2018-10-14 16:25:31,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-14 16:25:31,072 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 516 [2018-10-14 16:25:31,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:31,076 INFO L225 Difference]: With dead ends: 547 [2018-10-14 16:25:31,076 INFO L226 Difference]: Without dead ends: 547 [2018-10-14 16:25:31,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 346 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=324, Invalid=1398, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:25:31,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 547 states. [2018-10-14 16:25:31,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 547 to 544. [2018-10-14 16:25:31,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-14 16:25:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 549 transitions. [2018-10-14 16:25:31,085 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 549 transitions. Word has length 516 [2018-10-14 16:25:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:31,086 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 549 transitions. [2018-10-14 16:25:31,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-14 16:25:31,086 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 549 transitions. [2018-10-14 16:25:31,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 531 [2018-10-14 16:25:31,090 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:31,090 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-14 16:25:31,091 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:31,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:31,091 INFO L82 PathProgramCache]: Analyzing trace with hash -84541140, now seen corresponding path program 12 times [2018-10-14 16:25:31,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:31,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:31,706 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:31,951 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:32,215 WARN L179 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:32,492 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:33,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1466 backedges. 553 proven. 811 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2018-10-14 16:25:33,918 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:33,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-14 16:25:33,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-14 16:25:33,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-14 16:25:33,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=949, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:25:33,920 INFO L87 Difference]: Start difference. First operand 544 states and 549 transitions. Second operand 33 states. [2018-10-14 16:25:39,432 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 38 [2018-10-14 16:25:41,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:41,166 INFO L93 Difference]: Finished difference Result 754 states and 763 transitions. [2018-10-14 16:25:41,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-14 16:25:41,166 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 530 [2018-10-14 16:25:41,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:41,170 INFO L225 Difference]: With dead ends: 754 [2018-10-14 16:25:41,170 INFO L226 Difference]: Without dead ends: 754 [2018-10-14 16:25:41,173 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1796 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=1371, Invalid=6285, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:25:41,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2018-10-14 16:25:41,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 565. [2018-10-14 16:25:41,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 565 states. [2018-10-14 16:25:41,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 571 transitions. [2018-10-14 16:25:41,182 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 571 transitions. Word has length 530 [2018-10-14 16:25:41,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:41,183 INFO L481 AbstractCegarLoop]: Abstraction has 565 states and 571 transitions. [2018-10-14 16:25:41,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-14 16:25:41,184 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 571 transitions. [2018-10-14 16:25:41,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 552 [2018-10-14 16:25:41,187 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:41,187 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2018-10-14 16:25:41,188 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:41,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:41,188 INFO L82 PathProgramCache]: Analyzing trace with hash -1647515199, now seen corresponding path program 13 times [2018-10-14 16:25:41,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:41,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:42,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1663 backedges. 99 proven. 1412 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2018-10-14 16:25:42,152 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:42,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:25:42,153 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:25:42,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:25:42,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=394, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:25:42,154 INFO L87 Difference]: Start difference. First operand 565 states and 571 transitions. Second operand 22 states. [2018-10-14 16:25:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:44,448 INFO L93 Difference]: Finished difference Result 825 states and 834 transitions. [2018-10-14 16:25:44,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-14 16:25:44,448 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 551 [2018-10-14 16:25:44,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:44,453 INFO L225 Difference]: With dead ends: 825 [2018-10-14 16:25:44,453 INFO L226 Difference]: Without dead ends: 825 [2018-10-14 16:25:44,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2157 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1251, Invalid=5391, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:25:44,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 825 states. [2018-10-14 16:25:44,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 825 to 745. [2018-10-14 16:25:44,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 745 states. [2018-10-14 16:25:44,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 745 states to 745 states and 753 transitions. [2018-10-14 16:25:44,466 INFO L78 Accepts]: Start accepts. Automaton has 745 states and 753 transitions. Word has length 551 [2018-10-14 16:25:44,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:44,467 INFO L481 AbstractCegarLoop]: Abstraction has 745 states and 753 transitions. [2018-10-14 16:25:44,467 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:25:44,467 INFO L276 IsEmpty]: Start isEmpty. Operand 745 states and 753 transitions. [2018-10-14 16:25:44,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 711 [2018-10-14 16:25:44,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:44,472 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-14 16:25:44,473 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:44,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:44,473 INFO L82 PathProgramCache]: Analyzing trace with hash -1096065984, now seen corresponding path program 14 times [2018-10-14 16:25:44,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:44,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1592 proven. 992 refuted. 0 times theorem prover too weak. 360 trivial. 0 not checked. [2018-10-14 16:25:45,461 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:45,461 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:25:45,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:25:45,462 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:25:45,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=401, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:25:45,463 INFO L87 Difference]: Start difference. First operand 745 states and 753 transitions. Second operand 22 states. [2018-10-14 16:25:46,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:46,840 INFO L93 Difference]: Finished difference Result 762 states and 770 transitions. [2018-10-14 16:25:46,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-14 16:25:46,841 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 710 [2018-10-14 16:25:46,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:46,845 INFO L225 Difference]: With dead ends: 762 [2018-10-14 16:25:46,846 INFO L226 Difference]: Without dead ends: 762 [2018-10-14 16:25:46,847 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=473, Invalid=1977, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:25:46,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 762 states. [2018-10-14 16:25:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 762 to 759. [2018-10-14 16:25:46,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 759 states. [2018-10-14 16:25:46,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 759 states to 759 states and 767 transitions. [2018-10-14 16:25:46,856 INFO L78 Accepts]: Start accepts. Automaton has 759 states and 767 transitions. Word has length 710 [2018-10-14 16:25:46,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:46,857 INFO L481 AbstractCegarLoop]: Abstraction has 759 states and 767 transitions. [2018-10-14 16:25:46,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:25:46,857 INFO L276 IsEmpty]: Start isEmpty. Operand 759 states and 767 transitions. [2018-10-14 16:25:46,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 725 [2018-10-14 16:25:46,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:46,863 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-14 16:25:46,863 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:46,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:46,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1918285255, now seen corresponding path program 15 times [2018-10-14 16:25:46,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:47,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 1867 proven. 93 refuted. 0 times theorem prover too weak. 1115 trivial. 0 not checked. [2018-10-14 16:25:47,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:47,575 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-14 16:25:47,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-14 16:25:47,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-14 16:25:47,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2018-10-14 16:25:47,576 INFO L87 Difference]: Start difference. First operand 759 states and 767 transitions. Second operand 19 states. [2018-10-14 16:25:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:25:50,542 INFO L93 Difference]: Finished difference Result 972 states and 981 transitions. [2018-10-14 16:25:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 16:25:50,542 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 724 [2018-10-14 16:25:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:25:50,547 INFO L225 Difference]: With dead ends: 972 [2018-10-14 16:25:50,548 INFO L226 Difference]: Without dead ends: 918 [2018-10-14 16:25:50,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3509 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=1659, Invalid=8043, Unknown=0, NotChecked=0, Total=9702 [2018-10-14 16:25:50,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 918 states. [2018-10-14 16:25:50,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 918 to 830. [2018-10-14 16:25:50,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 830 states. [2018-10-14 16:25:50,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 838 transitions. [2018-10-14 16:25:50,562 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 838 transitions. Word has length 724 [2018-10-14 16:25:50,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:25:50,563 INFO L481 AbstractCegarLoop]: Abstraction has 830 states and 838 transitions. [2018-10-14 16:25:50,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-14 16:25:50,563 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 838 transitions. [2018-10-14 16:25:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 746 [2018-10-14 16:25:50,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:25:50,569 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-14 16:25:50,569 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:25:50,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:25:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1746512612, now seen corresponding path program 16 times [2018-10-14 16:25:50,570 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:25:50,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:25:51,239 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:51,501 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:25:51,768 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:52,051 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7 [2018-10-14 16:25:54,117 INFO L134 CoverageAnalysis]: Checked inductivity of 3357 backedges. 1582 proven. 1484 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2018-10-14 16:25:54,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:25:54,118 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-14 16:25:54,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-14 16:25:54,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-14 16:25:54,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1204, Unknown=0, NotChecked=0, Total=1332 [2018-10-14 16:25:54,120 INFO L87 Difference]: Start difference. First operand 830 states and 838 transitions. Second operand 37 states. [2018-10-14 16:25:59,766 WARN L179 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-10-14 16:25:59,955 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 46 [2018-10-14 16:26:01,691 WARN L179 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-14 16:26:02,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:02,415 INFO L93 Difference]: Finished difference Result 1068 states and 1080 transitions. [2018-10-14 16:26:02,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-14 16:26:02,415 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 745 [2018-10-14 16:26:02,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:02,420 INFO L225 Difference]: With dead ends: 1068 [2018-10-14 16:26:02,420 INFO L226 Difference]: Without dead ends: 1068 [2018-10-14 16:26:02,421 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2319 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=1629, Invalid=7877, Unknown=0, NotChecked=0, Total=9506 [2018-10-14 16:26:02,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1068 states. [2018-10-14 16:26:02,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1068 to 851. [2018-10-14 16:26:02,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2018-10-14 16:26:02,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 860 transitions. [2018-10-14 16:26:02,432 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 860 transitions. Word has length 745 [2018-10-14 16:26:02,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:02,432 INFO L481 AbstractCegarLoop]: Abstraction has 851 states and 860 transitions. [2018-10-14 16:26:02,432 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-14 16:26:02,433 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 860 transitions. [2018-10-14 16:26:02,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 767 [2018-10-14 16:26:02,438 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:02,439 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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] [2018-10-14 16:26:02,439 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:02,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:02,440 INFO L82 PathProgramCache]: Analyzing trace with hash -272798767, now seen corresponding path program 17 times [2018-10-14 16:26:02,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:02,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:03,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 179 proven. 3111 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2018-10-14 16:26:03,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:03,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:26:03,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:26:03,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:26:03,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:26:03,459 INFO L87 Difference]: Start difference. First operand 851 states and 860 transitions. Second operand 26 states. [2018-10-14 16:26:06,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:06,604 INFO L93 Difference]: Finished difference Result 1160 states and 1172 transitions. [2018-10-14 16:26:06,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-14 16:26:06,607 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 766 [2018-10-14 16:26:06,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:06,611 INFO L225 Difference]: With dead ends: 1160 [2018-10-14 16:26:06,611 INFO L226 Difference]: Without dead ends: 1160 [2018-10-14 16:26:06,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3966 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=1991, Invalid=9351, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:26:06,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2018-10-14 16:26:06,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1066. [2018-10-14 16:26:06,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-14 16:26:06,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1077 transitions. [2018-10-14 16:26:06,624 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1077 transitions. Word has length 766 [2018-10-14 16:26:06,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:06,624 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1077 transitions. [2018-10-14 16:26:06,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:26:06,625 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1077 transitions. [2018-10-14 16:26:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 961 [2018-10-14 16:26:06,633 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:06,633 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-14 16:26:06,634 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:06,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:06,634 INFO L82 PathProgramCache]: Analyzing trace with hash 294351382, now seen corresponding path program 18 times [2018-10-14 16:26:06,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:07,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6069 backedges. 4057 proven. 1324 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2018-10-14 16:26:07,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:07,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:26:07,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:26:07,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:26:07,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:26:07,906 INFO L87 Difference]: Start difference. First operand 1066 states and 1077 transitions. Second operand 24 states. [2018-10-14 16:26:09,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:09,572 INFO L93 Difference]: Finished difference Result 1066 states and 1075 transitions. [2018-10-14 16:26:09,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:26:09,573 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 960 [2018-10-14 16:26:09,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:09,578 INFO L225 Difference]: With dead ends: 1066 [2018-10-14 16:26:09,578 INFO L226 Difference]: Without dead ends: 1066 [2018-10-14 16:26:09,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 554 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=560, Invalid=2302, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:26:09,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1066 states. [2018-10-14 16:26:09,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1066 to 1066. [2018-10-14 16:26:09,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1066 states. [2018-10-14 16:26:09,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1066 states to 1066 states and 1075 transitions. [2018-10-14 16:26:09,589 INFO L78 Accepts]: Start accepts. Automaton has 1066 states and 1075 transitions. Word has length 960 [2018-10-14 16:26:09,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:09,590 INFO L481 AbstractCegarLoop]: Abstraction has 1066 states and 1075 transitions. [2018-10-14 16:26:09,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:26:09,590 INFO L276 IsEmpty]: Start isEmpty. Operand 1066 states and 1075 transitions. [2018-10-14 16:26:09,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 982 [2018-10-14 16:26:09,598 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:09,599 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-14 16:26:09,599 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:09,599 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:09,600 INFO L82 PathProgramCache]: Analyzing trace with hash -2073225279, now seen corresponding path program 19 times [2018-10-14 16:26:09,600 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:11,137 INFO L134 CoverageAnalysis]: Checked inductivity of 6478 backedges. 3704 proven. 234 refuted. 0 times theorem prover too weak. 2540 trivial. 0 not checked. [2018-10-14 16:26:11,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:11,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-14 16:26:11,138 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-14 16:26:11,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-14 16:26:11,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:26:11,138 INFO L87 Difference]: Start difference. First operand 1066 states and 1075 transitions. Second operand 23 states. [2018-10-14 16:26:13,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:13,512 INFO L93 Difference]: Finished difference Result 1083 states and 1092 transitions. [2018-10-14 16:26:13,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:26:13,514 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 981 [2018-10-14 16:26:13,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:13,519 INFO L225 Difference]: With dead ends: 1083 [2018-10-14 16:26:13,519 INFO L226 Difference]: Without dead ends: 1083 [2018-10-14 16:26:13,519 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1082 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=812, Invalid=3744, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:26:13,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1083 states. [2018-10-14 16:26:13,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1083 to 1080. [2018-10-14 16:26:13,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1080 states. [2018-10-14 16:26:13,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1080 states to 1080 states and 1089 transitions. [2018-10-14 16:26:13,530 INFO L78 Accepts]: Start accepts. Automaton has 1080 states and 1089 transitions. Word has length 981 [2018-10-14 16:26:13,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:13,531 INFO L481 AbstractCegarLoop]: Abstraction has 1080 states and 1089 transitions. [2018-10-14 16:26:13,531 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-14 16:26:13,531 INFO L276 IsEmpty]: Start isEmpty. Operand 1080 states and 1089 transitions. [2018-10-14 16:26:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 996 [2018-10-14 16:26:13,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:13,540 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-14 16:26:13,541 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:13,541 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:13,541 INFO L82 PathProgramCache]: Analyzing trace with hash 1915696538, now seen corresponding path program 20 times [2018-10-14 16:26:13,542 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:13,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:14,320 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:26:17,463 INFO L134 CoverageAnalysis]: Checked inductivity of 6680 backedges. 3599 proven. 2459 refuted. 0 times theorem prover too weak. 622 trivial. 0 not checked. [2018-10-14 16:26:17,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:17,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:26:17,464 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:26:17,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:26:17,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1632, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:26:17,465 INFO L87 Difference]: Start difference. First operand 1080 states and 1089 transitions. Second operand 43 states. [2018-10-14 16:26:22,357 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:26:22,876 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-14 16:26:23,193 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-14 16:26:23,490 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-14 16:26:23,672 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:26:23,822 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:26:24,001 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:26:24,202 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:26:24,377 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:26:24,527 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:26:24,709 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:26:24,917 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:26:25,100 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-14 16:26:25,283 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-14 16:26:25,489 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-14 16:26:25,693 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-14 16:26:25,859 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-14 16:26:27,593 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-14 16:26:28,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:28,088 INFO L93 Difference]: Finished difference Result 1346 states and 1359 transitions. [2018-10-14 16:26:28,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:26:28,089 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 995 [2018-10-14 16:26:28,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:28,093 INFO L225 Difference]: With dead ends: 1346 [2018-10-14 16:26:28,093 INFO L226 Difference]: Without dead ends: 1346 [2018-10-14 16:26:28,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3086 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=2278, Invalid=10378, Unknown=0, NotChecked=0, Total=12656 [2018-10-14 16:26:28,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1346 states. [2018-10-14 16:26:28,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1346 to 1101. [2018-10-14 16:26:28,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1101 states. [2018-10-14 16:26:28,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1101 states to 1101 states and 1111 transitions. [2018-10-14 16:26:28,106 INFO L78 Accepts]: Start accepts. Automaton has 1101 states and 1111 transitions. Word has length 995 [2018-10-14 16:26:28,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:28,107 INFO L481 AbstractCegarLoop]: Abstraction has 1101 states and 1111 transitions. [2018-10-14 16:26:28,107 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:26:28,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1101 states and 1111 transitions. [2018-10-14 16:26:28,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1017 [2018-10-14 16:26:28,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:28,117 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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] [2018-10-14 16:26:28,117 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:28,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:28,118 INFO L82 PathProgramCache]: Analyzing trace with hash 194143763, now seen corresponding path program 21 times [2018-10-14 16:26:28,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:28,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:29,936 INFO L134 CoverageAnalysis]: Checked inductivity of 7110 backedges. 283 proven. 6097 refuted. 0 times theorem prover too weak. 730 trivial. 0 not checked. [2018-10-14 16:26:29,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:29,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:26:29,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:26:29,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:26:29,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=750, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:26:29,938 INFO L87 Difference]: Start difference. First operand 1101 states and 1111 transitions. Second operand 30 states. [2018-10-14 16:26:34,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:34,056 INFO L93 Difference]: Finished difference Result 1459 states and 1472 transitions. [2018-10-14 16:26:34,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-14 16:26:34,056 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 1016 [2018-10-14 16:26:34,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:34,063 INFO L225 Difference]: With dead ends: 1459 [2018-10-14 16:26:34,063 INFO L226 Difference]: Without dead ends: 1459 [2018-10-14 16:26:34,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6691 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=3009, Invalid=15081, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 16:26:34,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1459 states. [2018-10-14 16:26:34,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1459 to 1351. [2018-10-14 16:26:34,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2018-10-14 16:26:34,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1363 transitions. [2018-10-14 16:26:34,081 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1363 transitions. Word has length 1016 [2018-10-14 16:26:34,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:34,082 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1363 transitions. [2018-10-14 16:26:34,082 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:26:34,082 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1363 transitions. [2018-10-14 16:26:34,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1246 [2018-10-14 16:26:34,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:34,096 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-14 16:26:34,096 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:34,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:34,096 INFO L82 PathProgramCache]: Analyzing trace with hash -213230948, now seen corresponding path program 22 times [2018-10-14 16:26:34,097 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:36,189 INFO L134 CoverageAnalysis]: Checked inductivity of 11185 backedges. 7731 proven. 2240 refuted. 0 times theorem prover too weak. 1214 trivial. 0 not checked. [2018-10-14 16:26:36,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:36,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:26:36,191 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:26:36,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:26:36,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:26:36,191 INFO L87 Difference]: Start difference. First operand 1351 states and 1363 transitions. Second operand 28 states. [2018-10-14 16:26:38,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:38,254 INFO L93 Difference]: Finished difference Result 1351 states and 1361 transitions. [2018-10-14 16:26:38,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-14 16:26:38,255 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 1245 [2018-10-14 16:26:38,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:38,260 INFO L225 Difference]: With dead ends: 1351 [2018-10-14 16:26:38,260 INFO L226 Difference]: Without dead ends: 1351 [2018-10-14 16:26:38,261 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 818 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=783, Invalid=3249, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:26:38,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2018-10-14 16:26:38,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2018-10-14 16:26:38,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1351 states. [2018-10-14 16:26:38,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1361 transitions. [2018-10-14 16:26:38,273 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1361 transitions. Word has length 1245 [2018-10-14 16:26:38,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:38,274 INFO L481 AbstractCegarLoop]: Abstraction has 1351 states and 1361 transitions. [2018-10-14 16:26:38,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:26:38,274 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1361 transitions. [2018-10-14 16:26:38,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1267 [2018-10-14 16:26:38,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:38,288 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-14 16:26:38,288 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:38,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:38,289 INFO L82 PathProgramCache]: Analyzing trace with hash 1060927957, now seen corresponding path program 23 times [2018-10-14 16:26:38,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:38,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:39,702 INFO L134 CoverageAnalysis]: Checked inductivity of 11742 backedges. 6292 proven. 332 refuted. 0 times theorem prover too weak. 5118 trivial. 0 not checked. [2018-10-14 16:26:39,702 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:39,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-14 16:26:39,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-14 16:26:39,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-14 16:26:39,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-14 16:26:39,704 INFO L87 Difference]: Start difference. First operand 1351 states and 1361 transitions. Second operand 27 states. [2018-10-14 16:26:43,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:26:43,008 INFO L93 Difference]: Finished difference Result 1368 states and 1378 transitions. [2018-10-14 16:26:43,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 16:26:43,009 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 1266 [2018-10-14 16:26:43,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:26:43,015 INFO L225 Difference]: With dead ends: 1368 [2018-10-14 16:26:43,015 INFO L226 Difference]: Without dead ends: 1368 [2018-10-14 16:26:43,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1600 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1146, Invalid=5334, Unknown=0, NotChecked=0, Total=6480 [2018-10-14 16:26:43,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1368 states. [2018-10-14 16:26:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1368 to 1365. [2018-10-14 16:26:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1365 states. [2018-10-14 16:26:43,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 1375 transitions. [2018-10-14 16:26:43,027 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 1375 transitions. Word has length 1266 [2018-10-14 16:26:43,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:26:43,028 INFO L481 AbstractCegarLoop]: Abstraction has 1365 states and 1375 transitions. [2018-10-14 16:26:43,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-14 16:26:43,028 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 1375 transitions. [2018-10-14 16:26:43,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1281 [2018-10-14 16:26:43,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:26:43,042 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-14 16:26:43,042 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:26:43,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:26:43,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1289570780, now seen corresponding path program 24 times [2018-10-14 16:26:43,043 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:26:43,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:26:43,909 WARN L179 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 7 DAG size of output: 6 [2018-10-14 16:26:48,147 INFO L134 CoverageAnalysis]: Checked inductivity of 12029 backedges. 7100 proven. 3799 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2018-10-14 16:26:48,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:26:48,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:26:48,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:26:48,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:26:48,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1965, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:26:48,150 INFO L87 Difference]: Start difference. First operand 1365 states and 1375 transitions. Second operand 47 states. [2018-10-14 16:26:54,630 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:26:55,736 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-14 16:26:55,910 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-10-14 16:26:56,095 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 43 [2018-10-14 16:26:56,329 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-10-14 16:26:56,697 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-14 16:26:56,908 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 57 [2018-10-14 16:26:57,070 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:26:57,281 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:26:57,511 WARN L179 SmtUtils]: Spent 153.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 56 [2018-10-14 16:26:57,713 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 57 [2018-10-14 16:26:57,879 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-10-14 16:26:58,047 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-10-14 16:26:58,270 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 56 [2018-10-14 16:26:58,470 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-14 16:26:58,625 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-14 16:26:58,843 WARN L179 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-14 16:26:59,016 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-14 16:26:59,190 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-14 16:27:00,845 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 53 [2018-10-14 16:27:01,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:01,425 INFO L93 Difference]: Finished difference Result 1659 states and 1673 transitions. [2018-10-14 16:27:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-14 16:27:01,426 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1280 [2018-10-14 16:27:01,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:01,431 INFO L225 Difference]: With dead ends: 1659 [2018-10-14 16:27:01,431 INFO L226 Difference]: Without dead ends: 1659 [2018-10-14 16:27:01,433 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3616 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2564, Invalid=12198, Unknown=0, NotChecked=0, Total=14762 [2018-10-14 16:27:01,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2018-10-14 16:27:01,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 1386. [2018-10-14 16:27:01,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1386 states. [2018-10-14 16:27:01,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1386 states to 1386 states and 1397 transitions. [2018-10-14 16:27:01,444 INFO L78 Accepts]: Start accepts. Automaton has 1386 states and 1397 transitions. Word has length 1280 [2018-10-14 16:27:01,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:01,445 INFO L481 AbstractCegarLoop]: Abstraction has 1386 states and 1397 transitions. [2018-10-14 16:27:01,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:27:01,445 INFO L276 IsEmpty]: Start isEmpty. Operand 1386 states and 1397 transitions. [2018-10-14 16:27:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1302 [2018-10-14 16:27:01,458 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:01,459 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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] [2018-10-14 16:27:01,459 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:01,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:01,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1790111505, now seen corresponding path program 25 times [2018-10-14 16:27:01,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:01,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:03,972 INFO L134 CoverageAnalysis]: Checked inductivity of 12607 backedges. 411 proven. 10929 refuted. 0 times theorem prover too weak. 1267 trivial. 0 not checked. [2018-10-14 16:27:03,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:03,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:27:03,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:27:03,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:27:03,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=970, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:27:03,975 INFO L87 Difference]: Start difference. First operand 1386 states and 1397 transitions. Second operand 34 states. [2018-10-14 16:27:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:09,614 INFO L93 Difference]: Finished difference Result 1793 states and 1807 transitions. [2018-10-14 16:27:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-14 16:27:09,614 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 1301 [2018-10-14 16:27:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:09,621 INFO L225 Difference]: With dead ends: 1793 [2018-10-14 16:27:09,621 INFO L226 Difference]: Without dead ends: 1793 [2018-10-14 16:27:09,624 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10596 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=4368, Invalid=23022, Unknown=0, NotChecked=0, Total=27390 [2018-10-14 16:27:09,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1793 states. [2018-10-14 16:27:09,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1793 to 1671. [2018-10-14 16:27:09,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-10-14 16:27:09,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1684 transitions. [2018-10-14 16:27:09,636 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1684 transitions. Word has length 1301 [2018-10-14 16:27:09,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:09,637 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1684 transitions. [2018-10-14 16:27:09,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:27:09,637 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1684 transitions. [2018-10-14 16:27:09,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1566 [2018-10-14 16:27:09,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:09,656 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-14 16:27:09,656 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:09,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:09,657 INFO L82 PathProgramCache]: Analyzing trace with hash -73348120, now seen corresponding path program 26 times [2018-10-14 16:27:09,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:12,337 INFO L134 CoverageAnalysis]: Checked inductivity of 18991 backedges. 13521 proven. 3518 refuted. 0 times theorem prover too weak. 1952 trivial. 0 not checked. [2018-10-14 16:27:12,337 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:12,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:27:12,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:27:12,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:27:12,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=857, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:27:12,339 INFO L87 Difference]: Start difference. First operand 1671 states and 1684 transitions. Second operand 32 states. [2018-10-14 16:27:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:15,079 INFO L93 Difference]: Finished difference Result 1671 states and 1682 transitions. [2018-10-14 16:27:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-14 16:27:15,079 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 1565 [2018-10-14 16:27:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:15,084 INFO L225 Difference]: With dead ends: 1671 [2018-10-14 16:27:15,085 INFO L226 Difference]: Without dead ends: 1671 [2018-10-14 16:27:15,085 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1133 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1044, Invalid=4358, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:27:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1671 states. [2018-10-14 16:27:15,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1671 to 1671. [2018-10-14 16:27:15,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1671 states. [2018-10-14 16:27:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1671 states to 1671 states and 1682 transitions. [2018-10-14 16:27:15,097 INFO L78 Accepts]: Start accepts. Automaton has 1671 states and 1682 transitions. Word has length 1565 [2018-10-14 16:27:15,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:15,098 INFO L481 AbstractCegarLoop]: Abstraction has 1671 states and 1682 transitions. [2018-10-14 16:27:15,098 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:27:15,098 INFO L276 IsEmpty]: Start isEmpty. Operand 1671 states and 1682 transitions. [2018-10-14 16:27:15,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1587 [2018-10-14 16:27:15,129 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:15,130 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-14 16:27:15,130 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:15,130 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:15,131 INFO L82 PathProgramCache]: Analyzing trace with hash -1617596717, now seen corresponding path program 27 times [2018-10-14 16:27:15,131 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:17,153 INFO L134 CoverageAnalysis]: Checked inductivity of 19717 backedges. 9893 proven. 444 refuted. 0 times theorem prover too weak. 9380 trivial. 0 not checked. [2018-10-14 16:27:17,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:17,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-14 16:27:17,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-14 16:27:17,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-14 16:27:17,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=808, Unknown=0, NotChecked=0, Total=930 [2018-10-14 16:27:17,155 INFO L87 Difference]: Start difference. First operand 1671 states and 1682 transitions. Second operand 31 states. [2018-10-14 16:27:21,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:21,192 INFO L93 Difference]: Finished difference Result 1688 states and 1699 transitions. [2018-10-14 16:27:21,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-14 16:27:21,193 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 1586 [2018-10-14 16:27:21,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:21,199 INFO L225 Difference]: With dead ends: 1688 [2018-10-14 16:27:21,199 INFO L226 Difference]: Without dead ends: 1688 [2018-10-14 16:27:21,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2218 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1540, Invalid=7202, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 16:27:21,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1688 states. [2018-10-14 16:27:21,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1688 to 1685. [2018-10-14 16:27:21,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1685 states. [2018-10-14 16:27:21,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1685 states to 1685 states and 1696 transitions. [2018-10-14 16:27:21,217 INFO L78 Accepts]: Start accepts. Automaton has 1685 states and 1696 transitions. Word has length 1586 [2018-10-14 16:27:21,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:21,218 INFO L481 AbstractCegarLoop]: Abstraction has 1685 states and 1696 transitions. [2018-10-14 16:27:21,218 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-14 16:27:21,219 INFO L276 IsEmpty]: Start isEmpty. Operand 1685 states and 1696 transitions. [2018-10-14 16:27:21,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1601 [2018-10-14 16:27:21,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:21,254 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-14 16:27:21,254 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:21,254 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:21,255 INFO L82 PathProgramCache]: Analyzing trace with hash -134648340, now seen corresponding path program 28 times [2018-10-14 16:27:21,256 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:27,496 INFO L134 CoverageAnalysis]: Checked inductivity of 20103 backedges. 12686 proven. 5567 refuted. 0 times theorem prover too weak. 1850 trivial. 0 not checked. [2018-10-14 16:27:27,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:27,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:27:27,498 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:27:27,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:27:27,499 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=246, Invalid=2304, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:27:27,499 INFO L87 Difference]: Start difference. First operand 1685 states and 1696 transitions. Second operand 51 states. [2018-10-14 16:27:34,949 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:27:35,825 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-14 16:27:36,159 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-14 16:27:36,340 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:27:36,496 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:27:36,690 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:27:36,894 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:27:37,127 WARN L179 SmtUtils]: Spent 173.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:27:37,308 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:27:37,473 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:27:37,682 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:27:37,866 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:27:38,023 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:27:38,196 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:27:38,409 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:27:38,606 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:27:38,773 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:27:38,946 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:27:39,166 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:27:39,364 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-14 16:27:39,524 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-14 16:27:39,692 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-14 16:27:39,908 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-14 16:27:40,095 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-14 16:27:40,260 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 50 [2018-10-14 16:27:41,727 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-14 16:27:41,964 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-14 16:27:42,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:42,643 INFO L93 Difference]: Finished difference Result 2007 states and 2022 transitions. [2018-10-14 16:27:42,643 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 16:27:42,643 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1600 [2018-10-14 16:27:42,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:42,650 INFO L225 Difference]: With dead ends: 2007 [2018-10-14 16:27:42,650 INFO L226 Difference]: Without dead ends: 2007 [2018-10-14 16:27:42,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4534 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=3237, Invalid=14853, Unknown=0, NotChecked=0, Total=18090 [2018-10-14 16:27:42,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2018-10-14 16:27:42,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1706. [2018-10-14 16:27:42,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1706 states. [2018-10-14 16:27:42,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1706 states to 1706 states and 1718 transitions. [2018-10-14 16:27:42,664 INFO L78 Accepts]: Start accepts. Automaton has 1706 states and 1718 transitions. Word has length 1600 [2018-10-14 16:27:42,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:42,665 INFO L481 AbstractCegarLoop]: Abstraction has 1706 states and 1718 transitions. [2018-10-14 16:27:42,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:27:42,665 INFO L276 IsEmpty]: Start isEmpty. Operand 1706 states and 1718 transitions. [2018-10-14 16:27:42,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1622 [2018-10-14 16:27:42,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:42,680 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 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] [2018-10-14 16:27:42,680 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:42,680 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:42,681 INFO L82 PathProgramCache]: Analyzing trace with hash 1068561665, now seen corresponding path program 29 times [2018-10-14 16:27:42,681 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:46,246 INFO L134 CoverageAnalysis]: Checked inductivity of 20850 backedges. 563 proven. 18271 refuted. 0 times theorem prover too weak. 2016 trivial. 0 not checked. [2018-10-14 16:27:46,246 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:46,246 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:27:46,247 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:27:46,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:27:46,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1218, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:27:46,248 INFO L87 Difference]: Start difference. First operand 1706 states and 1718 transitions. Second operand 38 states. [2018-10-14 16:27:50,635 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-14 16:27:53,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:27:53,878 INFO L93 Difference]: Finished difference Result 2162 states and 2177 transitions. [2018-10-14 16:27:53,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-14 16:27:53,878 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 1621 [2018-10-14 16:27:53,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:27:53,888 INFO L225 Difference]: With dead ends: 2162 [2018-10-14 16:27:53,888 INFO L226 Difference]: Without dead ends: 2162 [2018-10-14 16:27:53,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15979 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=6138, Invalid=33662, Unknown=0, NotChecked=0, Total=39800 [2018-10-14 16:27:53,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2162 states. [2018-10-14 16:27:53,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2162 to 2026. [2018-10-14 16:27:53,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-14 16:27:53,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2040 transitions. [2018-10-14 16:27:53,911 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2040 transitions. Word has length 1621 [2018-10-14 16:27:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:27:53,912 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2040 transitions. [2018-10-14 16:27:53,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:27:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2040 transitions. [2018-10-14 16:27:53,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1921 [2018-10-14 16:27:53,932 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:27:53,932 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-14 16:27:53,933 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:27:53,933 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:27:53,933 INFO L82 PathProgramCache]: Analyzing trace with hash -1346257956, now seen corresponding path program 30 times [2018-10-14 16:27:53,934 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:27:54,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:27:57,452 INFO L134 CoverageAnalysis]: Checked inductivity of 30291 backedges. 22133 proven. 5221 refuted. 0 times theorem prover too weak. 2937 trivial. 0 not checked. [2018-10-14 16:27:57,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:27:57,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:27:57,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:27:57,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:27:57,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=1091, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:27:57,454 INFO L87 Difference]: Start difference. First operand 2026 states and 2040 transitions. Second operand 36 states. [2018-10-14 16:28:00,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:00,892 INFO L93 Difference]: Finished difference Result 2026 states and 2038 transitions. [2018-10-14 16:28:00,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-14 16:28:00,893 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 1920 [2018-10-14 16:28:00,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:00,898 INFO L225 Difference]: With dead ends: 2026 [2018-10-14 16:28:00,899 INFO L226 Difference]: Without dead ends: 2026 [2018-10-14 16:28:00,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1499 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1343, Invalid=5629, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:28:00,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2026 states. [2018-10-14 16:28:00,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2026 to 2026. [2018-10-14 16:28:00,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2026 states. [2018-10-14 16:28:00,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2038 transitions. [2018-10-14 16:28:00,917 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2038 transitions. Word has length 1920 [2018-10-14 16:28:00,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:00,919 INFO L481 AbstractCegarLoop]: Abstraction has 2026 states and 2038 transitions. [2018-10-14 16:28:00,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:28:00,919 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2038 transitions. [2018-10-14 16:28:00,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1942 [2018-10-14 16:28:00,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:00,947 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-14 16:28:00,948 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:00,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:00,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1625914097, now seen corresponding path program 31 times [2018-10-14 16:28:00,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:01,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:04,188 INFO L134 CoverageAnalysis]: Checked inductivity of 31207 backedges. 14675 proven. 570 refuted. 0 times theorem prover too weak. 15962 trivial. 0 not checked. [2018-10-14 16:28:04,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:04,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-14 16:28:04,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-14 16:28:04,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-14 16:28:04,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1036, Unknown=0, NotChecked=0, Total=1190 [2018-10-14 16:28:04,190 INFO L87 Difference]: Start difference. First operand 2026 states and 2038 transitions. Second operand 35 states. [2018-10-14 16:28:09,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:09,474 INFO L93 Difference]: Finished difference Result 2043 states and 2055 transitions. [2018-10-14 16:28:09,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 16:28:09,475 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 1941 [2018-10-14 16:28:09,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:09,480 INFO L225 Difference]: With dead ends: 2043 [2018-10-14 16:28:09,480 INFO L226 Difference]: Without dead ends: 2043 [2018-10-14 16:28:09,481 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2936 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1994, Invalid=9348, Unknown=0, NotChecked=0, Total=11342 [2018-10-14 16:28:09,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2043 states. [2018-10-14 16:28:09,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2043 to 2040. [2018-10-14 16:28:09,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2040 states. [2018-10-14 16:28:09,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2040 states to 2040 states and 2052 transitions. [2018-10-14 16:28:09,493 INFO L78 Accepts]: Start accepts. Automaton has 2040 states and 2052 transitions. Word has length 1941 [2018-10-14 16:28:09,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:09,494 INFO L481 AbstractCegarLoop]: Abstraction has 2040 states and 2052 transitions. [2018-10-14 16:28:09,494 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-14 16:28:09,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2040 states and 2052 transitions. [2018-10-14 16:28:09,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1956 [2018-10-14 16:28:09,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:09,516 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-14 16:28:09,516 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:09,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:09,517 INFO L82 PathProgramCache]: Analyzing trace with hash -488605384, now seen corresponding path program 32 times [2018-10-14 16:28:09,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:17,983 INFO L134 CoverageAnalysis]: Checked inductivity of 31706 backedges. 21063 proven. 7826 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2018-10-14 16:28:17,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:17,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-14 16:28:17,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-14 16:28:17,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-14 16:28:17,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=232, Invalid=2524, Unknown=0, NotChecked=0, Total=2756 [2018-10-14 16:28:17,986 INFO L87 Difference]: Start difference. First operand 2040 states and 2052 transitions. Second operand 53 states. [2018-10-14 16:28:28,239 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 48 [2018-10-14 16:28:31,534 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-14 16:28:32,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:32,053 INFO L93 Difference]: Finished difference Result 2390 states and 2406 transitions. [2018-10-14 16:28:32,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-14 16:28:32,054 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1955 [2018-10-14 16:28:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:32,058 INFO L225 Difference]: With dead ends: 2390 [2018-10-14 16:28:32,058 INFO L226 Difference]: Without dead ends: 2390 [2018-10-14 16:28:32,060 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 4 SyntacticMatches, 4 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5011 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=2921, Invalid=15985, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 16:28:32,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2390 states. [2018-10-14 16:28:32,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2390 to 2061. [2018-10-14 16:28:32,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2061 states. [2018-10-14 16:28:32,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2061 states to 2061 states and 2074 transitions. [2018-10-14 16:28:32,072 INFO L78 Accepts]: Start accepts. Automaton has 2061 states and 2074 transitions. Word has length 1955 [2018-10-14 16:28:32,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:32,073 INFO L481 AbstractCegarLoop]: Abstraction has 2061 states and 2074 transitions. [2018-10-14 16:28:32,073 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-14 16:28:32,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2061 states and 2074 transitions. [2018-10-14 16:28:32,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2018-10-14 16:28:32,097 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:32,098 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 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] [2018-10-14 16:28:32,098 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:32,098 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:32,099 INFO L82 PathProgramCache]: Analyzing trace with hash -1444794059, now seen corresponding path program 33 times [2018-10-14 16:28:32,099 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:36,363 INFO L134 CoverageAnalysis]: Checked inductivity of 32643 backedges. 739 proven. 28892 refuted. 0 times theorem prover too weak. 3012 trivial. 0 not checked. [2018-10-14 16:28:36,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:36,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:28:36,365 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:28:36,365 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:28:36,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=1494, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:28:36,365 INFO L87 Difference]: Start difference. First operand 2061 states and 2074 transitions. Second operand 42 states. [2018-10-14 16:28:45,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:45,607 INFO L93 Difference]: Finished difference Result 2566 states and 2582 transitions. [2018-10-14 16:28:45,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 199 states. [2018-10-14 16:28:45,608 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 1976 [2018-10-14 16:28:45,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:45,615 INFO L225 Difference]: With dead ends: 2566 [2018-10-14 16:28:45,615 INFO L226 Difference]: Without dead ends: 2566 [2018-10-14 16:28:45,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 235 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23172 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=8396, Invalid=47536, Unknown=0, NotChecked=0, Total=55932 [2018-10-14 16:28:45,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2566 states. [2018-10-14 16:28:45,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2566 to 2416. [2018-10-14 16:28:45,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-10-14 16:28:45,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2431 transitions. [2018-10-14 16:28:45,636 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2431 transitions. Word has length 1976 [2018-10-14 16:28:45,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:45,637 INFO L481 AbstractCegarLoop]: Abstraction has 2416 states and 2431 transitions. [2018-10-14 16:28:45,637 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:28:45,637 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2431 transitions. [2018-10-14 16:28:45,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2311 [2018-10-14 16:28:45,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:45,668 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-14 16:28:45,668 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:45,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:45,669 INFO L82 PathProgramCache]: Analyzing trace with hash -2090704482, now seen corresponding path program 34 times [2018-10-14 16:28:45,670 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:45,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:50,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45994 backedges. 34378 proven. 7412 refuted. 0 times theorem prover too weak. 4204 trivial. 0 not checked. [2018-10-14 16:28:50,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:50,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:28:50,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:28:50,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:28:50,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=1353, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:28:50,729 INFO L87 Difference]: Start difference. First operand 2416 states and 2431 transitions. Second operand 40 states. [2018-10-14 16:28:55,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:28:55,153 INFO L93 Difference]: Finished difference Result 2416 states and 2429 transitions. [2018-10-14 16:28:55,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:28:55,154 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 2310 [2018-10-14 16:28:55,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:28:55,159 INFO L225 Difference]: With dead ends: 2416 [2018-10-14 16:28:55,159 INFO L226 Difference]: Without dead ends: 2416 [2018-10-14 16:28:55,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1916 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=1680, Invalid=7062, Unknown=0, NotChecked=0, Total=8742 [2018-10-14 16:28:55,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2018-10-14 16:28:55,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 2416. [2018-10-14 16:28:55,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2416 states. [2018-10-14 16:28:55,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2416 states to 2416 states and 2429 transitions. [2018-10-14 16:28:55,178 INFO L78 Accepts]: Start accepts. Automaton has 2416 states and 2429 transitions. Word has length 2310 [2018-10-14 16:28:55,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:28:55,179 INFO L481 AbstractCegarLoop]: Abstraction has 2416 states and 2429 transitions. [2018-10-14 16:28:55,180 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:28:55,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2416 states and 2429 transitions. [2018-10-14 16:28:55,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2332 [2018-10-14 16:28:55,218 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:28:55,219 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-14 16:28:55,220 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:28:55,220 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:28:55,220 INFO L82 PathProgramCache]: Analyzing trace with hash -1740830591, now seen corresponding path program 35 times [2018-10-14 16:28:55,221 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:28:55,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:28:58,723 INFO L134 CoverageAnalysis]: Checked inductivity of 47121 backedges. 20806 proven. 710 refuted. 0 times theorem prover too weak. 25605 trivial. 0 not checked. [2018-10-14 16:28:58,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:28:58,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-14 16:28:58,725 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-14 16:28:58,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-14 16:28:58,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=1292, Unknown=0, NotChecked=0, Total=1482 [2018-10-14 16:28:58,725 INFO L87 Difference]: Start difference. First operand 2416 states and 2429 transitions. Second operand 39 states. [2018-10-14 16:29:03,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:03,125 INFO L93 Difference]: Finished difference Result 2433 states and 2446 transitions. [2018-10-14 16:29:03,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-14 16:29:03,125 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 2331 [2018-10-14 16:29:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:03,131 INFO L225 Difference]: With dead ends: 2433 [2018-10-14 16:29:03,131 INFO L226 Difference]: Without dead ends: 2433 [2018-10-14 16:29:03,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3754 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=2508, Invalid=11772, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 16:29:03,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2433 states. [2018-10-14 16:29:03,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2433 to 2430. [2018-10-14 16:29:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2430 states. [2018-10-14 16:29:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2430 states to 2430 states and 2443 transitions. [2018-10-14 16:29:03,152 INFO L78 Accepts]: Start accepts. Automaton has 2430 states and 2443 transitions. Word has length 2331 [2018-10-14 16:29:03,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:03,153 INFO L481 AbstractCegarLoop]: Abstraction has 2430 states and 2443 transitions. [2018-10-14 16:29:03,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-14 16:29:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 2430 states and 2443 transitions. [2018-10-14 16:29:03,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2346 [2018-10-14 16:29:03,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:03,198 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-14 16:29:03,198 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:03,198 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:03,199 INFO L82 PathProgramCache]: Analyzing trace with hash 1742551002, now seen corresponding path program 36 times [2018-10-14 16:29:03,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:03,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:14,298 INFO L134 CoverageAnalysis]: Checked inductivity of 47747 backedges. 33042 proven. 10639 refuted. 0 times theorem prover too weak. 4066 trivial. 0 not checked. [2018-10-14 16:29:14,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:14,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:29:14,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:29:14,300 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:29:14,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=3201, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:29:14,300 INFO L87 Difference]: Start difference. First operand 2430 states and 2443 transitions. Second operand 60 states. [2018-10-14 16:29:24,535 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 44 [2018-10-14 16:29:24,767 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:25,376 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-14 16:29:25,721 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-14 16:29:26,097 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-14 16:29:26,283 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:26,445 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:26,646 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:26,854 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:27,040 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:27,195 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:27,369 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:27,578 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:27,771 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:27,933 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:28,111 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:28,328 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:28,528 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:28,694 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:28,871 WARN L179 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:29,096 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:29,302 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:29,481 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:29,764 WARN L179 SmtUtils]: Spent 180.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:30,001 WARN L179 SmtUtils]: Spent 135.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:30,216 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 58 [2018-10-14 16:29:30,393 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:29:30,577 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 51 [2018-10-14 16:29:30,814 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 57 [2018-10-14 16:29:31,029 WARN L179 SmtUtils]: Spent 128.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 58 [2018-10-14 16:29:31,204 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 51 [2018-10-14 16:29:31,387 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 51 [2018-10-14 16:29:31,614 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 57 [2018-10-14 16:29:31,818 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 57 [2018-10-14 16:29:33,732 WARN L179 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 53 [2018-10-14 16:29:34,010 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-14 16:29:34,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:34,571 INFO L93 Difference]: Finished difference Result 2808 states and 2825 transitions. [2018-10-14 16:29:34,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-14 16:29:34,571 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 2345 [2018-10-14 16:29:34,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:34,577 INFO L225 Difference]: With dead ends: 2808 [2018-10-14 16:29:34,577 INFO L226 Difference]: Without dead ends: 2808 [2018-10-14 16:29:34,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6381 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=4404, Invalid=20402, Unknown=0, NotChecked=0, Total=24806 [2018-10-14 16:29:34,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2808 states. [2018-10-14 16:29:34,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2808 to 2451. [2018-10-14 16:29:34,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2451 states. [2018-10-14 16:29:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2451 states to 2451 states and 2465 transitions. [2018-10-14 16:29:34,599 INFO L78 Accepts]: Start accepts. Automaton has 2451 states and 2465 transitions. Word has length 2345 [2018-10-14 16:29:34,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:34,601 INFO L481 AbstractCegarLoop]: Abstraction has 2451 states and 2465 transitions. [2018-10-14 16:29:34,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:29:34,601 INFO L276 IsEmpty]: Start isEmpty. Operand 2451 states and 2465 transitions. [2018-10-14 16:29:34,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2367 [2018-10-14 16:29:34,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:34,645 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 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] [2018-10-14 16:29:34,645 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:34,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:34,646 INFO L82 PathProgramCache]: Analyzing trace with hash -1148695597, now seen corresponding path program 37 times [2018-10-14 16:29:34,646 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:34,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:40,119 INFO L134 CoverageAnalysis]: Checked inductivity of 48895 backedges. 939 proven. 43666 refuted. 0 times theorem prover too weak. 4290 trivial. 0 not checked. [2018-10-14 16:29:40,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:40,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:29:40,121 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:29:40,121 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:29:40,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=272, Invalid=1798, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:29:40,122 INFO L87 Difference]: Start difference. First operand 2451 states and 2465 transitions. Second operand 46 states. [2018-10-14 16:29:51,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:29:51,286 INFO L93 Difference]: Finished difference Result 3005 states and 3022 transitions. [2018-10-14 16:29:51,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 235 states. [2018-10-14 16:29:51,287 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 2366 [2018-10-14 16:29:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:29:51,294 INFO L225 Difference]: With dead ends: 3005 [2018-10-14 16:29:51,294 INFO L226 Difference]: Without dead ends: 3005 [2018-10-14 16:29:51,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 277 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 275 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32541 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=11226, Invalid=65226, Unknown=0, NotChecked=0, Total=76452 [2018-10-14 16:29:51,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3005 states. [2018-10-14 16:29:51,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3005 to 2841. [2018-10-14 16:29:51,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-14 16:29:51,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 2857 transitions. [2018-10-14 16:29:51,335 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 2857 transitions. Word has length 2366 [2018-10-14 16:29:51,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:29:51,336 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 2857 transitions. [2018-10-14 16:29:51,336 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:29:51,336 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 2857 transitions. [2018-10-14 16:29:51,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2736 [2018-10-14 16:29:51,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:29:51,400 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 64, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 16:29:51,400 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:29:51,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:29:51,401 INFO L82 PathProgramCache]: Analyzing trace with hash -414117192, now seen corresponding path program 38 times [2018-10-14 16:29:51,402 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:29:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:29:57,498 INFO L134 CoverageAnalysis]: Checked inductivity of 67114 backedges. 51172 proven. 10154 refuted. 0 times theorem prover too weak. 5788 trivial. 0 not checked. [2018-10-14 16:29:57,498 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:29:57,499 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:29:57,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:29:57,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:29:57,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=1643, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:29:57,500 INFO L87 Difference]: Start difference. First operand 2841 states and 2857 transitions. Second operand 44 states. [2018-10-14 16:30:02,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:02,709 INFO L93 Difference]: Finished difference Result 2841 states and 2855 transitions. [2018-10-14 16:30:02,710 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-14 16:30:02,710 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 2735 [2018-10-14 16:30:02,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:02,714 INFO L225 Difference]: With dead ends: 2841 [2018-10-14 16:30:02,714 INFO L226 Difference]: Without dead ends: 2841 [2018-10-14 16:30:02,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2384 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=2055, Invalid=8657, Unknown=0, NotChecked=0, Total=10712 [2018-10-14 16:30:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2841 states. [2018-10-14 16:30:02,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2841 to 2841. [2018-10-14 16:30:02,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2841 states. [2018-10-14 16:30:02,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2841 states to 2841 states and 2855 transitions. [2018-10-14 16:30:02,731 INFO L78 Accepts]: Start accepts. Automaton has 2841 states and 2855 transitions. Word has length 2735 [2018-10-14 16:30:02,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:02,732 INFO L481 AbstractCegarLoop]: Abstraction has 2841 states and 2855 transitions. [2018-10-14 16:30:02,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:30:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 2841 states and 2855 transitions. [2018-10-14 16:30:02,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2757 [2018-10-14 16:30:02,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:02,771 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 54, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 16:30:02,772 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:02,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:02,773 INFO L82 PathProgramCache]: Analyzing trace with hash 262920177, now seen corresponding path program 39 times [2018-10-14 16:30:02,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:02,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:07,255 INFO L134 CoverageAnalysis]: Checked inductivity of 68473 backedges. 28454 proven. 864 refuted. 0 times theorem prover too weak. 39155 trivial. 0 not checked. [2018-10-14 16:30:07,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:07,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-14 16:30:07,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-14 16:30:07,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-14 16:30:07,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=1576, Unknown=0, NotChecked=0, Total=1806 [2018-10-14 16:30:07,257 INFO L87 Difference]: Start difference. First operand 2841 states and 2855 transitions. Second operand 43 states. [2018-10-14 16:30:12,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:12,473 INFO L93 Difference]: Finished difference Result 2858 states and 2872 transitions. [2018-10-14 16:30:12,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 16:30:12,474 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 2756 [2018-10-14 16:30:12,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:12,477 INFO L225 Difference]: With dead ends: 2858 [2018-10-14 16:30:12,477 INFO L226 Difference]: Without dead ends: 2858 [2018-10-14 16:30:12,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4672 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=3082, Invalid=14474, Unknown=0, NotChecked=0, Total=17556 [2018-10-14 16:30:12,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2858 states. [2018-10-14 16:30:12,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2858 to 2855. [2018-10-14 16:30:12,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2855 states. [2018-10-14 16:30:12,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2855 states to 2855 states and 2869 transitions. [2018-10-14 16:30:12,495 INFO L78 Accepts]: Start accepts. Automaton has 2855 states and 2869 transitions. Word has length 2756 [2018-10-14 16:30:12,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:12,496 INFO L481 AbstractCegarLoop]: Abstraction has 2855 states and 2869 transitions. [2018-10-14 16:30:12,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-14 16:30:12,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2855 states and 2869 transitions. [2018-10-14 16:30:12,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2771 [2018-10-14 16:30:12,537 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:12,538 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 16:30:12,538 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:12,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:12,539 INFO L82 PathProgramCache]: Analyzing trace with hash 770790776, now seen corresponding path program 40 times [2018-10-14 16:30:12,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:12,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:26,928 INFO L134 CoverageAnalysis]: Checked inductivity of 69240 backedges. 49539 proven. 14069 refuted. 0 times theorem prover too weak. 5632 trivial. 0 not checked. [2018-10-14 16:30:26,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:26,929 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:30:26,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:30:26,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:30:26,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=370, Invalid=3662, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:30:26,931 INFO L87 Difference]: Start difference. First operand 2855 states and 2869 transitions. Second operand 64 states. [2018-10-14 16:30:38,884 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:30:39,519 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 46 [2018-10-14 16:30:40,112 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 51 [2018-10-14 16:30:40,291 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 50 [2018-10-14 16:30:40,644 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 49 [2018-10-14 16:30:41,069 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 55 [2018-10-14 16:30:41,322 WARN L179 SmtUtils]: Spent 182.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 16:30:41,535 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:30:41,755 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:30:41,992 WARN L179 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 16:30:42,202 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 16:30:42,373 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:30:42,558 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:30:42,792 WARN L179 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 16:30:43,001 WARN L179 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 16:30:43,187 WARN L179 SmtUtils]: Spent 114.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:30:43,373 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:30:43,610 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 16:30:43,829 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 16:30:44,007 WARN L179 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:30:44,195 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:30:44,441 WARN L179 SmtUtils]: Spent 150.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 16:30:44,670 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 59 [2018-10-14 16:30:44,862 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 50 [2018-10-14 16:30:45,060 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 50 [2018-10-14 16:30:45,313 WARN L179 SmtUtils]: Spent 147.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 58 [2018-10-14 16:30:45,548 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 59 [2018-10-14 16:30:45,766 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 50 [2018-10-14 16:30:45,957 WARN L179 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 50 [2018-10-14 16:30:46,204 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 58 [2018-10-14 16:30:46,468 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 56 [2018-10-14 16:30:46,684 WARN L179 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-14 16:30:46,943 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 55 [2018-10-14 16:30:47,152 WARN L179 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-14 16:30:47,330 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 49 [2018-10-14 16:30:49,363 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 52 [2018-10-14 16:30:49,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:30:49,949 INFO L93 Difference]: Finished difference Result 3261 states and 3279 transitions. [2018-10-14 16:30:49,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-14 16:30:49,949 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 2770 [2018-10-14 16:30:49,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:30:49,952 INFO L225 Difference]: With dead ends: 3261 [2018-10-14 16:30:49,953 INFO L226 Difference]: Without dead ends: 3261 [2018-10-14 16:30:49,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7120 ImplicationChecksByTransitivity, 15.3s TimeCoverageRelationStatistics Valid=4810, Invalid=22912, Unknown=0, NotChecked=0, Total=27722 [2018-10-14 16:30:49,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3261 states. [2018-10-14 16:30:49,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3261 to 2876. [2018-10-14 16:30:49,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2876 states. [2018-10-14 16:30:49,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 2891 transitions. [2018-10-14 16:30:49,970 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 2891 transitions. Word has length 2770 [2018-10-14 16:30:49,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:30:49,971 INFO L481 AbstractCegarLoop]: Abstraction has 2876 states and 2891 transitions. [2018-10-14 16:30:49,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:30:49,972 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 2891 transitions. [2018-10-14 16:30:50,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2792 [2018-10-14 16:30:50,014 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:30:50,015 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 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] [2018-10-14 16:30:50,015 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:30:50,015 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:30:50,016 INFO L82 PathProgramCache]: Analyzing trace with hash 1990294773, now seen corresponding path program 41 times [2018-10-14 16:30:50,016 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:30:50,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:30:56,997 INFO L134 CoverageAnalysis]: Checked inductivity of 70620 backedges. 1163 proven. 63572 refuted. 0 times theorem prover too weak. 5885 trivial. 0 not checked. [2018-10-14 16:30:56,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:30:56,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:30:56,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:30:57,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:30:57,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=320, Invalid=2130, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:30:57,000 INFO L87 Difference]: Start difference. First operand 2876 states and 2891 transitions. Second operand 50 states. [2018-10-14 16:31:11,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:11,115 INFO L93 Difference]: Finished difference Result 3479 states and 3497 transitions. [2018-10-14 16:31:11,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 274 states. [2018-10-14 16:31:11,116 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 2791 [2018-10-14 16:31:11,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:11,119 INFO L225 Difference]: With dead ends: 3479 [2018-10-14 16:31:11,119 INFO L226 Difference]: Without dead ends: 3479 [2018-10-14 16:31:11,127 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 318 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44486 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=14719, Invalid=87361, Unknown=0, NotChecked=0, Total=102080 [2018-10-14 16:31:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3479 states. [2018-10-14 16:31:11,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3479 to 3301. [2018-10-14 16:31:11,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2018-10-14 16:31:11,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 3318 transitions. [2018-10-14 16:31:11,144 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 3318 transitions. Word has length 2791 [2018-10-14 16:31:11,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:11,145 INFO L481 AbstractCegarLoop]: Abstraction has 3301 states and 3318 transitions. [2018-10-14 16:31:11,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:31:11,145 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3318 transitions. [2018-10-14 16:31:11,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3196 [2018-10-14 16:31:11,196 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:11,197 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 77, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 76, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-14 16:31:11,197 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:11,197 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:11,198 INFO L82 PathProgramCache]: Analyzing trace with hash 243384560, now seen corresponding path program 42 times [2018-10-14 16:31:11,198 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:11,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:19,423 INFO L134 CoverageAnalysis]: Checked inductivity of 94770 backedges. 73536 proven. 13510 refuted. 0 times theorem prover too weak. 7724 trivial. 0 not checked. [2018-10-14 16:31:19,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:19,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:31:19,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:31:19,425 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:31:19,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=295, Invalid=1961, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:31:19,425 INFO L87 Difference]: Start difference. First operand 3301 states and 3318 transitions. Second operand 48 states. [2018-10-14 16:31:24,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:24,177 INFO L93 Difference]: Finished difference Result 3301 states and 3316 transitions. [2018-10-14 16:31:24,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-14 16:31:24,178 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 3195 [2018-10-14 16:31:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:24,183 INFO L225 Difference]: With dead ends: 3301 [2018-10-14 16:31:24,183 INFO L226 Difference]: Without dead ends: 3301 [2018-10-14 16:31:24,185 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2903 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=2468, Invalid=10414, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 16:31:24,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3301 states. [2018-10-14 16:31:24,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3301 to 3301. [2018-10-14 16:31:24,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3301 states. [2018-10-14 16:31:24,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3301 states to 3301 states and 3316 transitions. [2018-10-14 16:31:24,205 INFO L78 Accepts]: Start accepts. Automaton has 3301 states and 3316 transitions. Word has length 3195 [2018-10-14 16:31:24,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:24,206 INFO L481 AbstractCegarLoop]: Abstraction has 3301 states and 3316 transitions. [2018-10-14 16:31:24,206 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:31:24,206 INFO L276 IsEmpty]: Start isEmpty. Operand 3301 states and 3316 transitions. [2018-10-14 16:31:24,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3217 [2018-10-14 16:31:24,263 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:24,264 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 65, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-14 16:31:24,264 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:24,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:24,265 INFO L82 PathProgramCache]: Analyzing trace with hash 183818771, now seen corresponding path program 43 times [2018-10-14 16:31:24,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:24,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:30,432 INFO L134 CoverageAnalysis]: Checked inductivity of 96382 backedges. 37787 proven. 1032 refuted. 0 times theorem prover too weak. 57563 trivial. 0 not checked. [2018-10-14 16:31:30,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:30,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-14 16:31:30,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-14 16:31:30,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-14 16:31:30,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=1888, Unknown=0, NotChecked=0, Total=2162 [2018-10-14 16:31:30,434 INFO L87 Difference]: Start difference. First operand 3301 states and 3316 transitions. Second operand 47 states. [2018-10-14 16:31:36,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:31:36,739 INFO L93 Difference]: Finished difference Result 3318 states and 3333 transitions. [2018-10-14 16:31:36,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-14 16:31:36,740 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 3216 [2018-10-14 16:31:36,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:31:36,744 INFO L225 Difference]: With dead ends: 3318 [2018-10-14 16:31:36,744 INFO L226 Difference]: Without dead ends: 3318 [2018-10-14 16:31:36,745 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5690 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=3716, Invalid=17454, Unknown=0, NotChecked=0, Total=21170 [2018-10-14 16:31:36,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3318 states. [2018-10-14 16:31:36,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3318 to 3315. [2018-10-14 16:31:36,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3315 states. [2018-10-14 16:31:36,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3315 states to 3315 states and 3330 transitions. [2018-10-14 16:31:36,761 INFO L78 Accepts]: Start accepts. Automaton has 3315 states and 3330 transitions. Word has length 3216 [2018-10-14 16:31:36,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:31:36,762 INFO L481 AbstractCegarLoop]: Abstraction has 3315 states and 3330 transitions. [2018-10-14 16:31:36,762 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-14 16:31:36,763 INFO L276 IsEmpty]: Start isEmpty. Operand 3315 states and 3330 transitions. [2018-10-14 16:31:36,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3231 [2018-10-14 16:31:36,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:31:36,816 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 78, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-14 16:31:36,816 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:31:36,816 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:31:36,817 INFO L82 PathProgramCache]: Analyzing trace with hash 981248684, now seen corresponding path program 44 times [2018-10-14 16:31:36,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:31:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:31:55,332 INFO L134 CoverageAnalysis]: Checked inductivity of 97304 backedges. 71575 proven. 18179 refuted. 0 times theorem prover too weak. 7550 trivial. 0 not checked. [2018-10-14 16:31:55,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:31:55,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 16:31:55,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 16:31:55,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 16:31:55,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=443, Invalid=4113, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:31:55,336 INFO L87 Difference]: Start difference. First operand 3315 states and 3330 transitions. Second operand 68 states. [2018-10-14 16:32:07,649 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 51 [2018-10-14 16:32:08,279 WARN L179 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 46 [2018-10-14 16:32:08,511 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 44 [2018-10-14 16:32:08,711 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 47 [2018-10-14 16:32:09,073 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 54 [2018-10-14 16:32:09,261 WARN L179 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:09,424 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:09,627 WARN L179 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:09,849 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:10,029 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:10,244 WARN L179 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:10,418 WARN L179 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:10,636 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:10,827 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:10,993 WARN L179 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:11,162 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:11,385 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:11,585 WARN L179 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:11,751 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:11,930 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:12,149 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:12,359 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:12,530 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:12,710 WARN L179 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:12,944 WARN L179 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:13,158 WARN L179 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:13,338 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:13,589 WARN L179 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:13,866 WARN L179 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:14,082 WARN L179 SmtUtils]: Spent 131.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:14,276 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:14,467 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:14,710 WARN L179 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:14,940 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 56 [2018-10-14 16:32:15,138 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2018-10-14 16:32:15,329 WARN L179 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 49 [2018-10-14 16:32:15,581 WARN L179 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 55 [2018-10-14 16:32:15,815 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 56 [2018-10-14 16:32:16,001 WARN L179 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 57 DAG size of output: 49 [2018-10-14 16:32:16,191 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 49 [2018-10-14 16:32:16,432 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 55 [2018-10-14 16:32:16,651 WARN L179 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 55 [2018-10-14 16:32:18,615 WARN L179 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 52 [2018-10-14 16:32:18,936 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 52 [2018-10-14 16:32:19,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:19,532 INFO L93 Difference]: Finished difference Result 3749 states and 3768 transitions. [2018-10-14 16:32:19,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 16:32:19,532 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 3230 [2018-10-14 16:32:19,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:19,536 INFO L225 Difference]: With dead ends: 3749 [2018-10-14 16:32:19,536 INFO L226 Difference]: Without dead ends: 3749 [2018-10-14 16:32:19,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8379 ImplicationChecksByTransitivity, 16.7s TimeCoverageRelationStatistics Valid=5739, Invalid=26481, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 16:32:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3749 states. [2018-10-14 16:32:19,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3749 to 3336. [2018-10-14 16:32:19,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3336 states. [2018-10-14 16:32:19,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3336 states to 3336 states and 3352 transitions. [2018-10-14 16:32:19,561 INFO L78 Accepts]: Start accepts. Automaton has 3336 states and 3352 transitions. Word has length 3230 [2018-10-14 16:32:19,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:19,563 INFO L481 AbstractCegarLoop]: Abstraction has 3336 states and 3352 transitions. [2018-10-14 16:32:19,563 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 16:32:19,563 INFO L276 IsEmpty]: Start isEmpty. Operand 3336 states and 3352 transitions. [2018-10-14 16:32:19,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3252 [2018-10-14 16:32:19,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:19,625 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 79, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 66, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 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] [2018-10-14 16:32:19,625 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:19,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:19,626 INFO L82 PathProgramCache]: Analyzing trace with hash -115920831, now seen corresponding path program 45 times [2018-10-14 16:32:19,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:19,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:28,598 INFO L134 CoverageAnalysis]: Checked inductivity of 98937 backedges. 1411 proven. 89694 refuted. 0 times theorem prover too weak. 7832 trivial. 0 not checked. [2018-10-14 16:32:28,598 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:28,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:32:28,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:32:28,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:32:28,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=372, Invalid=2490, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:32:28,601 INFO L87 Difference]: Start difference. First operand 3336 states and 3352 transitions. Second operand 54 states. [2018-10-14 16:32:45,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:32:45,694 INFO L93 Difference]: Finished difference Result 3988 states and 4007 transitions. [2018-10-14 16:32:45,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 316 states. [2018-10-14 16:32:45,694 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 3251 [2018-10-14 16:32:45,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:32:45,699 INFO L225 Difference]: With dead ends: 3988 [2018-10-14 16:32:45,699 INFO L226 Difference]: Without dead ends: 3988 [2018-10-14 16:32:45,710 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 366 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 364 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59441 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=18973, Invalid=114617, Unknown=0, NotChecked=0, Total=133590 [2018-10-14 16:32:45,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3988 states. [2018-10-14 16:32:45,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3988 to 3796. [2018-10-14 16:32:45,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2018-10-14 16:32:45,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 3814 transitions. [2018-10-14 16:32:45,728 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 3814 transitions. Word has length 3251 [2018-10-14 16:32:45,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:32:45,729 INFO L481 AbstractCegarLoop]: Abstraction has 3796 states and 3814 transitions. [2018-10-14 16:32:45,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:32:45,730 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 3814 transitions. [2018-10-14 16:32:45,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3691 [2018-10-14 16:32:45,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:32:45,795 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 90, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 89, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-14 16:32:45,795 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:32:45,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:32:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash 223083384, now seen corresponding path program 46 times [2018-10-14 16:32:45,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:32:45,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:32:55,988 INFO L134 CoverageAnalysis]: Checked inductivity of 130186 backedges. 102596 proven. 17543 refuted. 0 times theorem prover too weak. 10047 trivial. 0 not checked. [2018-10-14 16:32:55,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:32:55,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:32:55,990 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:32:55,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:32:55,990 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=345, Invalid=2307, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:32:55,990 INFO L87 Difference]: Start difference. First operand 3796 states and 3814 transitions. Second operand 52 states. [2018-10-14 16:33:02,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:02,099 INFO L93 Difference]: Finished difference Result 3796 states and 3812 transitions. [2018-10-14 16:33:02,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-14 16:33:02,100 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 3690 [2018-10-14 16:33:02,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:02,105 INFO L225 Difference]: With dead ends: 3796 [2018-10-14 16:33:02,105 INFO L226 Difference]: Without dead ends: 3796 [2018-10-14 16:33:02,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3473 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=2919, Invalid=12333, Unknown=0, NotChecked=0, Total=15252 [2018-10-14 16:33:02,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3796 states. [2018-10-14 16:33:02,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3796 to 3796. [2018-10-14 16:33:02,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3796 states. [2018-10-14 16:33:02,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3796 states to 3796 states and 3812 transitions. [2018-10-14 16:33:02,127 INFO L78 Accepts]: Start accepts. Automaton has 3796 states and 3812 transitions. Word has length 3690 [2018-10-14 16:33:02,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:02,128 INFO L481 AbstractCegarLoop]: Abstraction has 3796 states and 3812 transitions. [2018-10-14 16:33:02,128 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:33:02,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3796 states and 3812 transitions. [2018-10-14 16:33:02,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3712 [2018-10-14 16:33:02,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:02,196 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 77, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-14 16:33:02,196 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:02,196 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:02,197 INFO L82 PathProgramCache]: Analyzing trace with hash -559173235, now seen corresponding path program 47 times [2018-10-14 16:33:02,197 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:02,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:11,783 INFO L134 CoverageAnalysis]: Checked inductivity of 132072 backedges. 48973 proven. 1214 refuted. 0 times theorem prover too weak. 81885 trivial. 0 not checked. [2018-10-14 16:33:11,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:33:11,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-14 16:33:11,784 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-14 16:33:11,785 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-14 16:33:11,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=322, Invalid=2228, Unknown=0, NotChecked=0, Total=2550 [2018-10-14 16:33:11,785 INFO L87 Difference]: Start difference. First operand 3796 states and 3812 transitions. Second operand 51 states. [2018-10-14 16:33:21,085 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:33:21,086 INFO L93 Difference]: Finished difference Result 3813 states and 3829 transitions. [2018-10-14 16:33:21,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-14 16:33:21,087 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 3711 [2018-10-14 16:33:21,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:33:21,091 INFO L225 Difference]: With dead ends: 3813 [2018-10-14 16:33:21,091 INFO L226 Difference]: Without dead ends: 3813 [2018-10-14 16:33:21,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6808 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=4410, Invalid=20712, Unknown=0, NotChecked=0, Total=25122 [2018-10-14 16:33:21,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3813 states. [2018-10-14 16:33:21,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3813 to 3810. [2018-10-14 16:33:21,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3810 states. [2018-10-14 16:33:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3810 states to 3810 states and 3826 transitions. [2018-10-14 16:33:21,112 INFO L78 Accepts]: Start accepts. Automaton has 3810 states and 3826 transitions. Word has length 3711 [2018-10-14 16:33:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:33:21,114 INFO L481 AbstractCegarLoop]: Abstraction has 3810 states and 3826 transitions. [2018-10-14 16:33:21,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-14 16:33:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3810 states and 3826 transitions. [2018-10-14 16:33:21,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3726 [2018-10-14 16:33:21,181 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:33:21,181 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 91, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 90, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 78, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 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] [2018-10-14 16:33:21,181 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:33:21,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:33:21,182 INFO L82 PathProgramCache]: Analyzing trace with hash -871867052, now seen corresponding path program 48 times [2018-10-14 16:33:21,182 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:33:21,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:33:23,499 WARN L179 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 8 DAG size of output: 7