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/sanfoundry_24_false-valid-deref.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-093a8c0 [2018-10-14 16:51:02,629 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-14 16:51:02,631 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-14 16:51:02,644 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-14 16:51:02,644 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-14 16:51:02,645 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-14 16:51:02,646 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-14 16:51:02,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-14 16:51:02,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-14 16:51:02,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-14 16:51:02,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-14 16:51:02,652 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-14 16:51:02,653 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-14 16:51:02,654 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-14 16:51:02,655 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-14 16:51:02,656 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-14 16:51:02,656 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-14 16:51:02,658 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-14 16:51:02,660 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-14 16:51:02,662 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-14 16:51:02,663 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-14 16:51:02,664 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-14 16:51:02,667 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-14 16:51:02,667 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-14 16:51:02,667 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-14 16:51:02,668 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-14 16:51:02,669 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-14 16:51:02,670 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-14 16:51:02,671 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-14 16:51:02,672 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-14 16:51:02,672 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-14 16:51:02,673 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-14 16:51:02,673 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-14 16:51:02,674 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-14 16:51:02,675 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-14 16:51:02,676 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-14 16:51:02,676 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-14 16:51:02,696 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-14 16:51:02,696 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-14 16:51:02,701 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-14 16:51:02,701 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-14 16:51:02,702 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-14 16:51:02,702 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-14 16:51:02,702 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-14 16:51:02,706 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-14 16:51:02,706 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-14 16:51:02,706 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-14 16:51:02,706 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-14 16:51:02,707 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-14 16:51:02,707 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-14 16:51:02,708 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-14 16:51:02,708 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-14 16:51:02,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-14 16:51:02,793 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-14 16:51:02,799 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-14 16:51:02,801 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-14 16:51:02,801 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-14 16:51:02,802 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl [2018-10-14 16:51:02,802 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/sanfoundry_24_false-valid-deref.i_4.bpl' [2018-10-14 16:51:02,869 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-14 16:51:02,870 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-14 16:51:02,871 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-14 16:51:02,871 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-14 16:51:02,871 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-14 16:51:02,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,910 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,911 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... [2018-10-14 16:51:02,919 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-14 16:51:02,920 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-14 16:51:02,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-14 16:51:02,921 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-14 16:51:02,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-14 16:51:02,991 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-14 16:51:02,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-14 16:51:02,992 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-14 16:51:03,394 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-14 16:51:03,395 INFO L202 PluginConnector]: Adding new model sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:51:03 BoogieIcfgContainer [2018-10-14 16:51:03,395 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-14 16:51:03,396 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-14 16:51:03,397 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-14 16:51:03,400 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-14 16:51:03,400 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 14.10 04:51:02" (1/2) ... [2018-10-14 16:51:03,401 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b73c0c8 and model type sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 04:51:03, skipping insertion in model container [2018-10-14 16:51:03,402 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "sanfoundry_24_false-valid-deref.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 04:51:03" (2/2) ... [2018-10-14 16:51:03,404 INFO L112 eAbstractionObserver]: Analyzing ICFG sanfoundry_24_false-valid-deref.i_4.bpl [2018-10-14 16:51:03,414 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-14 16:51:03,424 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-14 16:51:03,442 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-14 16:51:03,473 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-14 16:51:03,474 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-14 16:51:03,474 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-14 16:51:03,474 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-14 16:51:03,474 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-14 16:51:03,474 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-14 16:51:03,475 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-14 16:51:03,475 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-14 16:51:03,475 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-14 16:51:03,492 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states. [2018-10-14 16:51:03,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-14 16:51:03,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:03,503 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] [2018-10-14 16:51:03,504 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:03,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:03,511 INFO L82 PathProgramCache]: Analyzing trace with hash -974922535, now seen corresponding path program 1 times [2018-10-14 16:51:03,576 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:03,978 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:03,985 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-14 16:51:03,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-10-14 16:51:03,993 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-14 16:51:04,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-14 16:51:04,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2018-10-14 16:51:04,013 INFO L87 Difference]: Start difference. First operand 38 states. Second operand 8 states. [2018-10-14 16:51:04,601 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 24 [2018-10-14 16:51:04,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:04,664 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-14 16:51:04,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-14 16:51:04,666 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 25 [2018-10-14 16:51:04,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:04,679 INFO L225 Difference]: With dead ends: 52 [2018-10-14 16:51:04,679 INFO L226 Difference]: Without dead ends: 52 [2018-10-14 16:51:04,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2018-10-14 16:51:04,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-14 16:51:04,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2018-10-14 16:51:04,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-14 16:51:04,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-14 16:51:04,722 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 25 [2018-10-14 16:51:04,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:04,723 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-14 16:51:04,723 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-14 16:51:04,724 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-14 16:51:04,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-14 16:51:04,725 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:04,725 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:04,726 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:04,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:04,726 INFO L82 PathProgramCache]: Analyzing trace with hash 759825485, now seen corresponding path program 1 times [2018-10-14 16:51:04,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:05,096 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:05,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:05,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-14 16:51:05,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-14 16:51:05,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-14 16:51:05,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-14 16:51:05,100 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 10 states. [2018-10-14 16:51:05,542 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:51:06,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:06,011 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-14 16:51:06,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-14 16:51:06,012 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 39 [2018-10-14 16:51:06,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:06,014 INFO L225 Difference]: With dead ends: 66 [2018-10-14 16:51:06,015 INFO L226 Difference]: Without dead ends: 66 [2018-10-14 16:51:06,016 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:51:06,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-14 16:51:06,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 54. [2018-10-14 16:51:06,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-14 16:51:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-14 16:51:06,024 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 39 [2018-10-14 16:51:06,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:06,025 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-14 16:51:06,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-14 16:51:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-14 16:51:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-14 16:51:06,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:06,027 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 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] [2018-10-14 16:51:06,027 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:06,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:06,028 INFO L82 PathProgramCache]: Analyzing trace with hash -825487167, now seen corresponding path program 2 times [2018-10-14 16:51:06,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:06,438 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-14 16:51:06,438 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:06,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-14 16:51:06,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-14 16:51:06,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-14 16:51:06,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-14 16:51:06,440 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 12 states. [2018-10-14 16:51:06,997 WARN L179 SmtUtils]: Spent 145.00 ms on a formula simplification that was a NOOP. DAG size: 20 [2018-10-14 16:51:07,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:07,533 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-14 16:51:07,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-14 16:51:07,534 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 53 [2018-10-14 16:51:07,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:07,537 INFO L225 Difference]: With dead ends: 80 [2018-10-14 16:51:07,537 INFO L226 Difference]: Without dead ends: 80 [2018-10-14 16:51:07,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=131, Invalid=375, Unknown=0, NotChecked=0, Total=506 [2018-10-14 16:51:07,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-14 16:51:07,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 68. [2018-10-14 16:51:07,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-14 16:51:07,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-14 16:51:07,545 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 53 [2018-10-14 16:51:07,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:07,546 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-14 16:51:07,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-14 16:51:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-14 16:51:07,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-14 16:51:07,549 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:07,549 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:07,549 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:07,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:07,550 INFO L82 PathProgramCache]: Analyzing trace with hash -1523236299, now seen corresponding path program 3 times [2018-10-14 16:51:07,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:07,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:07,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:07,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-14 16:51:07,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-14 16:51:07,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-14 16:51:07,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2018-10-14 16:51:07,936 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 14 states. [2018-10-14 16:51:08,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:08,672 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-14 16:51:08,673 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-14 16:51:08,673 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 67 [2018-10-14 16:51:08,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:08,675 INFO L225 Difference]: With dead ends: 94 [2018-10-14 16:51:08,675 INFO L226 Difference]: Without dead ends: 94 [2018-10-14 16:51:08,676 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:51:08,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-14 16:51:08,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 82. [2018-10-14 16:51:08,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-14 16:51:08,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-14 16:51:08,684 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 67 [2018-10-14 16:51:08,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:08,684 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-14 16:51:08,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-14 16:51:08,685 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-14 16:51:08,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-14 16:51:08,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:08,687 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:08,687 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:08,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:08,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1184946345, now seen corresponding path program 4 times [2018-10-14 16:51:08,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:08,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:09,098 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:09,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-14 16:51:09,099 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-14 16:51:09,099 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-14 16:51:09,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-14 16:51:09,100 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 16 states. [2018-10-14 16:51:10,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:10,431 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-14 16:51:10,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-14 16:51:10,432 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 81 [2018-10-14 16:51:10,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:10,434 INFO L225 Difference]: With dead ends: 108 [2018-10-14 16:51:10,434 INFO L226 Difference]: Without dead ends: 108 [2018-10-14 16:51:10,435 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-14 16:51:10,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-14 16:51:10,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 96. [2018-10-14 16:51:10,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-14 16:51:10,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-14 16:51:10,444 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 81 [2018-10-14 16:51:10,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:10,444 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-14 16:51:10,445 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-14 16:51:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-14 16:51:10,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-14 16:51:10,446 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:10,447 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:10,447 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:10,447 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:10,448 INFO L82 PathProgramCache]: Analyzing trace with hash -663088099, now seen corresponding path program 5 times [2018-10-14 16:51:10,448 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:10,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:10,909 INFO L134 CoverageAnalysis]: Checked inductivity of 160 backedges. 0 proven. 160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:10,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:10,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-14 16:51:10,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-14 16:51:10,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-14 16:51:10,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-14 16:51:10,911 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 18 states. [2018-10-14 16:51:12,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:12,719 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-14 16:51:12,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-14 16:51:12,720 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 95 [2018-10-14 16:51:12,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:12,721 INFO L225 Difference]: With dead ends: 122 [2018-10-14 16:51:12,722 INFO L226 Difference]: Without dead ends: 122 [2018-10-14 16:51:12,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:51:12,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-14 16:51:12,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2018-10-14 16:51:12,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-14 16:51:12,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-14 16:51:12,730 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 95 [2018-10-14 16:51:12,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:12,731 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-14 16:51:12,731 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-14 16:51:12,731 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-14 16:51:12,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-14 16:51:12,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:12,733 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:12,733 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:12,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 58471569, now seen corresponding path program 6 times [2018-10-14 16:51:12,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:12,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:13,228 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:13,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-14 16:51:13,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-14 16:51:13,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-14 16:51:13,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=398, Unknown=0, NotChecked=0, Total=462 [2018-10-14 16:51:13,229 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 22 states. [2018-10-14 16:51:15,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:15,588 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-14 16:51:15,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-14 16:51:15,588 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 109 [2018-10-14 16:51:15,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:15,590 INFO L225 Difference]: With dead ends: 136 [2018-10-14 16:51:15,590 INFO L226 Difference]: Without dead ends: 136 [2018-10-14 16:51:15,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=536, Invalid=1720, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:51:15,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-14 16:51:15,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 124. [2018-10-14 16:51:15,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-14 16:51:15,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-14 16:51:15,600 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 109 [2018-10-14 16:51:15,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:15,600 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-14 16:51:15,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-14 16:51:15,601 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-14 16:51:15,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-14 16:51:15,603 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:15,603 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:15,603 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:15,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:15,604 INFO L82 PathProgramCache]: Analyzing trace with hash -407733755, now seen corresponding path program 7 times [2018-10-14 16:51:15,605 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:16,244 INFO L134 CoverageAnalysis]: Checked inductivity of 322 backedges. 0 proven. 322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:16,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:16,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-14 16:51:16,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-14 16:51:16,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-14 16:51:16,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=475, Unknown=0, NotChecked=0, Total=552 [2018-10-14 16:51:16,246 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 24 states. [2018-10-14 16:51:17,868 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-10-14 16:51:18,652 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 33 [2018-10-14 16:51:18,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:18,751 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-14 16:51:18,754 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-14 16:51:18,754 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 123 [2018-10-14 16:51:18,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:18,755 INFO L225 Difference]: With dead ends: 150 [2018-10-14 16:51:18,755 INFO L226 Difference]: Without dead ends: 150 [2018-10-14 16:51:18,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=681, Invalid=2181, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:51:18,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-14 16:51:18,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 138. [2018-10-14 16:51:18,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-14 16:51:18,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-14 16:51:18,763 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 123 [2018-10-14 16:51:18,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:18,764 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-14 16:51:18,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-14 16:51:18,764 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-14 16:51:18,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-14 16:51:18,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:18,766 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:18,767 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:18,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:18,767 INFO L82 PathProgramCache]: Analyzing trace with hash 276309113, now seen corresponding path program 8 times [2018-10-14 16:51:18,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:18,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:19,639 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 0 proven. 424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:19,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:19,639 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-14 16:51:19,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-14 16:51:19,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-14 16:51:19,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2018-10-14 16:51:19,641 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 26 states. [2018-10-14 16:51:20,866 WARN L179 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-10-14 16:51:22,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:22,631 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-14 16:51:22,633 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-14 16:51:22,633 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 137 [2018-10-14 16:51:22,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:22,636 INFO L225 Difference]: With dead ends: 164 [2018-10-14 16:51:22,636 INFO L226 Difference]: Without dead ends: 164 [2018-10-14 16:51:22,638 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 731 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=843, Invalid=2697, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:51:22,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-14 16:51:22,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 152. [2018-10-14 16:51:22,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-14 16:51:22,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-14 16:51:22,644 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 137 [2018-10-14 16:51:22,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:22,645 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-14 16:51:22,645 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-14 16:51:22,645 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-14 16:51:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-14 16:51:22,647 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:22,648 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:22,648 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:22,648 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 1752724461, now seen corresponding path program 9 times [2018-10-14 16:51:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:23,627 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:23,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:23,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-14 16:51:23,628 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-14 16:51:23,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-14 16:51:23,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=647, Unknown=0, NotChecked=0, Total=756 [2018-10-14 16:51:23,629 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 28 states. [2018-10-14 16:51:27,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:27,075 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-14 16:51:27,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-14 16:51:27,076 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 151 [2018-10-14 16:51:27,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:27,078 INFO L225 Difference]: With dead ends: 178 [2018-10-14 16:51:27,078 INFO L226 Difference]: Without dead ends: 178 [2018-10-14 16:51:27,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 914 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1022, Invalid=3268, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:51:27,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-14 16:51:27,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 166. [2018-10-14 16:51:27,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-14 16:51:27,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-14 16:51:27,084 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 151 [2018-10-14 16:51:27,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:27,084 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-14 16:51:27,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-14 16:51:27,085 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-14 16:51:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-14 16:51:27,087 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:27,087 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:27,088 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:27,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:27,088 INFO L82 PathProgramCache]: Analyzing trace with hash 766421089, now seen corresponding path program 10 times [2018-10-14 16:51:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:27,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:28,497 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 0 proven. 670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:28,497 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:28,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-14 16:51:28,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-14 16:51:28,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-14 16:51:28,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2018-10-14 16:51:28,498 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 30 states. [2018-10-14 16:51:29,054 WARN L179 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2018-10-14 16:51:33,045 WARN L179 SmtUtils]: Spent 464.00 ms on a formula simplification. DAG size of input: 42 DAG size of output: 33 [2018-10-14 16:51:33,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:33,661 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-14 16:51:33,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-14 16:51:33,662 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 165 [2018-10-14 16:51:33,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:33,664 INFO L225 Difference]: With dead ends: 192 [2018-10-14 16:51:33,664 INFO L226 Difference]: Without dead ends: 192 [2018-10-14 16:51:33,667 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1118 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=1218, Invalid=3894, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:51:33,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-14 16:51:33,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 180. [2018-10-14 16:51:33,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-14 16:51:33,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-14 16:51:33,672 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 165 [2018-10-14 16:51:33,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:33,672 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-14 16:51:33,672 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-14 16:51:33,673 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-14 16:51:33,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-14 16:51:33,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:33,675 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:33,676 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:33,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:33,676 INFO L82 PathProgramCache]: Analyzing trace with hash -446299691, now seen corresponding path program 11 times [2018-10-14 16:51:33,677 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:33,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:34,438 INFO L134 CoverageAnalysis]: Checked inductivity of 814 backedges. 0 proven. 814 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:34,439 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:34,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-14 16:51:34,439 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-14 16:51:34,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-14 16:51:34,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=843, Unknown=0, NotChecked=0, Total=992 [2018-10-14 16:51:34,440 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 32 states. [2018-10-14 16:51:38,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:38,827 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-14 16:51:38,828 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-14 16:51:38,828 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 179 [2018-10-14 16:51:38,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:38,830 INFO L225 Difference]: With dead ends: 206 [2018-10-14 16:51:38,830 INFO L226 Difference]: Without dead ends: 206 [2018-10-14 16:51:38,832 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1343 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=1431, Invalid=4575, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:51:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-14 16:51:38,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 194. [2018-10-14 16:51:38,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-14 16:51:38,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-14 16:51:38,836 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 179 [2018-10-14 16:51:38,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:38,837 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-14 16:51:38,837 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-14 16:51:38,837 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-14 16:51:38,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-14 16:51:38,840 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:38,840 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:38,840 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:38,841 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:38,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1345962057, now seen corresponding path program 12 times [2018-10-14 16:51:38,841 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:38,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:40,268 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 0 proven. 972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:40,269 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:40,269 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-14 16:51:40,269 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-14 16:51:40,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-14 16:51:40,270 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=950, Unknown=0, NotChecked=0, Total=1122 [2018-10-14 16:51:40,270 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 34 states. [2018-10-14 16:51:45,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:45,146 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-14 16:51:45,146 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-14 16:51:45,147 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 193 [2018-10-14 16:51:45,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:45,148 INFO L225 Difference]: With dead ends: 220 [2018-10-14 16:51:45,149 INFO L226 Difference]: Without dead ends: 220 [2018-10-14 16:51:45,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1589 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1661, Invalid=5311, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:51:45,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-14 16:51:45,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 208. [2018-10-14 16:51:45,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-10-14 16:51:45,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 208 transitions. [2018-10-14 16:51:45,156 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 208 transitions. Word has length 193 [2018-10-14 16:51:45,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:45,156 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 208 transitions. [2018-10-14 16:51:45,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-14 16:51:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 208 transitions. [2018-10-14 16:51:45,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2018-10-14 16:51:45,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:45,158 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:45,158 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:45,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:45,158 INFO L82 PathProgramCache]: Analyzing trace with hash 1578443709, now seen corresponding path program 13 times [2018-10-14 16:51:45,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:45,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 0 proven. 1144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:46,457 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:46,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-14 16:51:46,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-14 16:51:46,458 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-14 16:51:46,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=1063, Unknown=0, NotChecked=0, Total=1260 [2018-10-14 16:51:46,459 INFO L87 Difference]: Start difference. First operand 208 states and 208 transitions. Second operand 36 states. [2018-10-14 16:51:51,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:51,606 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-14 16:51:51,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-14 16:51:51,607 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 207 [2018-10-14 16:51:51,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:51,608 INFO L225 Difference]: With dead ends: 234 [2018-10-14 16:51:51,609 INFO L226 Difference]: Without dead ends: 234 [2018-10-14 16:51:51,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1856 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=1908, Invalid=6102, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 16:51:51,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-14 16:51:51,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 222. [2018-10-14 16:51:51,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 222 states. [2018-10-14 16:51:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 222 states to 222 states and 222 transitions. [2018-10-14 16:51:51,616 INFO L78 Accepts]: Start accepts. Automaton has 222 states and 222 transitions. Word has length 207 [2018-10-14 16:51:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:51,617 INFO L481 AbstractCegarLoop]: Abstraction has 222 states and 222 transitions. [2018-10-14 16:51:51,617 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-14 16:51:51,617 INFO L276 IsEmpty]: Start isEmpty. Operand 222 states and 222 transitions. [2018-10-14 16:51:51,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2018-10-14 16:51:51,618 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:51,619 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:51,619 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:51,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:51,619 INFO L82 PathProgramCache]: Analyzing trace with hash 573795377, now seen corresponding path program 14 times [2018-10-14 16:51:51,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:52,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1330 backedges. 0 proven. 1330 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:52,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:52,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-14 16:51:52,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-14 16:51:52,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-14 16:51:52,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=1182, Unknown=0, NotChecked=0, Total=1406 [2018-10-14 16:51:52,604 INFO L87 Difference]: Start difference. First operand 222 states and 222 transitions. Second operand 38 states. [2018-10-14 16:51:56,496 WARN L179 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 40 [2018-10-14 16:51:58,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:51:58,351 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-14 16:51:58,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-14 16:51:58,351 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 221 [2018-10-14 16:51:58,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:51:58,353 INFO L225 Difference]: With dead ends: 248 [2018-10-14 16:51:58,353 INFO L226 Difference]: Without dead ends: 248 [2018-10-14 16:51:58,356 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2144 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=2172, Invalid=6948, Unknown=0, NotChecked=0, Total=9120 [2018-10-14 16:51:58,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-14 16:51:58,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 236. [2018-10-14 16:51:58,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-14 16:51:58,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-14 16:51:58,363 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 221 [2018-10-14 16:51:58,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:51:58,364 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-14 16:51:58,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-14 16:51:58,364 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-14 16:51:58,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-14 16:51:58,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:51:58,366 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:51:58,366 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:51:58,366 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:51:58,367 INFO L82 PathProgramCache]: Analyzing trace with hash -954213979, now seen corresponding path program 15 times [2018-10-14 16:51:58,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:51:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:51:59,413 INFO L134 CoverageAnalysis]: Checked inductivity of 1530 backedges. 0 proven. 1530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:51:59,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:51:59,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-14 16:51:59,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-14 16:51:59,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-14 16:51:59,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=1307, Unknown=0, NotChecked=0, Total=1560 [2018-10-14 16:51:59,416 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 40 states. [2018-10-14 16:52:05,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:05,487 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-14 16:52:05,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-14 16:52:05,487 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 235 [2018-10-14 16:52:05,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:05,489 INFO L225 Difference]: With dead ends: 262 [2018-10-14 16:52:05,489 INFO L226 Difference]: Without dead ends: 262 [2018-10-14 16:52:05,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2453 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=2453, Invalid=7849, Unknown=0, NotChecked=0, Total=10302 [2018-10-14 16:52:05,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-14 16:52:05,494 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 250. [2018-10-14 16:52:05,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 250 states. [2018-10-14 16:52:05,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 250 transitions. [2018-10-14 16:52:05,495 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 250 transitions. Word has length 235 [2018-10-14 16:52:05,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:05,496 INFO L481 AbstractCegarLoop]: Abstraction has 250 states and 250 transitions. [2018-10-14 16:52:05,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-14 16:52:05,496 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 250 transitions. [2018-10-14 16:52:05,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2018-10-14 16:52:05,497 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:05,497 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:05,498 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:05,498 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:05,498 INFO L82 PathProgramCache]: Analyzing trace with hash -2102023143, now seen corresponding path program 16 times [2018-10-14 16:52:05,499 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:06,937 INFO L134 CoverageAnalysis]: Checked inductivity of 1744 backedges. 0 proven. 1744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:52:06,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:06,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-14 16:52:06,938 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-14 16:52:06,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-14 16:52:06,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=284, Invalid=1438, Unknown=0, NotChecked=0, Total=1722 [2018-10-14 16:52:06,938 INFO L87 Difference]: Start difference. First operand 250 states and 250 transitions. Second operand 42 states. [2018-10-14 16:52:13,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:13,558 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-14 16:52:13,558 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-14 16:52:13,558 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 249 [2018-10-14 16:52:13,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:13,561 INFO L225 Difference]: With dead ends: 276 [2018-10-14 16:52:13,561 INFO L226 Difference]: Without dead ends: 276 [2018-10-14 16:52:13,562 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2783 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=2751, Invalid=8805, Unknown=0, NotChecked=0, Total=11556 [2018-10-14 16:52:13,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-14 16:52:13,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 264. [2018-10-14 16:52:13,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 264 states. [2018-10-14 16:52:13,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 264 transitions. [2018-10-14 16:52:13,567 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 264 transitions. Word has length 249 [2018-10-14 16:52:13,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:13,568 INFO L481 AbstractCegarLoop]: Abstraction has 264 states and 264 transitions. [2018-10-14 16:52:13,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-14 16:52:13,568 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 264 transitions. [2018-10-14 16:52:13,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2018-10-14 16:52:13,569 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:13,570 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:13,570 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:13,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:13,570 INFO L82 PathProgramCache]: Analyzing trace with hash -1977605235, now seen corresponding path program 17 times [2018-10-14 16:52:13,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:13,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:15,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1972 backedges. 0 proven. 1972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:52:15,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:15,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-14 16:52:15,624 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-14 16:52:15,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-14 16:52:15,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=317, Invalid=1575, Unknown=0, NotChecked=0, Total=1892 [2018-10-14 16:52:15,625 INFO L87 Difference]: Start difference. First operand 264 states and 264 transitions. Second operand 44 states. [2018-10-14 16:52:22,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:22,629 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-14 16:52:22,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-14 16:52:22,630 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 263 [2018-10-14 16:52:22,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:22,631 INFO L225 Difference]: With dead ends: 290 [2018-10-14 16:52:22,632 INFO L226 Difference]: Without dead ends: 290 [2018-10-14 16:52:22,633 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3134 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=3066, Invalid=9816, Unknown=0, NotChecked=0, Total=12882 [2018-10-14 16:52:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-14 16:52:22,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 278. [2018-10-14 16:52:22,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-14 16:52:22,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-14 16:52:22,639 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 263 [2018-10-14 16:52:22,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:22,639 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-14 16:52:22,639 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-14 16:52:22,640 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-14 16:52:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-14 16:52:22,641 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:22,641 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:22,642 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:22,642 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:22,642 INFO L82 PathProgramCache]: Analyzing trace with hash 98205697, now seen corresponding path program 18 times [2018-10-14 16:52:22,643 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:22,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:24,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2214 backedges. 0 proven. 2214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:52:24,611 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:24,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-14 16:52:24,611 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-14 16:52:24,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-14 16:52:24,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=352, Invalid=1718, Unknown=0, NotChecked=0, Total=2070 [2018-10-14 16:52:24,612 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 46 states. [2018-10-14 16:52:32,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:32,580 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-14 16:52:32,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-14 16:52:32,580 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 277 [2018-10-14 16:52:32,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:32,583 INFO L225 Difference]: With dead ends: 304 [2018-10-14 16:52:32,583 INFO L226 Difference]: Without dead ends: 304 [2018-10-14 16:52:32,585 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3506 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=3398, Invalid=10882, Unknown=0, NotChecked=0, Total=14280 [2018-10-14 16:52:32,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-14 16:52:32,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 292. [2018-10-14 16:52:32,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 292 states. [2018-10-14 16:52:32,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 292 transitions. [2018-10-14 16:52:32,590 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 292 transitions. Word has length 277 [2018-10-14 16:52:32,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:32,591 INFO L481 AbstractCegarLoop]: Abstraction has 292 states and 292 transitions. [2018-10-14 16:52:32,591 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-14 16:52:32,591 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 292 transitions. [2018-10-14 16:52:32,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2018-10-14 16:52:32,592 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:32,593 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:32,593 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:32,593 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:32,593 INFO L82 PathProgramCache]: Analyzing trace with hash 95420789, now seen corresponding path program 19 times [2018-10-14 16:52:32,594 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:34,018 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-14 16:52:34,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:34,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-14 16:52:34,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-14 16:52:34,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-14 16:52:34,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=389, Invalid=1867, Unknown=0, NotChecked=0, Total=2256 [2018-10-14 16:52:34,020 INFO L87 Difference]: Start difference. First operand 292 states and 292 transitions. Second operand 48 states. [2018-10-14 16:52:42,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:42,562 INFO L93 Difference]: Finished difference Result 318 states and 318 transitions. [2018-10-14 16:52:42,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-14 16:52:42,562 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 291 [2018-10-14 16:52:42,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:42,563 INFO L225 Difference]: With dead ends: 318 [2018-10-14 16:52:42,563 INFO L226 Difference]: Without dead ends: 318 [2018-10-14 16:52:42,565 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3899 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=3747, Invalid=12003, Unknown=0, NotChecked=0, Total=15750 [2018-10-14 16:52:42,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2018-10-14 16:52:42,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 306. [2018-10-14 16:52:42,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 306 states. [2018-10-14 16:52:42,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 306 transitions. [2018-10-14 16:52:42,570 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 306 transitions. Word has length 291 [2018-10-14 16:52:42,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:42,571 INFO L481 AbstractCegarLoop]: Abstraction has 306 states and 306 transitions. [2018-10-14 16:52:42,571 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-14 16:52:42,571 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 306 transitions. [2018-10-14 16:52:42,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2018-10-14 16:52:42,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:42,573 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:42,573 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:42,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:42,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1958471657, now seen corresponding path program 20 times [2018-10-14 16:52:42,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:44,717 INFO L134 CoverageAnalysis]: Checked inductivity of 2740 backedges. 0 proven. 2740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:52:44,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:44,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-14 16:52:44,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-14 16:52:44,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-14 16:52:44,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=2022, Unknown=0, NotChecked=0, Total=2450 [2018-10-14 16:52:44,719 INFO L87 Difference]: Start difference. First operand 306 states and 306 transitions. Second operand 50 states. [2018-10-14 16:52:53,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:52:53,424 INFO L93 Difference]: Finished difference Result 332 states and 332 transitions. [2018-10-14 16:52:53,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-14 16:52:53,425 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 305 [2018-10-14 16:52:53,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:52:53,427 INFO L225 Difference]: With dead ends: 332 [2018-10-14 16:52:53,427 INFO L226 Difference]: Without dead ends: 332 [2018-10-14 16:52:53,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4313 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=4113, Invalid=13179, Unknown=0, NotChecked=0, Total=17292 [2018-10-14 16:52:53,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2018-10-14 16:52:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 320. [2018-10-14 16:52:53,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-14 16:52:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-14 16:52:53,433 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 305 [2018-10-14 16:52:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:52:53,433 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-14 16:52:53,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-14 16:52:53,433 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-14 16:52:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-14 16:52:53,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:52:53,435 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:52:53,436 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:52:53,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:52:53,436 INFO L82 PathProgramCache]: Analyzing trace with hash 225014621, now seen corresponding path program 21 times [2018-10-14 16:52:53,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:52:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:52:55,106 INFO L134 CoverageAnalysis]: Checked inductivity of 3024 backedges. 0 proven. 3024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:52:55,107 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:52:55,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-14 16:52:55,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-14 16:52:55,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-14 16:52:55,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=469, Invalid=2183, Unknown=0, NotChecked=0, Total=2652 [2018-10-14 16:52:55,108 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 52 states. [2018-10-14 16:53:04,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:04,945 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-14 16:53:04,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-14 16:53:04,948 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 319 [2018-10-14 16:53:04,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:04,950 INFO L225 Difference]: With dead ends: 346 [2018-10-14 16:53:04,950 INFO L226 Difference]: Without dead ends: 346 [2018-10-14 16:53:04,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4748 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=4496, Invalid=14410, Unknown=0, NotChecked=0, Total=18906 [2018-10-14 16:53:04,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2018-10-14 16:53:04,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 334. [2018-10-14 16:53:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 334 states. [2018-10-14 16:53:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 334 states to 334 states and 334 transitions. [2018-10-14 16:53:04,956 INFO L78 Accepts]: Start accepts. Automaton has 334 states and 334 transitions. Word has length 319 [2018-10-14 16:53:04,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:04,956 INFO L481 AbstractCegarLoop]: Abstraction has 334 states and 334 transitions. [2018-10-14 16:53:04,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-14 16:53:04,956 INFO L276 IsEmpty]: Start isEmpty. Operand 334 states and 334 transitions. [2018-10-14 16:53:04,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2018-10-14 16:53:04,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:04,958 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:04,958 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:04,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:04,959 INFO L82 PathProgramCache]: Analyzing trace with hash 1299440593, now seen corresponding path program 22 times [2018-10-14 16:53:04,959 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:04,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:06,659 INFO L134 CoverageAnalysis]: Checked inductivity of 3322 backedges. 0 proven. 3322 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:06,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:06,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-14 16:53:06,659 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-14 16:53:06,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-14 16:53:06,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=512, Invalid=2350, Unknown=0, NotChecked=0, Total=2862 [2018-10-14 16:53:06,660 INFO L87 Difference]: Start difference. First operand 334 states and 334 transitions. Second operand 54 states. [2018-10-14 16:53:17,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:17,061 INFO L93 Difference]: Finished difference Result 360 states and 360 transitions. [2018-10-14 16:53:17,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-14 16:53:17,061 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 333 [2018-10-14 16:53:17,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:17,063 INFO L225 Difference]: With dead ends: 360 [2018-10-14 16:53:17,063 INFO L226 Difference]: Without dead ends: 360 [2018-10-14 16:53:17,064 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5204 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=4896, Invalid=15696, Unknown=0, NotChecked=0, Total=20592 [2018-10-14 16:53:17,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-14 16:53:17,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 348. [2018-10-14 16:53:17,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 348 states. [2018-10-14 16:53:17,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 348 transitions. [2018-10-14 16:53:17,069 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 348 transitions. Word has length 333 [2018-10-14 16:53:17,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:17,070 INFO L481 AbstractCegarLoop]: Abstraction has 348 states and 348 transitions. [2018-10-14 16:53:17,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-14 16:53:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 348 transitions. [2018-10-14 16:53:17,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 348 [2018-10-14 16:53:17,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:17,072 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:17,072 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:17,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:17,073 INFO L82 PathProgramCache]: Analyzing trace with hash 1776712005, now seen corresponding path program 23 times [2018-10-14 16:53:17,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:19,185 INFO L134 CoverageAnalysis]: Checked inductivity of 3634 backedges. 0 proven. 3634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:19,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:19,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-14 16:53:19,186 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-14 16:53:19,186 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-14 16:53:19,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=557, Invalid=2523, Unknown=0, NotChecked=0, Total=3080 [2018-10-14 16:53:19,187 INFO L87 Difference]: Start difference. First operand 348 states and 348 transitions. Second operand 56 states. [2018-10-14 16:53:29,690 WARN L179 SmtUtils]: Spent 555.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2018-10-14 16:53:31,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:31,287 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-14 16:53:31,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-14 16:53:31,288 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 347 [2018-10-14 16:53:31,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:31,290 INFO L225 Difference]: With dead ends: 374 [2018-10-14 16:53:31,291 INFO L226 Difference]: Without dead ends: 374 [2018-10-14 16:53:31,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5681 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=5313, Invalid=17037, Unknown=0, NotChecked=0, Total=22350 [2018-10-14 16:53:31,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 374 states. [2018-10-14 16:53:31,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 374 to 362. [2018-10-14 16:53:31,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-14 16:53:31,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-14 16:53:31,297 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 347 [2018-10-14 16:53:31,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:31,298 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-14 16:53:31,298 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-14 16:53:31,298 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-14 16:53:31,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-14 16:53:31,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:31,300 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:31,300 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:31,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:31,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1125938105, now seen corresponding path program 24 times [2018-10-14 16:53:31,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:31,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 3960 backedges. 0 proven. 3960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:33,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:33,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-14 16:53:33,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-14 16:53:33,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-14 16:53:33,345 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=604, Invalid=2702, Unknown=0, NotChecked=0, Total=3306 [2018-10-14 16:53:33,345 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 58 states. [2018-10-14 16:53:45,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:53:45,314 INFO L93 Difference]: Finished difference Result 388 states and 388 transitions. [2018-10-14 16:53:45,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-14 16:53:45,316 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 361 [2018-10-14 16:53:45,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:53:45,318 INFO L225 Difference]: With dead ends: 388 [2018-10-14 16:53:45,319 INFO L226 Difference]: Without dead ends: 388 [2018-10-14 16:53:45,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6179 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=5747, Invalid=18433, Unknown=0, NotChecked=0, Total=24180 [2018-10-14 16:53:45,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 388 states. [2018-10-14 16:53:45,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 388 to 376. [2018-10-14 16:53:45,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 376 states. [2018-10-14 16:53:45,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 376 states to 376 states and 376 transitions. [2018-10-14 16:53:45,324 INFO L78 Accepts]: Start accepts. Automaton has 376 states and 376 transitions. Word has length 361 [2018-10-14 16:53:45,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:53:45,325 INFO L481 AbstractCegarLoop]: Abstraction has 376 states and 376 transitions. [2018-10-14 16:53:45,325 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-14 16:53:45,325 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 376 transitions. [2018-10-14 16:53:45,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 376 [2018-10-14 16:53:45,327 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:53:45,327 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:53:45,328 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:53:45,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:53:45,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1489048365, now seen corresponding path program 25 times [2018-10-14 16:53:45,329 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:53:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:53:47,462 INFO L134 CoverageAnalysis]: Checked inductivity of 4300 backedges. 0 proven. 4300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:53:47,463 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:53:47,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-14 16:53:47,463 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-14 16:53:47,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-14 16:53:47,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=653, Invalid=2887, Unknown=0, NotChecked=0, Total=3540 [2018-10-14 16:53:47,464 INFO L87 Difference]: Start difference. First operand 376 states and 376 transitions. Second operand 60 states. [2018-10-14 16:53:48,831 WARN L179 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 38 [2018-10-14 16:54:00,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:00,074 INFO L93 Difference]: Finished difference Result 402 states and 402 transitions. [2018-10-14 16:54:00,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-14 16:54:00,074 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 375 [2018-10-14 16:54:00,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:00,077 INFO L225 Difference]: With dead ends: 402 [2018-10-14 16:54:00,077 INFO L226 Difference]: Without dead ends: 402 [2018-10-14 16:54:00,078 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6698 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=6198, Invalid=19884, Unknown=0, NotChecked=0, Total=26082 [2018-10-14 16:54:00,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2018-10-14 16:54:00,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 390. [2018-10-14 16:54:00,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 390 states. [2018-10-14 16:54:00,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 390 transitions. [2018-10-14 16:54:00,083 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 390 transitions. Word has length 375 [2018-10-14 16:54:00,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:00,084 INFO L481 AbstractCegarLoop]: Abstraction has 390 states and 390 transitions. [2018-10-14 16:54:00,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-14 16:54:00,084 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 390 transitions. [2018-10-14 16:54:00,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2018-10-14 16:54:00,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:00,086 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:00,086 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:00,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:00,087 INFO L82 PathProgramCache]: Analyzing trace with hash -1110468703, now seen corresponding path program 26 times [2018-10-14 16:54:00,087 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:00,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:02,370 INFO L134 CoverageAnalysis]: Checked inductivity of 4654 backedges. 0 proven. 4654 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:02,370 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:02,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-14 16:54:02,371 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-14 16:54:02,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-14 16:54:02,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=704, Invalid=3078, Unknown=0, NotChecked=0, Total=3782 [2018-10-14 16:54:02,371 INFO L87 Difference]: Start difference. First operand 390 states and 390 transitions. Second operand 62 states. [2018-10-14 16:54:15,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:15,814 INFO L93 Difference]: Finished difference Result 416 states and 416 transitions. [2018-10-14 16:54:15,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-14 16:54:15,815 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 389 [2018-10-14 16:54:15,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:15,817 INFO L225 Difference]: With dead ends: 416 [2018-10-14 16:54:15,817 INFO L226 Difference]: Without dead ends: 416 [2018-10-14 16:54:15,818 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7238 ImplicationChecksByTransitivity, 13.4s TimeCoverageRelationStatistics Valid=6666, Invalid=21390, Unknown=0, NotChecked=0, Total=28056 [2018-10-14 16:54:15,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2018-10-14 16:54:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 404. [2018-10-14 16:54:15,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-14 16:54:15,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-10-14 16:54:15,823 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 389 [2018-10-14 16:54:15,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:15,824 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-10-14 16:54:15,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-14 16:54:15,824 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-10-14 16:54:15,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-14 16:54:15,826 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:15,826 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:15,827 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:15,827 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:15,827 INFO L82 PathProgramCache]: Analyzing trace with hash 210977045, now seen corresponding path program 27 times [2018-10-14 16:54:15,828 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:15,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:18,534 INFO L134 CoverageAnalysis]: Checked inductivity of 5022 backedges. 0 proven. 5022 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:18,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:18,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-14 16:54:18,535 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-14 16:54:18,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-14 16:54:18,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=3275, Unknown=0, NotChecked=0, Total=4032 [2018-10-14 16:54:18,535 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 64 states. [2018-10-14 16:54:32,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:32,561 INFO L93 Difference]: Finished difference Result 430 states and 430 transitions. [2018-10-14 16:54:32,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-14 16:54:32,561 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 403 [2018-10-14 16:54:32,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:32,563 INFO L225 Difference]: With dead ends: 430 [2018-10-14 16:54:32,563 INFO L226 Difference]: Without dead ends: 430 [2018-10-14 16:54:32,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 172 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7799 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=7151, Invalid=22951, Unknown=0, NotChecked=0, Total=30102 [2018-10-14 16:54:32,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-14 16:54:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 418. [2018-10-14 16:54:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 418 states. [2018-10-14 16:54:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 418 transitions. [2018-10-14 16:54:32,569 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 418 transitions. Word has length 403 [2018-10-14 16:54:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:32,569 INFO L481 AbstractCegarLoop]: Abstraction has 418 states and 418 transitions. [2018-10-14 16:54:32,570 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-14 16:54:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 418 transitions. [2018-10-14 16:54:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2018-10-14 16:54:32,572 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:32,572 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:32,573 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:32,573 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:32,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1520914313, now seen corresponding path program 28 times [2018-10-14 16:54:32,574 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:32,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:36,031 INFO L134 CoverageAnalysis]: Checked inductivity of 5404 backedges. 0 proven. 5404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:36,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:36,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-14 16:54:36,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-14 16:54:36,032 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-14 16:54:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=812, Invalid=3478, Unknown=0, NotChecked=0, Total=4290 [2018-10-14 16:54:36,032 INFO L87 Difference]: Start difference. First operand 418 states and 418 transitions. Second operand 66 states. [2018-10-14 16:54:50,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:54:50,493 INFO L93 Difference]: Finished difference Result 444 states and 444 transitions. [2018-10-14 16:54:50,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-14 16:54:50,498 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 417 [2018-10-14 16:54:50,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:54:50,500 INFO L225 Difference]: With dead ends: 444 [2018-10-14 16:54:50,500 INFO L226 Difference]: Without dead ends: 444 [2018-10-14 16:54:50,501 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 178 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8381 ImplicationChecksByTransitivity, 15.9s TimeCoverageRelationStatistics Valid=7653, Invalid=24567, Unknown=0, NotChecked=0, Total=32220 [2018-10-14 16:54:50,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2018-10-14 16:54:50,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 432. [2018-10-14 16:54:50,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 432 states. [2018-10-14 16:54:50,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 432 transitions. [2018-10-14 16:54:50,508 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 432 transitions. Word has length 417 [2018-10-14 16:54:50,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:54:50,509 INFO L481 AbstractCegarLoop]: Abstraction has 432 states and 432 transitions. [2018-10-14 16:54:50,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-14 16:54:50,509 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 432 transitions. [2018-10-14 16:54:50,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2018-10-14 16:54:50,511 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:54:50,512 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:54:50,512 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:54:50,512 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:54:50,512 INFO L82 PathProgramCache]: Analyzing trace with hash 754385661, now seen corresponding path program 29 times [2018-10-14 16:54:50,513 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:54:50,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:54:53,354 INFO L134 CoverageAnalysis]: Checked inductivity of 5800 backedges. 0 proven. 5800 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:54:53,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:54:53,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-14 16:54:53,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-14 16:54:53,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-14 16:54:53,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=869, Invalid=3687, Unknown=0, NotChecked=0, Total=4556 [2018-10-14 16:54:53,356 INFO L87 Difference]: Start difference. First operand 432 states and 432 transitions. Second operand 68 states. [2018-10-14 16:55:07,243 WARN L179 SmtUtils]: Spent 146.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-10-14 16:55:08,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:08,898 INFO L93 Difference]: Finished difference Result 458 states and 458 transitions. [2018-10-14 16:55:08,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-14 16:55:08,898 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 431 [2018-10-14 16:55:08,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:08,900 INFO L225 Difference]: With dead ends: 458 [2018-10-14 16:55:08,900 INFO L226 Difference]: Without dead ends: 458 [2018-10-14 16:55:08,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 184 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8984 ImplicationChecksByTransitivity, 16.0s TimeCoverageRelationStatistics Valid=8172, Invalid=26238, Unknown=0, NotChecked=0, Total=34410 [2018-10-14 16:55:08,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 458 states. [2018-10-14 16:55:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 458 to 446. [2018-10-14 16:55:08,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-14 16:55:08,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-10-14 16:55:08,905 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 431 [2018-10-14 16:55:08,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:08,906 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-10-14 16:55:08,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-14 16:55:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-10-14 16:55:08,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-14 16:55:08,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:08,908 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:08,908 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:08,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:08,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1807588209, now seen corresponding path program 30 times [2018-10-14 16:55:08,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:08,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:12,106 INFO L134 CoverageAnalysis]: Checked inductivity of 6210 backedges. 0 proven. 6210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:12,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:12,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-14 16:55:12,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-14 16:55:12,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-14 16:55:12,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=928, Invalid=3902, Unknown=0, NotChecked=0, Total=4830 [2018-10-14 16:55:12,108 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 70 states. [2018-10-14 16:55:15,950 WARN L179 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 39 [2018-10-14 16:55:28,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:28,363 INFO L93 Difference]: Finished difference Result 472 states and 472 transitions. [2018-10-14 16:55:28,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-14 16:55:28,364 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 445 [2018-10-14 16:55:28,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:28,365 INFO L225 Difference]: With dead ends: 472 [2018-10-14 16:55:28,365 INFO L226 Difference]: Without dead ends: 472 [2018-10-14 16:55:28,367 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9608 ImplicationChecksByTransitivity, 16.9s TimeCoverageRelationStatistics Valid=8708, Invalid=27964, Unknown=0, NotChecked=0, Total=36672 [2018-10-14 16:55:28,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2018-10-14 16:55:28,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 460. [2018-10-14 16:55:28,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 460 states. [2018-10-14 16:55:28,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 460 states to 460 states and 460 transitions. [2018-10-14 16:55:28,372 INFO L78 Accepts]: Start accepts. Automaton has 460 states and 460 transitions. Word has length 445 [2018-10-14 16:55:28,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:28,372 INFO L481 AbstractCegarLoop]: Abstraction has 460 states and 460 transitions. [2018-10-14 16:55:28,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-14 16:55:28,373 INFO L276 IsEmpty]: Start isEmpty. Operand 460 states and 460 transitions. [2018-10-14 16:55:28,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 460 [2018-10-14 16:55:28,375 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:28,376 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:28,376 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:28,376 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:28,376 INFO L82 PathProgramCache]: Analyzing trace with hash 1451645157, now seen corresponding path program 31 times [2018-10-14 16:55:28,377 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:31,615 INFO L134 CoverageAnalysis]: Checked inductivity of 6634 backedges. 0 proven. 6634 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:31,615 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:31,615 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-14 16:55:31,616 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-14 16:55:31,616 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-14 16:55:31,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=989, Invalid=4123, Unknown=0, NotChecked=0, Total=5112 [2018-10-14 16:55:31,617 INFO L87 Difference]: Start difference. First operand 460 states and 460 transitions. Second operand 72 states. [2018-10-14 16:55:48,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:55:48,885 INFO L93 Difference]: Finished difference Result 486 states and 486 transitions. [2018-10-14 16:55:48,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-14 16:55:48,885 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 459 [2018-10-14 16:55:48,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:55:48,887 INFO L225 Difference]: With dead ends: 486 [2018-10-14 16:55:48,887 INFO L226 Difference]: Without dead ends: 486 [2018-10-14 16:55:48,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10253 ImplicationChecksByTransitivity, 17.7s TimeCoverageRelationStatistics Valid=9261, Invalid=29745, Unknown=0, NotChecked=0, Total=39006 [2018-10-14 16:55:48,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-14 16:55:48,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 474. [2018-10-14 16:55:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 474 states. [2018-10-14 16:55:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 474 states to 474 states and 474 transitions. [2018-10-14 16:55:48,893 INFO L78 Accepts]: Start accepts. Automaton has 474 states and 474 transitions. Word has length 459 [2018-10-14 16:55:48,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:55:48,893 INFO L481 AbstractCegarLoop]: Abstraction has 474 states and 474 transitions. [2018-10-14 16:55:48,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-14 16:55:48,893 INFO L276 IsEmpty]: Start isEmpty. Operand 474 states and 474 transitions. [2018-10-14 16:55:48,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 474 [2018-10-14 16:55:48,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:55:48,896 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:55:48,896 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:55:48,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:55:48,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2016181081, now seen corresponding path program 32 times [2018-10-14 16:55:48,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:55:48,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:55:52,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7072 backedges. 0 proven. 7072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:55:52,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:55:52,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-14 16:55:52,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-14 16:55:52,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-14 16:55:52,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1052, Invalid=4350, Unknown=0, NotChecked=0, Total=5402 [2018-10-14 16:55:52,107 INFO L87 Difference]: Start difference. First operand 474 states and 474 transitions. Second operand 74 states. [2018-10-14 16:56:10,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:10,283 INFO L93 Difference]: Finished difference Result 500 states and 500 transitions. [2018-10-14 16:56:10,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-14 16:56:10,283 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 473 [2018-10-14 16:56:10,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:10,285 INFO L225 Difference]: With dead ends: 500 [2018-10-14 16:56:10,285 INFO L226 Difference]: Without dead ends: 500 [2018-10-14 16:56:10,287 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 202 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10919 ImplicationChecksByTransitivity, 18.6s TimeCoverageRelationStatistics Valid=9831, Invalid=31581, Unknown=0, NotChecked=0, Total=41412 [2018-10-14 16:56:10,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-14 16:56:10,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 488. [2018-10-14 16:56:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-14 16:56:10,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-10-14 16:56:10,292 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 473 [2018-10-14 16:56:10,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:10,293 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-10-14 16:56:10,293 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-14 16:56:10,293 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-10-14 16:56:10,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-14 16:56:10,296 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:10,296 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:10,296 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:10,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:10,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1696906547, now seen corresponding path program 33 times [2018-10-14 16:56:10,297 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:10,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:14,274 INFO L134 CoverageAnalysis]: Checked inductivity of 7524 backedges. 0 proven. 7524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:14,275 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:14,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-14 16:56:14,275 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-14 16:56:14,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-14 16:56:14,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1117, Invalid=4583, Unknown=0, NotChecked=0, Total=5700 [2018-10-14 16:56:14,276 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 76 states. [2018-10-14 16:56:33,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:33,403 INFO L93 Difference]: Finished difference Result 514 states and 514 transitions. [2018-10-14 16:56:33,403 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-14 16:56:33,403 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 487 [2018-10-14 16:56:33,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:33,405 INFO L225 Difference]: With dead ends: 514 [2018-10-14 16:56:33,405 INFO L226 Difference]: Without dead ends: 514 [2018-10-14 16:56:33,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 208 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11606 ImplicationChecksByTransitivity, 20.1s TimeCoverageRelationStatistics Valid=10418, Invalid=33472, Unknown=0, NotChecked=0, Total=43890 [2018-10-14 16:56:33,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 514 states. [2018-10-14 16:56:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 514 to 502. [2018-10-14 16:56:33,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 502 states. [2018-10-14 16:56:33,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 502 states and 502 transitions. [2018-10-14 16:56:33,411 INFO L78 Accepts]: Start accepts. Automaton has 502 states and 502 transitions. Word has length 487 [2018-10-14 16:56:33,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:33,412 INFO L481 AbstractCegarLoop]: Abstraction has 502 states and 502 transitions. [2018-10-14 16:56:33,412 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-14 16:56:33,412 INFO L276 IsEmpty]: Start isEmpty. Operand 502 states and 502 transitions. [2018-10-14 16:56:33,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2018-10-14 16:56:33,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:33,415 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:33,415 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:33,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:33,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1139937471, now seen corresponding path program 34 times [2018-10-14 16:56:33,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:33,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:56:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 7990 backedges. 0 proven. 7990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:56:36,945 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:56:36,945 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-14 16:56:36,946 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-14 16:56:36,946 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-14 16:56:36,947 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1184, Invalid=4822, Unknown=0, NotChecked=0, Total=6006 [2018-10-14 16:56:36,947 INFO L87 Difference]: Start difference. First operand 502 states and 502 transitions. Second operand 78 states. [2018-10-14 16:56:57,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:56:57,062 INFO L93 Difference]: Finished difference Result 528 states and 528 transitions. [2018-10-14 16:56:57,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-14 16:56:57,063 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 501 [2018-10-14 16:56:57,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:56:57,065 INFO L225 Difference]: With dead ends: 528 [2018-10-14 16:56:57,065 INFO L226 Difference]: Without dead ends: 528 [2018-10-14 16:56:57,067 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12314 ImplicationChecksByTransitivity, 20.6s TimeCoverageRelationStatistics Valid=11022, Invalid=35418, Unknown=0, NotChecked=0, Total=46440 [2018-10-14 16:56:57,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2018-10-14 16:56:57,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 516. [2018-10-14 16:56:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-10-14 16:56:57,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 516 transitions. [2018-10-14 16:56:57,079 INFO L78 Accepts]: Start accepts. Automaton has 516 states and 516 transitions. Word has length 501 [2018-10-14 16:56:57,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:56:57,080 INFO L481 AbstractCegarLoop]: Abstraction has 516 states and 516 transitions. [2018-10-14 16:56:57,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-14 16:56:57,080 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 516 transitions. [2018-10-14 16:56:57,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2018-10-14 16:56:57,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:56:57,083 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:56:57,083 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:56:57,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:56:57,084 INFO L82 PathProgramCache]: Analyzing trace with hash 9420981, now seen corresponding path program 35 times [2018-10-14 16:56:57,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:56:57,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:00,773 INFO L134 CoverageAnalysis]: Checked inductivity of 8470 backedges. 0 proven. 8470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:00,774 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:00,774 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-14 16:57:00,775 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-14 16:57:00,775 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-14 16:57:00,775 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1253, Invalid=5067, Unknown=0, NotChecked=0, Total=6320 [2018-10-14 16:57:00,776 INFO L87 Difference]: Start difference. First operand 516 states and 516 transitions. Second operand 80 states. [2018-10-14 16:57:21,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:21,664 INFO L93 Difference]: Finished difference Result 542 states and 542 transitions. [2018-10-14 16:57:21,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-14 16:57:21,665 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 515 [2018-10-14 16:57:21,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:21,666 INFO L225 Difference]: With dead ends: 542 [2018-10-14 16:57:21,667 INFO L226 Difference]: Without dead ends: 542 [2018-10-14 16:57:21,668 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 220 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13043 ImplicationChecksByTransitivity, 21.4s TimeCoverageRelationStatistics Valid=11643, Invalid=37419, Unknown=0, NotChecked=0, Total=49062 [2018-10-14 16:57:21,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2018-10-14 16:57:21,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 530. [2018-10-14 16:57:21,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 530 states. [2018-10-14 16:57:21,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 530 states to 530 states and 530 transitions. [2018-10-14 16:57:21,673 INFO L78 Accepts]: Start accepts. Automaton has 530 states and 530 transitions. Word has length 515 [2018-10-14 16:57:21,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:21,673 INFO L481 AbstractCegarLoop]: Abstraction has 530 states and 530 transitions. [2018-10-14 16:57:21,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-14 16:57:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 530 transitions. [2018-10-14 16:57:21,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 530 [2018-10-14 16:57:21,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:21,676 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:21,677 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:21,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:21,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1468270807, now seen corresponding path program 36 times [2018-10-14 16:57:21,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:21,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:25,385 INFO L134 CoverageAnalysis]: Checked inductivity of 8964 backedges. 0 proven. 8964 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:25,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:25,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-14 16:57:25,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-14 16:57:25,386 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-14 16:57:25,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1324, Invalid=5318, Unknown=0, NotChecked=0, Total=6642 [2018-10-14 16:57:25,387 INFO L87 Difference]: Start difference. First operand 530 states and 530 transitions. Second operand 82 states. [2018-10-14 16:57:46,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:57:46,965 INFO L93 Difference]: Finished difference Result 556 states and 556 transitions. [2018-10-14 16:57:46,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-14 16:57:46,966 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 529 [2018-10-14 16:57:46,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:57:46,968 INFO L225 Difference]: With dead ends: 556 [2018-10-14 16:57:46,968 INFO L226 Difference]: Without dead ends: 556 [2018-10-14 16:57:46,969 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 228 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 226 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13793 ImplicationChecksByTransitivity, 22.1s TimeCoverageRelationStatistics Valid=12281, Invalid=39475, Unknown=0, NotChecked=0, Total=51756 [2018-10-14 16:57:46,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 556 states. [2018-10-14 16:57:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 556 to 544. [2018-10-14 16:57:46,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 544 states. [2018-10-14 16:57:46,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 544 transitions. [2018-10-14 16:57:46,973 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 544 transitions. Word has length 529 [2018-10-14 16:57:46,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:57:46,974 INFO L481 AbstractCegarLoop]: Abstraction has 544 states and 544 transitions. [2018-10-14 16:57:46,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-14 16:57:46,974 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 544 transitions. [2018-10-14 16:57:46,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2018-10-14 16:57:46,977 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:57:46,977 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:57:46,978 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:57:46,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:57:46,979 INFO L82 PathProgramCache]: Analyzing trace with hash 54383261, now seen corresponding path program 37 times [2018-10-14 16:57:46,979 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:57:47,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:57:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 9472 backedges. 0 proven. 9472 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:57:50,923 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:57:50,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-14 16:57:50,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-14 16:57:50,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-14 16:57:50,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1397, Invalid=5575, Unknown=0, NotChecked=0, Total=6972 [2018-10-14 16:57:50,924 INFO L87 Difference]: Start difference. First operand 544 states and 544 transitions. Second operand 84 states. [2018-10-14 16:58:12,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:12,721 INFO L93 Difference]: Finished difference Result 570 states and 570 transitions. [2018-10-14 16:58:12,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 154 states. [2018-10-14 16:58:12,721 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 543 [2018-10-14 16:58:12,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:12,723 INFO L225 Difference]: With dead ends: 570 [2018-10-14 16:58:12,723 INFO L226 Difference]: Without dead ends: 570 [2018-10-14 16:58:12,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 232 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14564 ImplicationChecksByTransitivity, 22.9s TimeCoverageRelationStatistics Valid=12936, Invalid=41586, Unknown=0, NotChecked=0, Total=54522 [2018-10-14 16:58:12,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-14 16:58:12,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 558. [2018-10-14 16:58:12,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 558 states. [2018-10-14 16:58:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 558 transitions. [2018-10-14 16:58:12,729 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 558 transitions. Word has length 543 [2018-10-14 16:58:12,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:12,729 INFO L481 AbstractCegarLoop]: Abstraction has 558 states and 558 transitions. [2018-10-14 16:58:12,729 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-14 16:58:12,730 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 558 transitions. [2018-10-14 16:58:12,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2018-10-14 16:58:12,733 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:12,733 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:12,733 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:12,733 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:12,734 INFO L82 PathProgramCache]: Analyzing trace with hash 1670419217, now seen corresponding path program 38 times [2018-10-14 16:58:12,734 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:17,279 INFO L134 CoverageAnalysis]: Checked inductivity of 9994 backedges. 0 proven. 9994 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:17,279 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:17,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-14 16:58:17,280 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-14 16:58:17,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-14 16:58:17,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1472, Invalid=5838, Unknown=0, NotChecked=0, Total=7310 [2018-10-14 16:58:17,281 INFO L87 Difference]: Start difference. First operand 558 states and 558 transitions. Second operand 86 states. [2018-10-14 16:58:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:58:39,528 INFO L93 Difference]: Finished difference Result 584 states and 584 transitions. [2018-10-14 16:58:39,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-14 16:58:39,528 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 557 [2018-10-14 16:58:39,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:58:39,530 INFO L225 Difference]: With dead ends: 584 [2018-10-14 16:58:39,530 INFO L226 Difference]: Without dead ends: 584 [2018-10-14 16:58:39,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15356 ImplicationChecksByTransitivity, 24.3s TimeCoverageRelationStatistics Valid=13608, Invalid=43752, Unknown=0, NotChecked=0, Total=57360 [2018-10-14 16:58:39,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 584 states. [2018-10-14 16:58:39,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 584 to 572. [2018-10-14 16:58:39,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2018-10-14 16:58:39,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 572 transitions. [2018-10-14 16:58:39,538 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 572 transitions. Word has length 557 [2018-10-14 16:58:39,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:58:39,538 INFO L481 AbstractCegarLoop]: Abstraction has 572 states and 572 transitions. [2018-10-14 16:58:39,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-14 16:58:39,538 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 572 transitions. [2018-10-14 16:58:39,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 572 [2018-10-14 16:58:39,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:58:39,542 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:58:39,542 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:58:39,542 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:58:39,543 INFO L82 PathProgramCache]: Analyzing trace with hash 327121029, now seen corresponding path program 39 times [2018-10-14 16:58:39,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:58:39,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:58:43,942 INFO L134 CoverageAnalysis]: Checked inductivity of 10530 backedges. 0 proven. 10530 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:58:43,943 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:58:43,943 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-14 16:58:43,943 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-14 16:58:43,944 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-14 16:58:43,944 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1549, Invalid=6107, Unknown=0, NotChecked=0, Total=7656 [2018-10-14 16:58:43,944 INFO L87 Difference]: Start difference. First operand 572 states and 572 transitions. Second operand 88 states. [2018-10-14 16:59:07,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:07,352 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-14 16:59:07,359 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-14 16:59:07,359 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 571 [2018-10-14 16:59:07,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:07,361 INFO L225 Difference]: With dead ends: 598 [2018-10-14 16:59:07,361 INFO L226 Difference]: Without dead ends: 598 [2018-10-14 16:59:07,363 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 244 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16169 ImplicationChecksByTransitivity, 24.9s TimeCoverageRelationStatistics Valid=14297, Invalid=45973, Unknown=0, NotChecked=0, Total=60270 [2018-10-14 16:59:07,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2018-10-14 16:59:07,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 586. [2018-10-14 16:59:07,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 586 states. [2018-10-14 16:59:07,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 586 states to 586 states and 586 transitions. [2018-10-14 16:59:07,367 INFO L78 Accepts]: Start accepts. Automaton has 586 states and 586 transitions. Word has length 571 [2018-10-14 16:59:07,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:07,368 INFO L481 AbstractCegarLoop]: Abstraction has 586 states and 586 transitions. [2018-10-14 16:59:07,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-14 16:59:07,368 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 586 transitions. [2018-10-14 16:59:07,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 586 [2018-10-14 16:59:07,371 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:07,371 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:07,371 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:07,371 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:07,372 INFO L82 PathProgramCache]: Analyzing trace with hash 1214628601, now seen corresponding path program 40 times [2018-10-14 16:59:07,372 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:11,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11080 backedges. 0 proven. 11080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:11,636 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:11,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-14 16:59:11,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-14 16:59:11,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-14 16:59:11,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1628, Invalid=6382, Unknown=0, NotChecked=0, Total=8010 [2018-10-14 16:59:11,637 INFO L87 Difference]: Start difference. First operand 586 states and 586 transitions. Second operand 90 states. [2018-10-14 16:59:36,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-14 16:59:36,920 INFO L93 Difference]: Finished difference Result 612 states and 612 transitions. [2018-10-14 16:59:36,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 166 states. [2018-10-14 16:59:36,921 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 585 [2018-10-14 16:59:36,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-14 16:59:36,923 INFO L225 Difference]: With dead ends: 612 [2018-10-14 16:59:36,923 INFO L226 Difference]: Without dead ends: 612 [2018-10-14 16:59:36,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 250 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17003 ImplicationChecksByTransitivity, 25.8s TimeCoverageRelationStatistics Valid=15003, Invalid=48249, Unknown=0, NotChecked=0, Total=63252 [2018-10-14 16:59:36,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-14 16:59:36,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 600. [2018-10-14 16:59:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 600 states. [2018-10-14 16:59:36,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 600 transitions. [2018-10-14 16:59:36,928 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 600 transitions. Word has length 585 [2018-10-14 16:59:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-14 16:59:36,929 INFO L481 AbstractCegarLoop]: Abstraction has 600 states and 600 transitions. [2018-10-14 16:59:36,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-14 16:59:36,929 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 600 transitions. [2018-10-14 16:59:36,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 600 [2018-10-14 16:59:36,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-14 16:59:36,931 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-14 16:59:36,931 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-14 16:59:36,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-14 16:59:36,932 INFO L82 PathProgramCache]: Analyzing trace with hash 384741997, now seen corresponding path program 41 times [2018-10-14 16:59:36,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-14 16:59:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-14 16:59:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 11644 backedges. 0 proven. 11644 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-14 16:59:41,456 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-14 16:59:41,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-14 16:59:41,457 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-14 16:59:41,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-14 16:59:41,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1709, Invalid=6663, Unknown=0, NotChecked=0, Total=8372 [2018-10-14 16:59:41,458 INFO L87 Difference]: Start difference. First operand 600 states and 600 transitions. Second operand 92 states.