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/standard_strcpy_original_false-valid-deref.i_9.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 21:13:31,895 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 21:13:31,898 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 21:13:31,914 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 21:13:31,914 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 21:13:31,916 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 21:13:31,917 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 21:13:31,920 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 21:13:31,923 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 21:13:31,924 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 21:13:31,924 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 21:13:31,926 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 21:13:31,927 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 21:13:31,928 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 21:13:31,929 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 21:13:31,938 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 21:13:31,939 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 21:13:31,943 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 21:13:31,946 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 21:13:31,947 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 21:13:31,951 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 21:13:31,952 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 21:13:31,955 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 21:13:31,955 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 21:13:31,955 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 21:13:31,959 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 21:13:31,959 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 21:13:31,962 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 21:13:31,965 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 21:13:31,967 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 21:13:31,967 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 21:13:31,968 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 21:13:31,968 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 21:13:31,968 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 21:13:31,971 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 21:13:31,972 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 21:13:31,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-12 21:13:31,989 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 21:13:31,989 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 21:13:31,990 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 21:13:31,990 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 21:13:31,990 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 21:13:31,990 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 21:13:31,991 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 21:13:31,991 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 21:13:31,992 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 21:13:31,992 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 21:13:31,992 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 21:13:31,992 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 21:13:31,992 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 21:13:31,993 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 21:13:31,993 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 21:13:32,050 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 21:13:32,063 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 21:13:32,067 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 21:13:32,069 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 21:13:32,069 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 21:13:32,070 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_9.bpl [2018-10-12 21:13:32,070 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/standard_strcpy_original_false-valid-deref.i_9.bpl' [2018-10-12 21:13:32,152 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 21:13:32,154 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 21:13:32,155 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 21:13:32,155 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 21:13:32,155 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 21:13:32,184 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,186 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,212 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,219 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,224 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... [2018-10-12 21:13:32,229 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 21:13:32,230 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 21:13:32,230 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 21:13:32,231 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 21:13:32,235 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 21:13:32,310 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 21:13:32,312 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 21:13:32,312 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 21:13:32,841 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 21:13:32,842 INFO L202 PluginConnector]: Adding new model standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:32 BoogieIcfgContainer [2018-10-12 21:13:32,842 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 21:13:32,843 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 21:13:32,843 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 21:13:32,847 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 21:13:32,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 09:13:32" (1/2) ... [2018-10-12 21:13:32,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ffc7e5c and model type standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 09:13:32, skipping insertion in model container [2018-10-12 21:13:32,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "standard_strcpy_original_false-valid-deref.i_9.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 09:13:32" (2/2) ... [2018-10-12 21:13:32,850 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_strcpy_original_false-valid-deref.i_9.bpl [2018-10-12 21:13:32,860 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 21:13:32,871 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 21:13:32,888 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 21:13:32,916 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 21:13:32,917 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 21:13:32,917 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 21:13:32,918 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 21:13:32,918 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 21:13:32,918 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 21:13:32,918 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 21:13:32,918 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 21:13:32,918 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 21:13:32,936 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states. [2018-10-12 21:13:32,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-12 21:13:32,945 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:32,946 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:32,947 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:32,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:32,952 INFO L82 PathProgramCache]: Analyzing trace with hash -2056471487, now seen corresponding path program 1 times [2018-10-12 21:13:33,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:33,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:33,472 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:33,475 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 21:13:33,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-12 21:13:33,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-12 21:13:33,499 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-12 21:13:33,500 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-12 21:13:33,502 INFO L87 Difference]: Start difference. First operand 58 states. Second operand 8 states. [2018-10-12 21:13:34,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:34,206 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-12 21:13:34,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 21:13:34,209 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 49 [2018-10-12 21:13:34,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:34,224 INFO L225 Difference]: With dead ends: 104 [2018-10-12 21:13:34,225 INFO L226 Difference]: Without dead ends: 104 [2018-10-12 21:13:34,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:13:34,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-12 21:13:34,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 78. [2018-10-12 21:13:34,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-12 21:13:34,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-12 21:13:34,275 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 49 [2018-10-12 21:13:34,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:34,275 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-12 21:13:34,276 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-12 21:13:34,276 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-12 21:13:34,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-12 21:13:34,279 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:34,279 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:34,280 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:34,280 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:34,280 INFO L82 PathProgramCache]: Analyzing trace with hash -1688992146, now seen corresponding path program 1 times [2018-10-12 21:13:34,281 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:34,887 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 21:13:35,133 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:35,133 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:35,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-12 21:13:35,136 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-12 21:13:35,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-12 21:13:35,137 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2018-10-12 21:13:35,137 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 13 states. [2018-10-12 21:13:36,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:36,138 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-12 21:13:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-12 21:13:36,139 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 77 [2018-10-12 21:13:36,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:36,141 INFO L225 Difference]: With dead ends: 132 [2018-10-12 21:13:36,141 INFO L226 Difference]: Without dead ends: 132 [2018-10-12 21:13:36,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=129, Invalid=291, Unknown=0, NotChecked=0, Total=420 [2018-10-12 21:13:36,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-12 21:13:36,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 106. [2018-10-12 21:13:36,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-12 21:13:36,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-12 21:13:36,158 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 77 [2018-10-12 21:13:36,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:36,159 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-12 21:13:36,159 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-12 21:13:36,159 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-12 21:13:36,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-12 21:13:36,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:36,163 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, 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] [2018-10-12 21:13:36,163 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:36,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:36,164 INFO L82 PathProgramCache]: Analyzing trace with hash -1143768293, now seen corresponding path program 2 times [2018-10-12 21:13:36,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:36,699 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:36,699 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:36,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-12 21:13:36,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-12 21:13:36,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-12 21:13:36,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2018-10-12 21:13:36,701 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 14 states. [2018-10-12 21:13:37,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:37,578 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-12 21:13:37,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-12 21:13:37,580 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 105 [2018-10-12 21:13:37,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:37,582 INFO L225 Difference]: With dead ends: 160 [2018-10-12 21:13:37,583 INFO L226 Difference]: Without dead ends: 160 [2018-10-12 21:13:37,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2018-10-12 21:13:37,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-12 21:13:37,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 134. [2018-10-12 21:13:37,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-12 21:13:37,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-12 21:13:37,596 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 105 [2018-10-12 21:13:37,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:37,597 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-12 21:13:37,597 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-12 21:13:37,597 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-12 21:13:37,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-12 21:13:37,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:37,600 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, 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] [2018-10-12 21:13:37,600 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:37,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:37,601 INFO L82 PathProgramCache]: Analyzing trace with hash 1448761928, now seen corresponding path program 3 times [2018-10-12 21:13:37,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:38,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:38,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-12 21:13:38,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-12 21:13:38,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-12 21:13:38,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=164, Unknown=0, NotChecked=0, Total=210 [2018-10-12 21:13:38,099 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 15 states. [2018-10-12 21:13:39,340 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 27 [2018-10-12 21:13:39,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:39,410 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-12 21:13:39,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 21:13:39,411 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 133 [2018-10-12 21:13:39,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:39,413 INFO L225 Difference]: With dead ends: 188 [2018-10-12 21:13:39,413 INFO L226 Difference]: Without dead ends: 188 [2018-10-12 21:13:39,414 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=161, Invalid=439, Unknown=0, NotChecked=0, Total=600 [2018-10-12 21:13:39,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-12 21:13:39,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 162. [2018-10-12 21:13:39,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-12 21:13:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-12 21:13:39,426 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 133 [2018-10-12 21:13:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:39,427 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-12 21:13:39,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-12 21:13:39,427 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-12 21:13:39,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-12 21:13:39,430 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:39,430 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:39,430 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:39,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:39,431 INFO L82 PathProgramCache]: Analyzing trace with hash 1727521781, now seen corresponding path program 4 times [2018-10-12 21:13:39,432 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:39,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:39,945 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:39,946 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:39,946 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 21:13:39,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 21:13:39,947 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 21:13:39,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-10-12 21:13:39,947 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 16 states. [2018-10-12 21:13:40,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:40,888 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-12 21:13:40,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-12 21:13:40,888 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 161 [2018-10-12 21:13:40,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:40,890 INFO L225 Difference]: With dead ends: 216 [2018-10-12 21:13:40,891 INFO L226 Difference]: Without dead ends: 216 [2018-10-12 21:13:40,893 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=525, Unknown=0, NotChecked=0, Total=702 [2018-10-12 21:13:40,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-12 21:13:40,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 190. [2018-10-12 21:13:40,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-12 21:13:40,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-12 21:13:40,910 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 161 [2018-10-12 21:13:40,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:40,914 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-12 21:13:40,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 21:13:40,915 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-12 21:13:40,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-12 21:13:40,918 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:40,918 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:40,918 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:40,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:40,919 INFO L82 PathProgramCache]: Analyzing trace with hash 1180391458, now seen corresponding path program 5 times [2018-10-12 21:13:40,919 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:40,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:41,524 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-12 21:13:42,105 INFO L134 CoverageAnalysis]: Checked inductivity of 390 backedges. 0 proven. 390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:42,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:42,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-12 21:13:42,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-12 21:13:42,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-12 21:13:42,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=218, Unknown=0, NotChecked=0, Total=272 [2018-10-12 21:13:42,107 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 17 states. [2018-10-12 21:13:43,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:43,391 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-12 21:13:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-12 21:13:43,392 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 189 [2018-10-12 21:13:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:43,394 INFO L225 Difference]: With dead ends: 244 [2018-10-12 21:13:43,394 INFO L226 Difference]: Without dead ends: 244 [2018-10-12 21:13:43,396 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=193, Invalid=619, Unknown=0, NotChecked=0, Total=812 [2018-10-12 21:13:43,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-12 21:13:43,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 218. [2018-10-12 21:13:43,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-12 21:13:43,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-12 21:13:43,405 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 189 [2018-10-12 21:13:43,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:43,406 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-12 21:13:43,406 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-12 21:13:43,406 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-12 21:13:43,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-12 21:13:43,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:43,410 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:43,411 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:43,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:43,411 INFO L82 PathProgramCache]: Analyzing trace with hash 2043934415, now seen corresponding path program 6 times [2018-10-12 21:13:43,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:43,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:44,400 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:44,401 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:44,401 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 21:13:44,402 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 21:13:44,402 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 21:13:44,402 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=248, Unknown=0, NotChecked=0, Total=306 [2018-10-12 21:13:44,403 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 18 states. [2018-10-12 21:13:45,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:45,563 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-12 21:13:45,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-12 21:13:45,564 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 217 [2018-10-12 21:13:45,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:45,565 INFO L225 Difference]: With dead ends: 272 [2018-10-12 21:13:45,566 INFO L226 Difference]: Without dead ends: 272 [2018-10-12 21:13:45,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2018-10-12 21:13:45,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-12 21:13:45,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 246. [2018-10-12 21:13:45,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-12 21:13:45,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-12 21:13:45,573 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 217 [2018-10-12 21:13:45,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:45,574 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-12 21:13:45,574 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 21:13:45,574 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-12 21:13:45,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-12 21:13:45,577 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:45,577 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:45,577 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:45,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:45,578 INFO L82 PathProgramCache]: Analyzing trace with hash -2091843588, now seen corresponding path program 7 times [2018-10-12 21:13:45,579 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 742 backedges. 0 proven. 742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:46,341 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:46,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-12 21:13:46,342 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-12 21:13:46,343 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-12 21:13:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=280, Unknown=0, NotChecked=0, Total=342 [2018-10-12 21:13:46,343 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 19 states. [2018-10-12 21:13:48,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:48,032 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-12 21:13:48,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-12 21:13:48,033 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 245 [2018-10-12 21:13:48,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:48,035 INFO L225 Difference]: With dead ends: 300 [2018-10-12 21:13:48,035 INFO L226 Difference]: Without dead ends: 300 [2018-10-12 21:13:48,036 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=225, Invalid=831, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 21:13:48,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-12 21:13:48,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 274. [2018-10-12 21:13:48,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2018-10-12 21:13:48,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 274 transitions. [2018-10-12 21:13:48,042 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 274 transitions. Word has length 245 [2018-10-12 21:13:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:48,043 INFO L481 AbstractCegarLoop]: Abstraction has 274 states and 274 transitions. [2018-10-12 21:13:48,043 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-12 21:13:48,043 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 274 transitions. [2018-10-12 21:13:48,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2018-10-12 21:13:48,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:48,047 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:48,047 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:48,048 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:48,048 INFO L82 PathProgramCache]: Analyzing trace with hash -1318997079, now seen corresponding path program 8 times [2018-10-12 21:13:48,049 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:48,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:49,160 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 21:13:49,160 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 21:13:49,160 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 21:13:49,161 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2018-10-12 21:13:49,161 INFO L87 Difference]: Start difference. First operand 274 states and 274 transitions. Second operand 20 states. [2018-10-12 21:13:51,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:51,068 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-12 21:13:51,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-12 21:13:51,069 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 273 [2018-10-12 21:13:51,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:51,072 INFO L225 Difference]: With dead ends: 328 [2018-10-12 21:13:51,072 INFO L226 Difference]: Without dead ends: 328 [2018-10-12 21:13:51,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 159 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=241, Invalid=949, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 21:13:51,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2018-10-12 21:13:51,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 302. [2018-10-12 21:13:51,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-12 21:13:51,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-12 21:13:51,085 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 273 [2018-10-12 21:13:51,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:51,086 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-12 21:13:51,086 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 21:13:51,086 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-12 21:13:51,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-12 21:13:51,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:51,090 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:51,090 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:51,090 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:51,090 INFO L82 PathProgramCache]: Analyzing trace with hash -281718314, now seen corresponding path program 9 times [2018-10-12 21:13:51,091 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:51,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:52,493 INFO L134 CoverageAnalysis]: Checked inductivity of 1206 backedges. 0 proven. 1206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:52,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:52,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-12 21:13:52,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-12 21:13:52,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-12 21:13:52,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=350, Unknown=0, NotChecked=0, Total=420 [2018-10-12 21:13:52,495 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 21 states. [2018-10-12 21:13:54,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:54,645 INFO L93 Difference]: Finished difference Result 356 states and 356 transitions. [2018-10-12 21:13:54,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 21:13:54,646 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 301 [2018-10-12 21:13:54,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:54,648 INFO L225 Difference]: With dead ends: 356 [2018-10-12 21:13:54,648 INFO L226 Difference]: Without dead ends: 356 [2018-10-12 21:13:54,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 179 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=257, Invalid=1075, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 21:13:54,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2018-10-12 21:13:54,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 330. [2018-10-12 21:13:54,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 330 states. [2018-10-12 21:13:54,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 330 states to 330 states and 330 transitions. [2018-10-12 21:13:54,655 INFO L78 Accepts]: Start accepts. Automaton has 330 states and 330 transitions. Word has length 301 [2018-10-12 21:13:54,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:54,656 INFO L481 AbstractCegarLoop]: Abstraction has 330 states and 330 transitions. [2018-10-12 21:13:54,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-12 21:13:54,656 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 330 transitions. [2018-10-12 21:13:54,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2018-10-12 21:13:54,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:54,658 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:54,659 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:54,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:54,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1801774461, now seen corresponding path program 10 times [2018-10-12 21:13:54,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:54,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:55,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1480 backedges. 0 proven. 1480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:55,703 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:55,703 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 21:13:55,703 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 21:13:55,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 21:13:55,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2018-10-12 21:13:55,704 INFO L87 Difference]: Start difference. First operand 330 states and 330 transitions. Second operand 22 states. [2018-10-12 21:13:57,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:13:57,924 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-12 21:13:57,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-12 21:13:57,925 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 329 [2018-10-12 21:13:57,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:13:57,927 INFO L225 Difference]: With dead ends: 384 [2018-10-12 21:13:57,927 INFO L226 Difference]: Without dead ends: 384 [2018-10-12 21:13:57,928 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=273, Invalid=1209, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 21:13:57,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 384 states. [2018-10-12 21:13:57,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 384 to 358. [2018-10-12 21:13:57,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 358 states. [2018-10-12 21:13:57,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 358 transitions. [2018-10-12 21:13:57,934 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 358 transitions. Word has length 329 [2018-10-12 21:13:57,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:13:57,935 INFO L481 AbstractCegarLoop]: Abstraction has 358 states and 358 transitions. [2018-10-12 21:13:57,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 21:13:57,935 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 358 transitions. [2018-10-12 21:13:57,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2018-10-12 21:13:57,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:13:57,937 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:13:57,937 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:13:57,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:13:57,938 INFO L82 PathProgramCache]: Analyzing trace with hash 906120624, now seen corresponding path program 11 times [2018-10-12 21:13:57,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:13:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:13:59,092 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:13:59,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:13:59,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-12 21:13:59,093 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-12 21:13:59,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-12 21:13:59,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=428, Unknown=0, NotChecked=0, Total=506 [2018-10-12 21:13:59,094 INFO L87 Difference]: Start difference. First operand 358 states and 358 transitions. Second operand 23 states. [2018-10-12 21:14:01,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:01,441 INFO L93 Difference]: Finished difference Result 412 states and 412 transitions. [2018-10-12 21:14:01,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-12 21:14:01,442 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 357 [2018-10-12 21:14:01,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:01,444 INFO L225 Difference]: With dead ends: 412 [2018-10-12 21:14:01,444 INFO L226 Difference]: Without dead ends: 412 [2018-10-12 21:14:01,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 222 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=289, Invalid=1351, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 21:14:01,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2018-10-12 21:14:01,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 386. [2018-10-12 21:14:01,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-12 21:14:01,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-12 21:14:01,452 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 357 [2018-10-12 21:14:01,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:01,453 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-12 21:14:01,453 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-12 21:14:01,453 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-12 21:14:01,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-12 21:14:01,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:01,455 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:01,455 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:01,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:01,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1954163549, now seen corresponding path program 12 times [2018-10-12 21:14:01,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:01,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:02,760 INFO L134 CoverageAnalysis]: Checked inductivity of 2112 backedges. 0 proven. 2112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:02,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:02,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 21:14:02,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 21:14:02,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 21:14:02,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=470, Unknown=0, NotChecked=0, Total=552 [2018-10-12 21:14:02,762 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 24 states. [2018-10-12 21:14:05,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:05,494 INFO L93 Difference]: Finished difference Result 440 states and 440 transitions. [2018-10-12 21:14:05,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 21:14:05,495 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 385 [2018-10-12 21:14:05,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:05,498 INFO L225 Difference]: With dead ends: 440 [2018-10-12 21:14:05,498 INFO L226 Difference]: Without dead ends: 440 [2018-10-12 21:14:05,499 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 21:14:05,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-12 21:14:05,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 414. [2018-10-12 21:14:05,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 414 states. [2018-10-12 21:14:05,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 414 transitions. [2018-10-12 21:14:05,507 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 414 transitions. Word has length 385 [2018-10-12 21:14:05,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:05,507 INFO L481 AbstractCegarLoop]: Abstraction has 414 states and 414 transitions. [2018-10-12 21:14:05,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 21:14:05,508 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 414 transitions. [2018-10-12 21:14:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2018-10-12 21:14:05,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:05,510 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:05,510 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:05,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -843975798, now seen corresponding path program 13 times [2018-10-12 21:14:05,512 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:05,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:06,738 WARN L178 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 21:14:07,045 WARN L178 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-12 21:14:07,488 WARN L178 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2018-10-12 21:14:07,822 WARN L178 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-12 21:14:09,034 INFO L134 CoverageAnalysis]: Checked inductivity of 2470 backedges. 0 proven. 2470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:09,035 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:09,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-12 21:14:09,036 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-12 21:14:09,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-12 21:14:09,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=514, Unknown=0, NotChecked=0, Total=600 [2018-10-12 21:14:09,037 INFO L87 Difference]: Start difference. First operand 414 states and 414 transitions. Second operand 25 states. [2018-10-12 21:14:12,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:12,137 INFO L93 Difference]: Finished difference Result 468 states and 468 transitions. [2018-10-12 21:14:12,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-12 21:14:12,137 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 413 [2018-10-12 21:14:12,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:12,140 INFO L225 Difference]: With dead ends: 468 [2018-10-12 21:14:12,140 INFO L226 Difference]: Without dead ends: 468 [2018-10-12 21:14:12,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 269 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=321, Invalid=1659, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 21:14:12,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-12 21:14:12,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 442. [2018-10-12 21:14:12,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 442 states. [2018-10-12 21:14:12,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 442 transitions. [2018-10-12 21:14:12,149 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 442 transitions. Word has length 413 [2018-10-12 21:14:12,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:12,149 INFO L481 AbstractCegarLoop]: Abstraction has 442 states and 442 transitions. [2018-10-12 21:14:12,150 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-12 21:14:12,150 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 442 transitions. [2018-10-12 21:14:12,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2018-10-12 21:14:12,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:12,153 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:12,153 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1811473975, now seen corresponding path program 14 times [2018-10-12 21:14:12,154 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:14,369 INFO L134 CoverageAnalysis]: Checked inductivity of 2856 backedges. 0 proven. 2856 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:14,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:14,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 21:14:14,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 21:14:14,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 21:14:14,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2018-10-12 21:14:14,371 INFO L87 Difference]: Start difference. First operand 442 states and 442 transitions. Second operand 26 states. [2018-10-12 21:14:17,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:17,655 INFO L93 Difference]: Finished difference Result 496 states and 496 transitions. [2018-10-12 21:14:17,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-12 21:14:17,656 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 441 [2018-10-12 21:14:17,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:17,659 INFO L225 Difference]: With dead ends: 496 [2018-10-12 21:14:17,659 INFO L226 Difference]: Without dead ends: 496 [2018-10-12 21:14:17,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=337, Invalid=1825, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 21:14:17,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2018-10-12 21:14:17,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 470. [2018-10-12 21:14:17,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-12 21:14:17,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-12 21:14:17,668 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 441 [2018-10-12 21:14:17,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:17,668 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-12 21:14:17,669 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 21:14:17,669 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-12 21:14:17,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-12 21:14:17,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:17,672 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:17,672 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:17,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:17,672 INFO L82 PathProgramCache]: Analyzing trace with hash -163691676, now seen corresponding path program 15 times [2018-10-12 21:14:17,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:17,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:19,008 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 21:14:20,325 INFO L134 CoverageAnalysis]: Checked inductivity of 3270 backedges. 0 proven. 3270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:20,326 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:20,326 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-12 21:14:20,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-12 21:14:20,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-12 21:14:20,327 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=608, Unknown=0, NotChecked=0, Total=702 [2018-10-12 21:14:20,328 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 27 states. [2018-10-12 21:14:24,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:24,070 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-12 21:14:24,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 21:14:24,070 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 469 [2018-10-12 21:14:24,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:24,073 INFO L225 Difference]: With dead ends: 524 [2018-10-12 21:14:24,074 INFO L226 Difference]: Without dead ends: 524 [2018-10-12 21:14:24,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=353, Invalid=1999, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 21:14:24,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 524 states. [2018-10-12 21:14:24,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 524 to 498. [2018-10-12 21:14:24,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 498 states. [2018-10-12 21:14:24,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 498 transitions. [2018-10-12 21:14:24,082 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 498 transitions. Word has length 469 [2018-10-12 21:14:24,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:24,083 INFO L481 AbstractCegarLoop]: Abstraction has 498 states and 498 transitions. [2018-10-12 21:14:24,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-12 21:14:24,083 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 498 transitions. [2018-10-12 21:14:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 498 [2018-10-12 21:14:24,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:24,086 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:24,087 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:24,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:24,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1611746065, now seen corresponding path program 16 times [2018-10-12 21:14:24,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:24,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:26,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3712 backedges. 0 proven. 3712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:26,671 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:26,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 21:14:26,672 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 21:14:26,672 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 21:14:26,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=658, Unknown=0, NotChecked=0, Total=756 [2018-10-12 21:14:26,672 INFO L87 Difference]: Start difference. First operand 498 states and 498 transitions. Second operand 28 states. [2018-10-12 21:14:31,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:31,132 INFO L93 Difference]: Finished difference Result 552 states and 552 transitions. [2018-10-12 21:14:31,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-12 21:14:31,132 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 497 [2018-10-12 21:14:31,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:31,135 INFO L225 Difference]: With dead ends: 552 [2018-10-12 21:14:31,135 INFO L226 Difference]: Without dead ends: 552 [2018-10-12 21:14:31,136 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=369, Invalid=2181, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 21:14:31,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2018-10-12 21:14:31,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 526. [2018-10-12 21:14:31,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 526 states. [2018-10-12 21:14:31,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 526 transitions. [2018-10-12 21:14:31,144 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 526 transitions. Word has length 497 [2018-10-12 21:14:31,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:31,145 INFO L481 AbstractCegarLoop]: Abstraction has 526 states and 526 transitions. [2018-10-12 21:14:31,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 21:14:31,145 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 526 transitions. [2018-10-12 21:14:31,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2018-10-12 21:14:31,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:31,149 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:31,149 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:31,149 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:31,149 INFO L82 PathProgramCache]: Analyzing trace with hash -1180615362, now seen corresponding path program 17 times [2018-10-12 21:14:31,150 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:32,435 WARN L178 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 21:14:32,742 WARN L178 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-12 21:14:34,878 INFO L134 CoverageAnalysis]: Checked inductivity of 4182 backedges. 0 proven. 4182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:34,879 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:34,879 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-12 21:14:34,879 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-12 21:14:34,880 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-12 21:14:34,880 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2018-10-12 21:14:34,880 INFO L87 Difference]: Start difference. First operand 526 states and 526 transitions. Second operand 29 states. [2018-10-12 21:14:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:39,308 INFO L93 Difference]: Finished difference Result 580 states and 580 transitions. [2018-10-12 21:14:39,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-12 21:14:39,309 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 525 [2018-10-12 21:14:39,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:39,313 INFO L225 Difference]: With dead ends: 580 [2018-10-12 21:14:39,313 INFO L226 Difference]: Without dead ends: 580 [2018-10-12 21:14:39,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 375 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=385, Invalid=2371, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 21:14:39,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-10-12 21:14:39,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 554. [2018-10-12 21:14:39,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 554 states. [2018-10-12 21:14:39,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 554 states and 554 transitions. [2018-10-12 21:14:39,322 INFO L78 Accepts]: Start accepts. Automaton has 554 states and 554 transitions. Word has length 525 [2018-10-12 21:14:39,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:39,323 INFO L481 AbstractCegarLoop]: Abstraction has 554 states and 554 transitions. [2018-10-12 21:14:39,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-12 21:14:39,323 INFO L276 IsEmpty]: Start isEmpty. Operand 554 states and 554 transitions. [2018-10-12 21:14:39,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 554 [2018-10-12 21:14:39,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:39,327 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:39,327 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:39,327 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:39,328 INFO L82 PathProgramCache]: Analyzing trace with hash -4367893, now seen corresponding path program 18 times [2018-10-12 21:14:39,328 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:41,819 INFO L134 CoverageAnalysis]: Checked inductivity of 4680 backedges. 0 proven. 4680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:41,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:41,820 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 21:14:41,820 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 21:14:41,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 21:14:41,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=764, Unknown=0, NotChecked=0, Total=870 [2018-10-12 21:14:41,821 INFO L87 Difference]: Start difference. First operand 554 states and 554 transitions. Second operand 30 states. [2018-10-12 21:14:46,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:46,650 INFO L93 Difference]: Finished difference Result 608 states and 608 transitions. [2018-10-12 21:14:46,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 21:14:46,650 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 553 [2018-10-12 21:14:46,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:46,653 INFO L225 Difference]: With dead ends: 608 [2018-10-12 21:14:46,653 INFO L226 Difference]: Without dead ends: 608 [2018-10-12 21:14:46,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=401, Invalid=2569, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 21:14:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 608 states. [2018-10-12 21:14:46,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 608 to 582. [2018-10-12 21:14:46,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2018-10-12 21:14:46,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 582 transitions. [2018-10-12 21:14:46,662 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 582 transitions. Word has length 553 [2018-10-12 21:14:46,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:46,663 INFO L481 AbstractCegarLoop]: Abstraction has 582 states and 582 transitions. [2018-10-12 21:14:46,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 21:14:46,663 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 582 transitions. [2018-10-12 21:14:46,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 582 [2018-10-12 21:14:46,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:46,667 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:46,667 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:46,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:46,668 INFO L82 PathProgramCache]: Analyzing trace with hash -338370280, now seen corresponding path program 19 times [2018-10-12 21:14:46,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:46,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:49,775 INFO L134 CoverageAnalysis]: Checked inductivity of 5206 backedges. 0 proven. 5206 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:49,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:49,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-12 21:14:49,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-12 21:14:49,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-12 21:14:49,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=820, Unknown=0, NotChecked=0, Total=930 [2018-10-12 21:14:49,776 INFO L87 Difference]: Start difference. First operand 582 states and 582 transitions. Second operand 31 states. [2018-10-12 21:14:54,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:14:54,919 INFO L93 Difference]: Finished difference Result 636 states and 636 transitions. [2018-10-12 21:14:54,919 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-12 21:14:54,919 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 581 [2018-10-12 21:14:54,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:14:54,922 INFO L225 Difference]: With dead ends: 636 [2018-10-12 21:14:54,922 INFO L226 Difference]: Without dead ends: 636 [2018-10-12 21:14:54,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 434 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=417, Invalid=2775, Unknown=0, NotChecked=0, Total=3192 [2018-10-12 21:14:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2018-10-12 21:14:54,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 610. [2018-10-12 21:14:54,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 610 states. [2018-10-12 21:14:54,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 610 transitions. [2018-10-12 21:14:54,931 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 610 transitions. Word has length 581 [2018-10-12 21:14:54,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:14:54,932 INFO L481 AbstractCegarLoop]: Abstraction has 610 states and 610 transitions. [2018-10-12 21:14:54,932 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-12 21:14:54,932 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 610 transitions. [2018-10-12 21:14:54,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2018-10-12 21:14:54,936 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:14:54,936 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:14:54,937 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:14:54,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:14:54,937 INFO L82 PathProgramCache]: Analyzing trace with hash -1007217979, now seen corresponding path program 20 times [2018-10-12 21:14:54,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:14:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:14:57,508 INFO L134 CoverageAnalysis]: Checked inductivity of 5760 backedges. 0 proven. 5760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:14:57,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:14:57,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 21:14:57,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 21:14:57,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 21:14:57,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=114, Invalid=878, Unknown=0, NotChecked=0, Total=992 [2018-10-12 21:14:57,510 INFO L87 Difference]: Start difference. First operand 610 states and 610 transitions. Second operand 32 states. [2018-10-12 21:15:03,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:03,126 INFO L93 Difference]: Finished difference Result 664 states and 664 transitions. [2018-10-12 21:15:03,127 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-12 21:15:03,127 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 609 [2018-10-12 21:15:03,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:03,130 INFO L225 Difference]: With dead ends: 664 [2018-10-12 21:15:03,130 INFO L226 Difference]: Without dead ends: 664 [2018-10-12 21:15:03,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=433, Invalid=2989, Unknown=0, NotChecked=0, Total=3422 [2018-10-12 21:15:03,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2018-10-12 21:15:03,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 638. [2018-10-12 21:15:03,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 638 states. [2018-10-12 21:15:03,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 638 transitions. [2018-10-12 21:15:03,140 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 638 transitions. Word has length 609 [2018-10-12 21:15:03,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:03,141 INFO L481 AbstractCegarLoop]: Abstraction has 638 states and 638 transitions. [2018-10-12 21:15:03,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 21:15:03,141 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 638 transitions. [2018-10-12 21:15:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2018-10-12 21:15:03,145 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:03,145 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:03,146 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:03,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:03,146 INFO L82 PathProgramCache]: Analyzing trace with hash 718483186, now seen corresponding path program 21 times [2018-10-12 21:15:03,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:03,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:06,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6342 backedges. 0 proven. 6342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:06,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:06,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-12 21:15:06,064 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-12 21:15:06,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-12 21:15:06,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=118, Invalid=938, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 21:15:06,064 INFO L87 Difference]: Start difference. First operand 638 states and 638 transitions. Second operand 33 states. [2018-10-12 21:15:12,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:12,464 INFO L93 Difference]: Finished difference Result 692 states and 692 transitions. [2018-10-12 21:15:12,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 21:15:12,466 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 637 [2018-10-12 21:15:12,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:12,470 INFO L225 Difference]: With dead ends: 692 [2018-10-12 21:15:12,470 INFO L226 Difference]: Without dead ends: 692 [2018-10-12 21:15:12,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 497 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=449, Invalid=3211, Unknown=0, NotChecked=0, Total=3660 [2018-10-12 21:15:12,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 692 states. [2018-10-12 21:15:12,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 692 to 666. [2018-10-12 21:15:12,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 666 states. [2018-10-12 21:15:12,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 666 transitions. [2018-10-12 21:15:12,479 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 666 transitions. Word has length 637 [2018-10-12 21:15:12,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:12,480 INFO L481 AbstractCegarLoop]: Abstraction has 666 states and 666 transitions. [2018-10-12 21:15:12,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-12 21:15:12,480 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 666 transitions. [2018-10-12 21:15:12,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 666 [2018-10-12 21:15:12,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:12,485 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:12,485 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:12,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:12,485 INFO L82 PathProgramCache]: Analyzing trace with hash -273123937, now seen corresponding path program 22 times [2018-10-12 21:15:12,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:12,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:15,234 INFO L134 CoverageAnalysis]: Checked inductivity of 6952 backedges. 0 proven. 6952 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:15,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:15,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 21:15:15,236 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 21:15:15,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 21:15:15,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=1000, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 21:15:15,236 INFO L87 Difference]: Start difference. First operand 666 states and 666 transitions. Second operand 34 states. [2018-10-12 21:15:21,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:21,975 INFO L93 Difference]: Finished difference Result 720 states and 720 transitions. [2018-10-12 21:15:21,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-12 21:15:21,976 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 665 [2018-10-12 21:15:21,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:21,979 INFO L225 Difference]: With dead ends: 720 [2018-10-12 21:15:21,979 INFO L226 Difference]: Without dead ends: 720 [2018-10-12 21:15:21,980 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 530 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=465, Invalid=3441, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 21:15:21,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-12 21:15:21,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 694. [2018-10-12 21:15:21,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 694 states. [2018-10-12 21:15:21,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 694 transitions. [2018-10-12 21:15:21,988 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 694 transitions. Word has length 665 [2018-10-12 21:15:21,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:21,989 INFO L481 AbstractCegarLoop]: Abstraction has 694 states and 694 transitions. [2018-10-12 21:15:21,989 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 21:15:21,989 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 694 transitions. [2018-10-12 21:15:21,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 694 [2018-10-12 21:15:21,993 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:21,994 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:21,994 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:21,994 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:21,995 INFO L82 PathProgramCache]: Analyzing trace with hash -560585012, now seen corresponding path program 23 times [2018-10-12 21:15:21,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:22,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:25,324 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:25,324 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:25,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-12 21:15:25,325 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-12 21:15:25,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-12 21:15:25,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1064, Unknown=0, NotChecked=0, Total=1190 [2018-10-12 21:15:25,326 INFO L87 Difference]: Start difference. First operand 694 states and 694 transitions. Second operand 35 states. [2018-10-12 21:15:32,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:32,546 INFO L93 Difference]: Finished difference Result 748 states and 748 transitions. [2018-10-12 21:15:32,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-12 21:15:32,553 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 693 [2018-10-12 21:15:32,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:32,556 INFO L225 Difference]: With dead ends: 748 [2018-10-12 21:15:32,556 INFO L226 Difference]: Without dead ends: 748 [2018-10-12 21:15:32,558 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 564 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=481, Invalid=3679, Unknown=0, NotChecked=0, Total=4160 [2018-10-12 21:15:32,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 748 states. [2018-10-12 21:15:32,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 748 to 722. [2018-10-12 21:15:32,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 722 states. [2018-10-12 21:15:32,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 722 states to 722 states and 722 transitions. [2018-10-12 21:15:32,566 INFO L78 Accepts]: Start accepts. Automaton has 722 states and 722 transitions. Word has length 693 [2018-10-12 21:15:32,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:32,567 INFO L481 AbstractCegarLoop]: Abstraction has 722 states and 722 transitions. [2018-10-12 21:15:32,567 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-12 21:15:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 722 states and 722 transitions. [2018-10-12 21:15:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2018-10-12 21:15:32,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:32,572 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:32,573 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:32,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1879342471, now seen corresponding path program 24 times [2018-10-12 21:15:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:32,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:33,892 WARN L178 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2018-10-12 21:15:34,132 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 18 [2018-10-12 21:15:37,040 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:37,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:37,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 21:15:37,041 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 21:15:37,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 21:15:37,041 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=1130, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 21:15:37,041 INFO L87 Difference]: Start difference. First operand 722 states and 722 transitions. Second operand 36 states. [2018-10-12 21:15:44,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:44,638 INFO L93 Difference]: Finished difference Result 776 states and 776 transitions. [2018-10-12 21:15:44,639 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 21:15:44,639 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 721 [2018-10-12 21:15:44,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:44,642 INFO L225 Difference]: With dead ends: 776 [2018-10-12 21:15:44,642 INFO L226 Difference]: Without dead ends: 776 [2018-10-12 21:15:44,643 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 599 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=497, Invalid=3925, Unknown=0, NotChecked=0, Total=4422 [2018-10-12 21:15:44,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 776 states. [2018-10-12 21:15:44,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 776 to 750. [2018-10-12 21:15:44,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 750 states. [2018-10-12 21:15:44,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 750 states and 750 transitions. [2018-10-12 21:15:44,652 INFO L78 Accepts]: Start accepts. Automaton has 750 states and 750 transitions. Word has length 721 [2018-10-12 21:15:44,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:44,652 INFO L481 AbstractCegarLoop]: Abstraction has 750 states and 750 transitions. [2018-10-12 21:15:44,653 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 21:15:44,653 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 750 transitions. [2018-10-12 21:15:44,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2018-10-12 21:15:44,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:44,659 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:44,659 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:44,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:44,659 INFO L82 PathProgramCache]: Analyzing trace with hash 957860006, now seen corresponding path program 25 times [2018-10-12 21:15:44,660 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:44,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:15:48,818 INFO L134 CoverageAnalysis]: Checked inductivity of 8950 backedges. 0 proven. 8950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:15:48,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:15:48,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-12 21:15:48,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-12 21:15:48,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-12 21:15:48,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=1198, Unknown=0, NotChecked=0, Total=1332 [2018-10-12 21:15:48,820 INFO L87 Difference]: Start difference. First operand 750 states and 750 transitions. Second operand 37 states. [2018-10-12 21:15:57,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:15:57,103 INFO L93 Difference]: Finished difference Result 804 states and 804 transitions. [2018-10-12 21:15:57,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-12 21:15:57,103 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 749 [2018-10-12 21:15:57,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:15:57,106 INFO L225 Difference]: With dead ends: 804 [2018-10-12 21:15:57,106 INFO L226 Difference]: Without dead ends: 804 [2018-10-12 21:15:57,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 635 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=513, Invalid=4179, Unknown=0, NotChecked=0, Total=4692 [2018-10-12 21:15:57,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 804 states. [2018-10-12 21:15:57,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 804 to 778. [2018-10-12 21:15:57,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 778 states. [2018-10-12 21:15:57,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 778 transitions. [2018-10-12 21:15:57,114 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 778 transitions. Word has length 749 [2018-10-12 21:15:57,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:15:57,115 INFO L481 AbstractCegarLoop]: Abstraction has 778 states and 778 transitions. [2018-10-12 21:15:57,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-12 21:15:57,115 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 778 transitions. [2018-10-12 21:15:57,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2018-10-12 21:15:57,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:15:57,121 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:15:57,121 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:15:57,121 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:15:57,122 INFO L82 PathProgramCache]: Analyzing trace with hash 2075801939, now seen corresponding path program 26 times [2018-10-12 21:15:57,122 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:15:57,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:00,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9672 backedges. 0 proven. 9672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:00,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:00,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 21:16:00,908 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 21:16:00,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 21:16:00,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1268, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 21:16:00,909 INFO L87 Difference]: Start difference. First operand 778 states and 778 transitions. Second operand 38 states. [2018-10-12 21:16:09,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:09,644 INFO L93 Difference]: Finished difference Result 832 states and 832 transitions. [2018-10-12 21:16:09,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-12 21:16:09,645 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 777 [2018-10-12 21:16:09,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:09,647 INFO L225 Difference]: With dead ends: 832 [2018-10-12 21:16:09,647 INFO L226 Difference]: Without dead ends: 832 [2018-10-12 21:16:09,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 672 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=529, Invalid=4441, Unknown=0, NotChecked=0, Total=4970 [2018-10-12 21:16:09,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2018-10-12 21:16:09,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 806. [2018-10-12 21:16:09,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 806 states. [2018-10-12 21:16:09,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 806 states to 806 states and 806 transitions. [2018-10-12 21:16:09,655 INFO L78 Accepts]: Start accepts. Automaton has 806 states and 806 transitions. Word has length 777 [2018-10-12 21:16:09,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:09,656 INFO L481 AbstractCegarLoop]: Abstraction has 806 states and 806 transitions. [2018-10-12 21:16:09,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 21:16:09,656 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 806 transitions. [2018-10-12 21:16:09,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 806 [2018-10-12 21:16:09,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:09,663 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:09,663 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:09,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:09,663 INFO L82 PathProgramCache]: Analyzing trace with hash 911348864, now seen corresponding path program 27 times [2018-10-12 21:16:09,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:09,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:14,009 INFO L134 CoverageAnalysis]: Checked inductivity of 10422 backedges. 0 proven. 10422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:14,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:14,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-12 21:16:14,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-12 21:16:14,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-12 21:16:14,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=1340, Unknown=0, NotChecked=0, Total=1482 [2018-10-12 21:16:14,011 INFO L87 Difference]: Start difference. First operand 806 states and 806 transitions. Second operand 39 states. [2018-10-12 21:16:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:23,419 INFO L93 Difference]: Finished difference Result 860 states and 860 transitions. [2018-10-12 21:16:23,419 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 21:16:23,419 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 805 [2018-10-12 21:16:23,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:23,422 INFO L225 Difference]: With dead ends: 860 [2018-10-12 21:16:23,422 INFO L226 Difference]: Without dead ends: 860 [2018-10-12 21:16:23,422 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 710 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=545, Invalid=4711, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 21:16:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 860 states. [2018-10-12 21:16:23,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 860 to 834. [2018-10-12 21:16:23,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 834 states. [2018-10-12 21:16:23,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 834 states to 834 states and 834 transitions. [2018-10-12 21:16:23,429 INFO L78 Accepts]: Start accepts. Automaton has 834 states and 834 transitions. Word has length 805 [2018-10-12 21:16:23,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:23,429 INFO L481 AbstractCegarLoop]: Abstraction has 834 states and 834 transitions. [2018-10-12 21:16:23,429 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-12 21:16:23,429 INFO L276 IsEmpty]: Start isEmpty. Operand 834 states and 834 transitions. [2018-10-12 21:16:23,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 834 [2018-10-12 21:16:23,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:23,436 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:23,437 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:23,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:23,437 INFO L82 PathProgramCache]: Analyzing trace with hash 1408145965, now seen corresponding path program 28 times [2018-10-12 21:16:23,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:23,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:27,450 INFO L134 CoverageAnalysis]: Checked inductivity of 11200 backedges. 0 proven. 11200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:27,450 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:27,450 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 21:16:27,451 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 21:16:27,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 21:16:27,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1414, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 21:16:27,451 INFO L87 Difference]: Start difference. First operand 834 states and 834 transitions. Second operand 40 states. [2018-10-12 21:16:37,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:37,368 INFO L93 Difference]: Finished difference Result 888 states and 888 transitions. [2018-10-12 21:16:37,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-12 21:16:37,369 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 833 [2018-10-12 21:16:37,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:37,372 INFO L225 Difference]: With dead ends: 888 [2018-10-12 21:16:37,372 INFO L226 Difference]: Without dead ends: 888 [2018-10-12 21:16:37,372 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=561, Invalid=4989, Unknown=0, NotChecked=0, Total=5550 [2018-10-12 21:16:37,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 888 states. [2018-10-12 21:16:37,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 888 to 862. [2018-10-12 21:16:37,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 862 states. [2018-10-12 21:16:37,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 862 states to 862 states and 862 transitions. [2018-10-12 21:16:37,380 INFO L78 Accepts]: Start accepts. Automaton has 862 states and 862 transitions. Word has length 833 [2018-10-12 21:16:37,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:37,380 INFO L481 AbstractCegarLoop]: Abstraction has 862 states and 862 transitions. [2018-10-12 21:16:37,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 21:16:37,381 INFO L276 IsEmpty]: Start isEmpty. Operand 862 states and 862 transitions. [2018-10-12 21:16:37,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2018-10-12 21:16:37,387 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:37,388 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:37,388 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:37,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:37,389 INFO L82 PathProgramCache]: Analyzing trace with hash -1673590182, now seen corresponding path program 29 times [2018-10-12 21:16:37,389 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:41,935 INFO L134 CoverageAnalysis]: Checked inductivity of 12006 backedges. 0 proven. 12006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:41,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:41,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-12 21:16:41,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-12 21:16:41,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-12 21:16:41,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=1490, Unknown=0, NotChecked=0, Total=1640 [2018-10-12 21:16:41,937 INFO L87 Difference]: Start difference. First operand 862 states and 862 transitions. Second operand 41 states. [2018-10-12 21:16:52,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:16:52,553 INFO L93 Difference]: Finished difference Result 916 states and 916 transitions. [2018-10-12 21:16:52,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-12 21:16:52,553 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 861 [2018-10-12 21:16:52,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:16:52,556 INFO L225 Difference]: With dead ends: 916 [2018-10-12 21:16:52,556 INFO L226 Difference]: Without dead ends: 916 [2018-10-12 21:16:52,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 789 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=577, Invalid=5275, Unknown=0, NotChecked=0, Total=5852 [2018-10-12 21:16:52,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 916 states. [2018-10-12 21:16:52,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 916 to 890. [2018-10-12 21:16:52,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 890 states. [2018-10-12 21:16:52,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 890 transitions. [2018-10-12 21:16:52,564 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 890 transitions. Word has length 861 [2018-10-12 21:16:52,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:16:52,564 INFO L481 AbstractCegarLoop]: Abstraction has 890 states and 890 transitions. [2018-10-12 21:16:52,565 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-12 21:16:52,565 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 890 transitions. [2018-10-12 21:16:52,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 890 [2018-10-12 21:16:52,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:16:52,572 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:16:52,572 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:16:52,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:16:52,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2087541497, now seen corresponding path program 30 times [2018-10-12 21:16:52,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:16:52,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:16:57,109 INFO L134 CoverageAnalysis]: Checked inductivity of 12840 backedges. 0 proven. 12840 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:16:57,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:16:57,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 21:16:57,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 21:16:57,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 21:16:57,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1568, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 21:16:57,111 INFO L87 Difference]: Start difference. First operand 890 states and 890 transitions. Second operand 42 states. [2018-10-12 21:17:08,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:17:08,209 INFO L93 Difference]: Finished difference Result 944 states and 944 transitions. [2018-10-12 21:17:08,209 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 21:17:08,209 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 889 [2018-10-12 21:17:08,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:17:08,213 INFO L225 Difference]: With dead ends: 944 [2018-10-12 21:17:08,213 INFO L226 Difference]: Without dead ends: 944 [2018-10-12 21:17:08,214 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 830 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=593, Invalid=5569, Unknown=0, NotChecked=0, Total=6162 [2018-10-12 21:17:08,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 944 states. [2018-10-12 21:17:08,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 944 to 918. [2018-10-12 21:17:08,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 918 states. [2018-10-12 21:17:08,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 918 states to 918 states and 918 transitions. [2018-10-12 21:17:08,222 INFO L78 Accepts]: Start accepts. Automaton has 918 states and 918 transitions. Word has length 889 [2018-10-12 21:17:08,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:17:08,222 INFO L481 AbstractCegarLoop]: Abstraction has 918 states and 918 transitions. [2018-10-12 21:17:08,223 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 21:17:08,223 INFO L276 IsEmpty]: Start isEmpty. Operand 918 states and 918 transitions. [2018-10-12 21:17:08,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 918 [2018-10-12 21:17:08,228 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:17:08,228 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:17:08,229 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:17:08,229 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:17:08,230 INFO L82 PathProgramCache]: Analyzing trace with hash -86463948, now seen corresponding path program 31 times [2018-10-12 21:17:08,230 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:17:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:17:12,982 INFO L134 CoverageAnalysis]: Checked inductivity of 13702 backedges. 0 proven. 13702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:17:12,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:17:12,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-12 21:17:12,983 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-12 21:17:12,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-12 21:17:12,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=1648, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 21:17:12,984 INFO L87 Difference]: Start difference. First operand 918 states and 918 transitions. Second operand 43 states. [2018-10-12 21:17:24,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:17:24,517 INFO L93 Difference]: Finished difference Result 972 states and 972 transitions. [2018-10-12 21:17:24,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-12 21:17:24,517 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 917 [2018-10-12 21:17:24,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:17:24,521 INFO L225 Difference]: With dead ends: 972 [2018-10-12 21:17:24,521 INFO L226 Difference]: Without dead ends: 972 [2018-10-12 21:17:24,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 872 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=609, Invalid=5871, Unknown=0, NotChecked=0, Total=6480 [2018-10-12 21:17:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2018-10-12 21:17:24,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 946. [2018-10-12 21:17:24,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 946 states. [2018-10-12 21:17:24,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 946 states to 946 states and 946 transitions. [2018-10-12 21:17:24,531 INFO L78 Accepts]: Start accepts. Automaton has 946 states and 946 transitions. Word has length 917 [2018-10-12 21:17:24,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:17:24,532 INFO L481 AbstractCegarLoop]: Abstraction has 946 states and 946 transitions. [2018-10-12 21:17:24,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-12 21:17:24,532 INFO L276 IsEmpty]: Start isEmpty. Operand 946 states and 946 transitions. [2018-10-12 21:17:24,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 946 [2018-10-12 21:17:24,539 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:17:24,539 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:17:24,540 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:17:24,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:17:24,540 INFO L82 PathProgramCache]: Analyzing trace with hash 1067473377, now seen corresponding path program 32 times [2018-10-12 21:17:24,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:17:24,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:17:29,457 INFO L134 CoverageAnalysis]: Checked inductivity of 14592 backedges. 0 proven. 14592 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:17:29,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:17:29,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 21:17:29,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 21:17:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 21:17:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=162, Invalid=1730, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 21:17:29,460 INFO L87 Difference]: Start difference. First operand 946 states and 946 transitions. Second operand 44 states. [2018-10-12 21:17:41,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:17:41,635 INFO L93 Difference]: Finished difference Result 1000 states and 1000 transitions. [2018-10-12 21:17:41,635 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-12 21:17:41,635 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 945 [2018-10-12 21:17:41,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:17:41,638 INFO L225 Difference]: With dead ends: 1000 [2018-10-12 21:17:41,639 INFO L226 Difference]: Without dead ends: 1000 [2018-10-12 21:17:41,639 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=625, Invalid=6181, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 21:17:41,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1000 states. [2018-10-12 21:17:41,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1000 to 974. [2018-10-12 21:17:41,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 974 states. [2018-10-12 21:17:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 974 transitions. [2018-10-12 21:17:41,646 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 974 transitions. Word has length 945 [2018-10-12 21:17:41,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:17:41,647 INFO L481 AbstractCegarLoop]: Abstraction has 974 states and 974 transitions. [2018-10-12 21:17:41,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 21:17:41,647 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 974 transitions. [2018-10-12 21:17:41,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 974 [2018-10-12 21:17:41,655 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:17:41,655 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:17:41,655 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:17:41,656 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:17:41,656 INFO L82 PathProgramCache]: Analyzing trace with hash -1407650802, now seen corresponding path program 33 times [2018-10-12 21:17:41,656 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:17:41,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:17:46,958 INFO L134 CoverageAnalysis]: Checked inductivity of 15510 backedges. 0 proven. 15510 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:17:46,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:17:46,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-12 21:17:46,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-12 21:17:46,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-12 21:17:46,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=1814, Unknown=0, NotChecked=0, Total=1980 [2018-10-12 21:17:46,961 INFO L87 Difference]: Start difference. First operand 974 states and 974 transitions. Second operand 45 states. [2018-10-12 21:18:00,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:18:00,068 INFO L93 Difference]: Finished difference Result 1028 states and 1028 transitions. [2018-10-12 21:18:00,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 21:18:00,069 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 973 [2018-10-12 21:18:00,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:18:00,072 INFO L225 Difference]: With dead ends: 1028 [2018-10-12 21:18:00,072 INFO L226 Difference]: Without dead ends: 1028 [2018-10-12 21:18:00,072 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 959 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=641, Invalid=6499, Unknown=0, NotChecked=0, Total=7140 [2018-10-12 21:18:00,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1028 states. [2018-10-12 21:18:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1028 to 1002. [2018-10-12 21:18:00,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1002 states. [2018-10-12 21:18:00,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1002 states to 1002 states and 1002 transitions. [2018-10-12 21:18:00,079 INFO L78 Accepts]: Start accepts. Automaton has 1002 states and 1002 transitions. Word has length 973 [2018-10-12 21:18:00,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:18:00,080 INFO L481 AbstractCegarLoop]: Abstraction has 1002 states and 1002 transitions. [2018-10-12 21:18:00,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-12 21:18:00,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1002 states and 1002 transitions. [2018-10-12 21:18:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1002 [2018-10-12 21:18:00,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:18:00,086 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:18:00,086 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:18:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:18:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -2028881733, now seen corresponding path program 34 times [2018-10-12 21:18:00,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:18:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:18:05,575 INFO L134 CoverageAnalysis]: Checked inductivity of 16456 backedges. 0 proven. 16456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:18:05,575 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:18:05,576 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 21:18:05,576 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 21:18:05,576 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 21:18:05,576 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1900, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 21:18:05,577 INFO L87 Difference]: Start difference. First operand 1002 states and 1002 transitions. Second operand 46 states. [2018-10-12 21:18:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:18:19,149 INFO L93 Difference]: Finished difference Result 1056 states and 1056 transitions. [2018-10-12 21:18:19,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-12 21:18:19,149 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 1001 [2018-10-12 21:18:19,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:18:19,153 INFO L225 Difference]: With dead ends: 1056 [2018-10-12 21:18:19,153 INFO L226 Difference]: Without dead ends: 1056 [2018-10-12 21:18:19,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1004 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=657, Invalid=6825, Unknown=0, NotChecked=0, Total=7482 [2018-10-12 21:18:19,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2018-10-12 21:18:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 1030. [2018-10-12 21:18:19,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1030 states. [2018-10-12 21:18:19,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1030 states to 1030 states and 1030 transitions. [2018-10-12 21:18:19,161 INFO L78 Accepts]: Start accepts. Automaton has 1030 states and 1030 transitions. Word has length 1001 [2018-10-12 21:18:19,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:18:19,162 INFO L481 AbstractCegarLoop]: Abstraction has 1030 states and 1030 transitions. [2018-10-12 21:18:19,162 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 21:18:19,162 INFO L276 IsEmpty]: Start isEmpty. Operand 1030 states and 1030 transitions. [2018-10-12 21:18:19,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1030 [2018-10-12 21:18:19,168 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:18:19,169 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:18:19,169 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:18:19,169 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:18:19,169 INFO L82 PathProgramCache]: Analyzing trace with hash -738596888, now seen corresponding path program 35 times [2018-10-12 21:18:19,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:18:19,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:18:25,316 INFO L134 CoverageAnalysis]: Checked inductivity of 17430 backedges. 0 proven. 17430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:18:25,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:18:25,317 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-12 21:18:25,317 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-12 21:18:25,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-12 21:18:25,318 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=1988, Unknown=0, NotChecked=0, Total=2162 [2018-10-12 21:18:25,318 INFO L87 Difference]: Start difference. First operand 1030 states and 1030 transitions. Second operand 47 states. [2018-10-12 21:18:39,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:18:39,441 INFO L93 Difference]: Finished difference Result 1084 states and 1084 transitions. [2018-10-12 21:18:39,441 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-12 21:18:39,441 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 1029 [2018-10-12 21:18:39,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:18:39,445 INFO L225 Difference]: With dead ends: 1084 [2018-10-12 21:18:39,445 INFO L226 Difference]: Without dead ends: 1084 [2018-10-12 21:18:39,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1050 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=673, Invalid=7159, Unknown=0, NotChecked=0, Total=7832 [2018-10-12 21:18:39,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2018-10-12 21:18:39,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1058. [2018-10-12 21:18:39,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2018-10-12 21:18:39,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 1058 transitions. [2018-10-12 21:18:39,454 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 1058 transitions. Word has length 1029 [2018-10-12 21:18:39,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:18:39,454 INFO L481 AbstractCegarLoop]: Abstraction has 1058 states and 1058 transitions. [2018-10-12 21:18:39,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-12 21:18:39,454 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 1058 transitions. [2018-10-12 21:18:39,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1058 [2018-10-12 21:18:39,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:18:39,483 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:18:39,483 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:18:39,483 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:18:39,484 INFO L82 PathProgramCache]: Analyzing trace with hash 585154965, now seen corresponding path program 36 times [2018-10-12 21:18:39,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:18:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:18:45,525 INFO L134 CoverageAnalysis]: Checked inductivity of 18432 backedges. 0 proven. 18432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:18:45,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:18:45,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 21:18:45,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 21:18:45,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 21:18:45,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2078, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 21:18:45,527 INFO L87 Difference]: Start difference. First operand 1058 states and 1058 transitions. Second operand 48 states. [2018-10-12 21:19:00,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:19:00,494 INFO L93 Difference]: Finished difference Result 1112 states and 1112 transitions. [2018-10-12 21:19:00,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 21:19:00,494 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 1057 [2018-10-12 21:19:00,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:19:00,498 INFO L225 Difference]: With dead ends: 1112 [2018-10-12 21:19:00,498 INFO L226 Difference]: Without dead ends: 1112 [2018-10-12 21:19:00,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1097 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=689, Invalid=7501, Unknown=0, NotChecked=0, Total=8190 [2018-10-12 21:19:00,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1112 states. [2018-10-12 21:19:00,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1112 to 1086. [2018-10-12 21:19:00,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1086 states. [2018-10-12 21:19:00,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1086 transitions. [2018-10-12 21:19:00,506 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1086 transitions. Word has length 1057 [2018-10-12 21:19:00,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:19:00,507 INFO L481 AbstractCegarLoop]: Abstraction has 1086 states and 1086 transitions. [2018-10-12 21:19:00,507 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 21:19:00,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1086 transitions. [2018-10-12 21:19:00,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1086 [2018-10-12 21:19:00,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:19:00,515 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:19:00,515 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:19:00,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:19:00,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1618314690, now seen corresponding path program 37 times [2018-10-12 21:19:00,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:19:00,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:19:07,146 INFO L134 CoverageAnalysis]: Checked inductivity of 19462 backedges. 0 proven. 19462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:19:07,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:19:07,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-12 21:19:07,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-12 21:19:07,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-12 21:19:07,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=182, Invalid=2170, Unknown=0, NotChecked=0, Total=2352 [2018-10-12 21:19:07,148 INFO L87 Difference]: Start difference. First operand 1086 states and 1086 transitions. Second operand 49 states. [2018-10-12 21:19:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:19:22,789 INFO L93 Difference]: Finished difference Result 1140 states and 1140 transitions. [2018-10-12 21:19:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-12 21:19:22,790 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 1085 [2018-10-12 21:19:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:19:22,794 INFO L225 Difference]: With dead ends: 1140 [2018-10-12 21:19:22,794 INFO L226 Difference]: Without dead ends: 1140 [2018-10-12 21:19:22,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=705, Invalid=7851, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 21:19:22,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1140 states. [2018-10-12 21:19:22,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1140 to 1114. [2018-10-12 21:19:22,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1114 states. [2018-10-12 21:19:22,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1114 states to 1114 states and 1114 transitions. [2018-10-12 21:19:22,801 INFO L78 Accepts]: Start accepts. Automaton has 1114 states and 1114 transitions. Word has length 1085 [2018-10-12 21:19:22,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:19:22,801 INFO L481 AbstractCegarLoop]: Abstraction has 1114 states and 1114 transitions. [2018-10-12 21:19:22,802 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-12 21:19:22,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1114 states and 1114 transitions. [2018-10-12 21:19:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1114 [2018-10-12 21:19:22,811 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:19:22,811 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:19:22,811 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:19:22,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:19:22,812 INFO L82 PathProgramCache]: Analyzing trace with hash -1509460881, now seen corresponding path program 38 times [2018-10-12 21:19:22,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:19:22,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:19:29,345 INFO L134 CoverageAnalysis]: Checked inductivity of 20520 backedges. 0 proven. 20520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:19:29,346 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:19:29,346 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 21:19:29,346 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 21:19:29,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 21:19:29,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=2264, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 21:19:29,347 INFO L87 Difference]: Start difference. First operand 1114 states and 1114 transitions. Second operand 50 states. [2018-10-12 21:19:45,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:19:45,733 INFO L93 Difference]: Finished difference Result 1168 states and 1168 transitions. [2018-10-12 21:19:45,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-12 21:19:45,734 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 1113 [2018-10-12 21:19:45,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:19:45,738 INFO L225 Difference]: With dead ends: 1168 [2018-10-12 21:19:45,738 INFO L226 Difference]: Without dead ends: 1168 [2018-10-12 21:19:45,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1194 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=721, Invalid=8209, Unknown=0, NotChecked=0, Total=8930 [2018-10-12 21:19:45,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1168 states. [2018-10-12 21:19:45,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1168 to 1142. [2018-10-12 21:19:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1142 states. [2018-10-12 21:19:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1142 transitions. [2018-10-12 21:19:45,746 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1142 transitions. Word has length 1113 [2018-10-12 21:19:45,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:19:45,747 INFO L481 AbstractCegarLoop]: Abstraction has 1142 states and 1142 transitions. [2018-10-12 21:19:45,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 21:19:45,747 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1142 transitions. [2018-10-12 21:19:45,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1142 [2018-10-12 21:19:45,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:19:45,755 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:19:45,755 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:19:45,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:19:45,756 INFO L82 PathProgramCache]: Analyzing trace with hash 159763868, now seen corresponding path program 39 times [2018-10-12 21:19:45,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:19:45,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:19:52,779 INFO L134 CoverageAnalysis]: Checked inductivity of 21606 backedges. 0 proven. 21606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:19:52,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:19:52,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-12 21:19:52,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-12 21:19:52,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-12 21:19:52,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=2360, Unknown=0, NotChecked=0, Total=2550 [2018-10-12 21:19:52,780 INFO L87 Difference]: Start difference. First operand 1142 states and 1142 transitions. Second operand 51 states. [2018-10-12 21:20:09,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:20:09,892 INFO L93 Difference]: Finished difference Result 1196 states and 1196 transitions. [2018-10-12 21:20:09,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 21:20:09,893 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 1141 [2018-10-12 21:20:09,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:20:09,896 INFO L225 Difference]: With dead ends: 1196 [2018-10-12 21:20:09,896 INFO L226 Difference]: Without dead ends: 1196 [2018-10-12 21:20:09,897 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1244 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=737, Invalid=8575, Unknown=0, NotChecked=0, Total=9312 [2018-10-12 21:20:09,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1196 states. [2018-10-12 21:20:09,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1196 to 1170. [2018-10-12 21:20:09,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1170 states. [2018-10-12 21:20:09,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1170 states to 1170 states and 1170 transitions. [2018-10-12 21:20:09,905 INFO L78 Accepts]: Start accepts. Automaton has 1170 states and 1170 transitions. Word has length 1141 [2018-10-12 21:20:09,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:20:09,905 INFO L481 AbstractCegarLoop]: Abstraction has 1170 states and 1170 transitions. [2018-10-12 21:20:09,905 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-12 21:20:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 1170 states and 1170 transitions. [2018-10-12 21:20:09,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1170 [2018-10-12 21:20:09,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:20:09,914 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:20:09,914 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:20:09,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:20:09,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1837093193, now seen corresponding path program 40 times [2018-10-12 21:20:09,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:20:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:20:17,109 INFO L134 CoverageAnalysis]: Checked inductivity of 22720 backedges. 0 proven. 22720 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:20:17,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:20:17,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 21:20:17,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 21:20:17,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 21:20:17,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=2458, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 21:20:17,111 INFO L87 Difference]: Start difference. First operand 1170 states and 1170 transitions. Second operand 52 states. [2018-10-12 21:20:23,493 WARN L178 SmtUtils]: Spent 178.00 ms on a formula simplification that was a NOOP. DAG size: 26 [2018-10-12 21:20:35,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:20:35,447 INFO L93 Difference]: Finished difference Result 1224 states and 1224 transitions. [2018-10-12 21:20:35,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-12 21:20:35,449 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 1169 [2018-10-12 21:20:35,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:20:35,453 INFO L225 Difference]: With dead ends: 1224 [2018-10-12 21:20:35,453 INFO L226 Difference]: Without dead ends: 1224 [2018-10-12 21:20:35,454 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1295 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=753, Invalid=8949, Unknown=0, NotChecked=0, Total=9702 [2018-10-12 21:20:35,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1224 states. [2018-10-12 21:20:35,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1224 to 1198. [2018-10-12 21:20:35,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1198 states. [2018-10-12 21:20:35,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1198 states to 1198 states and 1198 transitions. [2018-10-12 21:20:35,462 INFO L78 Accepts]: Start accepts. Automaton has 1198 states and 1198 transitions. Word has length 1169 [2018-10-12 21:20:35,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:20:35,462 INFO L481 AbstractCegarLoop]: Abstraction has 1198 states and 1198 transitions. [2018-10-12 21:20:35,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 21:20:35,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1198 states and 1198 transitions. [2018-10-12 21:20:35,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1198 [2018-10-12 21:20:35,470 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:20:35,471 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:20:35,471 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:20:35,471 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:20:35,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1361362806, now seen corresponding path program 41 times [2018-10-12 21:20:35,472 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:20:35,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:20:43,004 INFO L134 CoverageAnalysis]: Checked inductivity of 23862 backedges. 0 proven. 23862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:20:43,004 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:20:43,004 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-12 21:20:43,005 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-12 21:20:43,005 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-12 21:20:43,005 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=2558, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 21:20:43,006 INFO L87 Difference]: Start difference. First operand 1198 states and 1198 transitions. Second operand 53 states. [2018-10-12 21:21:01,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:21:01,685 INFO L93 Difference]: Finished difference Result 1252 states and 1252 transitions. [2018-10-12 21:21:01,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-12 21:21:01,685 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 1197 [2018-10-12 21:21:01,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:21:01,689 INFO L225 Difference]: With dead ends: 1252 [2018-10-12 21:21:01,689 INFO L226 Difference]: Without dead ends: 1252 [2018-10-12 21:21:01,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1347 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=769, Invalid=9331, Unknown=0, NotChecked=0, Total=10100 [2018-10-12 21:21:01,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states. [2018-10-12 21:21:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1226. [2018-10-12 21:21:01,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1226 states. [2018-10-12 21:21:01,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1226 states to 1226 states and 1226 transitions. [2018-10-12 21:21:01,698 INFO L78 Accepts]: Start accepts. Automaton has 1226 states and 1226 transitions. Word has length 1197 [2018-10-12 21:21:01,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:21:01,699 INFO L481 AbstractCegarLoop]: Abstraction has 1226 states and 1226 transitions. [2018-10-12 21:21:01,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-12 21:21:01,699 INFO L276 IsEmpty]: Start isEmpty. Operand 1226 states and 1226 transitions. [2018-10-12 21:21:01,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1226 [2018-10-12 21:21:01,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:21:01,708 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:21:01,708 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:21:01,708 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:21:01,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1606166493, now seen corresponding path program 42 times [2018-10-12 21:21:01,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:21:01,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:21:09,627 INFO L134 CoverageAnalysis]: Checked inductivity of 25032 backedges. 0 proven. 25032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:21:09,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:21:09,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 21:21:09,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 21:21:09,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 21:21:09,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=202, Invalid=2660, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 21:21:09,629 INFO L87 Difference]: Start difference. First operand 1226 states and 1226 transitions. Second operand 54 states. [2018-10-12 21:21:29,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:21:29,264 INFO L93 Difference]: Finished difference Result 1280 states and 1280 transitions. [2018-10-12 21:21:29,265 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 21:21:29,265 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 1225 [2018-10-12 21:21:29,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:21:29,270 INFO L225 Difference]: With dead ends: 1280 [2018-10-12 21:21:29,270 INFO L226 Difference]: Without dead ends: 1280 [2018-10-12 21:21:29,270 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1400 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=785, Invalid=9721, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 21:21:29,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2018-10-12 21:21:29,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1254. [2018-10-12 21:21:29,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1254 states. [2018-10-12 21:21:29,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1254 states to 1254 states and 1254 transitions. [2018-10-12 21:21:29,281 INFO L78 Accepts]: Start accepts. Automaton has 1254 states and 1254 transitions. Word has length 1225 [2018-10-12 21:21:29,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:21:29,282 INFO L481 AbstractCegarLoop]: Abstraction has 1254 states and 1254 transitions. [2018-10-12 21:21:29,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 21:21:29,282 INFO L276 IsEmpty]: Start isEmpty. Operand 1254 states and 1254 transitions. [2018-10-12 21:21:29,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1254 [2018-10-12 21:21:29,291 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:21:29,291 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:21:29,291 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:21:29,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:21:29,292 INFO L82 PathProgramCache]: Analyzing trace with hash -2092147888, now seen corresponding path program 43 times [2018-10-12 21:21:29,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:21:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:21:37,508 INFO L134 CoverageAnalysis]: Checked inductivity of 26230 backedges. 0 proven. 26230 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:21:37,508 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:21:37,508 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-12 21:21:37,509 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-12 21:21:37,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-12 21:21:37,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2764, Unknown=0, NotChecked=0, Total=2970 [2018-10-12 21:21:37,509 INFO L87 Difference]: Start difference. First operand 1254 states and 1254 transitions. Second operand 55 states. [2018-10-12 21:21:57,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:21:57,642 INFO L93 Difference]: Finished difference Result 1308 states and 1308 transitions. [2018-10-12 21:21:57,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-12 21:21:57,642 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 1253 [2018-10-12 21:21:57,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:21:57,647 INFO L225 Difference]: With dead ends: 1308 [2018-10-12 21:21:57,647 INFO L226 Difference]: Without dead ends: 1308 [2018-10-12 21:21:57,648 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1454 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=801, Invalid=10119, Unknown=0, NotChecked=0, Total=10920 [2018-10-12 21:21:57,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2018-10-12 21:21:57,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1282. [2018-10-12 21:21:57,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1282 states. [2018-10-12 21:21:57,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1282 states to 1282 states and 1282 transitions. [2018-10-12 21:21:57,659 INFO L78 Accepts]: Start accepts. Automaton has 1282 states and 1282 transitions. Word has length 1253 [2018-10-12 21:21:57,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:21:57,660 INFO L481 AbstractCegarLoop]: Abstraction has 1282 states and 1282 transitions. [2018-10-12 21:21:57,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-12 21:21:57,660 INFO L276 IsEmpty]: Start isEmpty. Operand 1282 states and 1282 transitions. [2018-10-12 21:21:57,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2018-10-12 21:21:57,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:21:57,670 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:21:57,670 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:21:57,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:21:57,671 INFO L82 PathProgramCache]: Analyzing trace with hash 793610493, now seen corresponding path program 44 times [2018-10-12 21:21:57,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:21:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:22:06,223 INFO L134 CoverageAnalysis]: Checked inductivity of 27456 backedges. 0 proven. 27456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:22:06,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:22:06,224 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 21:22:06,224 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 21:22:06,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 21:22:06,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=2870, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 21:22:06,225 INFO L87 Difference]: Start difference. First operand 1282 states and 1282 transitions. Second operand 56 states.