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/array3_false-valid-deref.i_6.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-502d2f4 [2018-10-12 20:55:16,637 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-12 20:55:16,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-12 20:55:16,652 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-12 20:55:16,652 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-12 20:55:16,654 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-12 20:55:16,655 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-12 20:55:16,657 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-12 20:55:16,658 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-12 20:55:16,659 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-12 20:55:16,660 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-12 20:55:16,660 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-12 20:55:16,661 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-12 20:55:16,662 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-12 20:55:16,663 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-12 20:55:16,664 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-12 20:55:16,665 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-12 20:55:16,667 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-12 20:55:16,669 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-12 20:55:16,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-12 20:55:16,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-12 20:55:16,673 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-12 20:55:16,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-12 20:55:16,676 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-12 20:55:16,676 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-12 20:55:16,677 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-12 20:55:16,678 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-12 20:55:16,679 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-12 20:55:16,680 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-12 20:55:16,681 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-12 20:55:16,681 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-12 20:55:16,682 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-12 20:55:16,682 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-12 20:55:16,682 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-12 20:55:16,683 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-12 20:55:16,684 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-12 20:55:16,684 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-12 20:55:16,701 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-12 20:55:16,705 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-12 20:55:16,706 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-12 20:55:16,706 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-12 20:55:16,706 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-12 20:55:16,706 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-12 20:55:16,707 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-12 20:55:16,707 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-12 20:55:16,707 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-12 20:55:16,708 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-12 20:55:16,708 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-12 20:55:16,708 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-12 20:55:16,709 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-12 20:55:16,710 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-12 20:55:16,710 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-12 20:55:16,766 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-12 20:55:16,782 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-12 20:55:16,789 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-12 20:55:16,790 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-12 20:55:16,791 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-12 20:55:16,792 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl [2018-10-12 20:55:16,792 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/array3_false-valid-deref.i_6.bpl' [2018-10-12 20:55:16,851 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-12 20:55:16,855 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-12 20:55:16,856 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-12 20:55:16,856 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-12 20:55:16,856 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-12 20:55:16,884 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,898 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,898 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,903 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,906 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,907 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... [2018-10-12 20:55:16,909 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-12 20:55:16,910 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-12 20:55:16,910 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-12 20:55:16,910 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-12 20:55:16,911 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-12 20:55:16,972 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-12 20:55:16,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-12 20:55:16,972 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-12 20:55:17,365 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-12 20:55:17,366 INFO L202 PluginConnector]: Adding new model array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:55:17 BoogieIcfgContainer [2018-10-12 20:55:17,366 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-12 20:55:17,368 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-12 20:55:17,368 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-12 20:55:17,371 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-12 20:55:17,372 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 12.10 08:55:16" (1/2) ... [2018-10-12 20:55:17,373 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9da8e65 and model type array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.10 08:55:17, skipping insertion in model container [2018-10-12 20:55:17,373 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array3_false-valid-deref.i_6.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.10 08:55:17" (2/2) ... [2018-10-12 20:55:17,375 INFO L112 eAbstractionObserver]: Analyzing ICFG array3_false-valid-deref.i_6.bpl [2018-10-12 20:55:17,385 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-12 20:55:17,395 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-12 20:55:17,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-12 20:55:17,443 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-12 20:55:17,444 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-12 20:55:17,444 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-12 20:55:17,444 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-12 20:55:17,444 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-12 20:55:17,445 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-12 20:55:17,445 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-12 20:55:17,445 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-12 20:55:17,445 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-12 20:55:17,467 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states. [2018-10-12 20:55:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-12 20:55:17,481 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:17,483 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:17,484 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:17,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:17,493 INFO L82 PathProgramCache]: Analyzing trace with hash 192870681, now seen corresponding path program 1 times [2018-10-12 20:55:17,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:18,062 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:18,064 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-12 20:55:18,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-12 20:55:18,070 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-12 20:55:18,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-12 20:55:18,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2018-10-12 20:55:18,089 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 9 states. [2018-10-12 20:55:18,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:18,691 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-12 20:55:18,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-12 20:55:18,693 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 24 [2018-10-12 20:55:18,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:18,705 INFO L225 Difference]: With dead ends: 46 [2018-10-12 20:55:18,705 INFO L226 Difference]: Without dead ends: 46 [2018-10-12 20:55:18,708 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2018-10-12 20:55:18,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-12 20:55:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2018-10-12 20:55:18,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-12 20:55:18,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-12 20:55:18,750 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 24 [2018-10-12 20:55:18,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:18,751 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-12 20:55:18,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-12 20:55:18,752 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-12 20:55:18,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-12 20:55:18,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:18,753 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:18,754 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:18,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:18,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1874644339, now seen corresponding path program 1 times [2018-10-12 20:55:18,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:19,082 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:19,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:19,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-12 20:55:19,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-12 20:55:19,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-12 20:55:19,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2018-10-12 20:55:19,086 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 10 states. [2018-10-12 20:55:19,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:19,949 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-12 20:55:19,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-12 20:55:19,950 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 38 [2018-10-12 20:55:19,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:19,952 INFO L225 Difference]: With dead ends: 65 [2018-10-12 20:55:19,952 INFO L226 Difference]: Without dead ends: 65 [2018-10-12 20:55:19,954 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=94, Invalid=212, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:55:19,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-12 20:55:19,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-10-12 20:55:19,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-12 20:55:19,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-12 20:55:19,968 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 38 [2018-10-12 20:55:19,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:19,968 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-12 20:55:19,968 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-12 20:55:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-12 20:55:19,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-12 20:55:19,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:19,970 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:19,970 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:19,971 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:19,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1822977, now seen corresponding path program 2 times [2018-10-12 20:55:19,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:20,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:20,423 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:20,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:20,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-12 20:55:20,424 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-12 20:55:20,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-12 20:55:20,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2018-10-12 20:55:20,425 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 12 states. [2018-10-12 20:55:21,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:21,438 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-12 20:55:21,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-12 20:55:21,440 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-10-12 20:55:21,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:21,441 INFO L225 Difference]: With dead ends: 79 [2018-10-12 20:55:21,442 INFO L226 Difference]: Without dead ends: 79 [2018-10-12 20:55:21,442 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-12 20:55:21,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-12 20:55:21,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 67. [2018-10-12 20:55:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-12 20:55:21,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-12 20:55:21,453 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 52 [2018-10-12 20:55:21,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:21,453 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-12 20:55:21,454 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-12 20:55:21,454 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-12 20:55:21,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-12 20:55:21,457 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:21,457 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:21,457 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:21,458 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:21,458 INFO L82 PathProgramCache]: Analyzing trace with hash -118221707, now seen corresponding path program 3 times [2018-10-12 20:55:21,459 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:21,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:21,915 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:21,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:21,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:55:21,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:55:21,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:55:21,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:55:21,918 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 16 states. [2018-10-12 20:55:23,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:23,064 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-12 20:55:23,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-12 20:55:23,065 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2018-10-12 20:55:23,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:23,067 INFO L225 Difference]: With dead ends: 93 [2018-10-12 20:55:23,067 INFO L226 Difference]: Without dead ends: 93 [2018-10-12 20:55:23,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 156 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=270, Invalid=722, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:55:23,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-12 20:55:23,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2018-10-12 20:55:23,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-12 20:55:23,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-12 20:55:23,076 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 66 [2018-10-12 20:55:23,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:23,077 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-12 20:55:23,077 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:55:23,077 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-12 20:55:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-12 20:55:23,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:23,080 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:23,081 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:23,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:23,081 INFO L82 PathProgramCache]: Analyzing trace with hash -1140376343, now seen corresponding path program 4 times [2018-10-12 20:55:23,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:23,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:23,491 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 0 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:23,492 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:23,492 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-12 20:55:23,492 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-12 20:55:23,493 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-12 20:55:23,493 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2018-10-12 20:55:23,493 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 16 states. [2018-10-12 20:55:24,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:24,459 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-12 20:55:24,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-12 20:55:24,460 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 80 [2018-10-12 20:55:24,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:24,462 INFO L225 Difference]: With dead ends: 107 [2018-10-12 20:55:24,462 INFO L226 Difference]: Without dead ends: 107 [2018-10-12 20:55:24,463 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=851, Unknown=0, NotChecked=0, Total=1056 [2018-10-12 20:55:24,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-12 20:55:24,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 95. [2018-10-12 20:55:24,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-12 20:55:24,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-12 20:55:24,470 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 80 [2018-10-12 20:55:24,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:24,471 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-12 20:55:24,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-12 20:55:24,471 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-12 20:55:24,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-12 20:55:24,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:24,473 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:24,473 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:24,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:24,473 INFO L82 PathProgramCache]: Analyzing trace with hash 568363613, now seen corresponding path program 5 times [2018-10-12 20:55:24,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:24,915 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 0 proven. 170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:24,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:24,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-12 20:55:24,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-12 20:55:24,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-12 20:55:24,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2018-10-12 20:55:24,917 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 18 states. [2018-10-12 20:55:26,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:26,652 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-12 20:55:26,653 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-12 20:55:26,653 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 94 [2018-10-12 20:55:26,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:26,655 INFO L225 Difference]: With dead ends: 121 [2018-10-12 20:55:26,655 INFO L226 Difference]: Without dead ends: 121 [2018-10-12 20:55:26,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=242, Invalid=1164, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:55:26,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-12 20:55:26,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 109. [2018-10-12 20:55:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-12 20:55:26,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-12 20:55:26,664 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 94 [2018-10-12 20:55:26,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:26,664 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-12 20:55:26,664 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-12 20:55:26,665 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-12 20:55:26,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-12 20:55:26,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:26,666 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:26,667 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:26,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:26,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1906623279, now seen corresponding path program 6 times [2018-10-12 20:55:26,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:26,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:27,426 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:55:27,865 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 0 proven. 246 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:27,865 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:27,865 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-12 20:55:27,866 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-12 20:55:27,866 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-12 20:55:27,866 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2018-10-12 20:55:27,867 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 20 states. [2018-10-12 20:55:29,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:29,445 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-12 20:55:29,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-12 20:55:29,446 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 108 [2018-10-12 20:55:29,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:29,447 INFO L225 Difference]: With dead ends: 135 [2018-10-12 20:55:29,447 INFO L226 Difference]: Without dead ends: 135 [2018-10-12 20:55:29,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=279, Invalid=1527, Unknown=0, NotChecked=0, Total=1806 [2018-10-12 20:55:29,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-12 20:55:29,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 123. [2018-10-12 20:55:29,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-12 20:55:29,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-12 20:55:29,459 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 108 [2018-10-12 20:55:29,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:29,459 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-12 20:55:29,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-12 20:55:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-12 20:55:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-12 20:55:29,462 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:29,462 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:29,462 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:29,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:29,463 INFO L82 PathProgramCache]: Analyzing trace with hash -459107259, now seen corresponding path program 7 times [2018-10-12 20:55:29,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:29,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:30,250 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 0 proven. 336 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:30,250 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:30,250 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-12 20:55:30,251 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-12 20:55:30,251 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-12 20:55:30,251 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=405, Unknown=0, NotChecked=0, Total=462 [2018-10-12 20:55:30,252 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 22 states. [2018-10-12 20:55:32,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:32,004 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-12 20:55:32,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-12 20:55:32,004 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 122 [2018-10-12 20:55:32,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:32,005 INFO L225 Difference]: With dead ends: 149 [2018-10-12 20:55:32,005 INFO L226 Difference]: Without dead ends: 149 [2018-10-12 20:55:32,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 316 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=316, Invalid=1940, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:55:32,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-12 20:55:32,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 137. [2018-10-12 20:55:32,014 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-12 20:55:32,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-12 20:55:32,015 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 122 [2018-10-12 20:55:32,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:32,016 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-12 20:55:32,016 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-12 20:55:32,016 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-12 20:55:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-12 20:55:32,018 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:32,018 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:32,019 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:32,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 2066862265, now seen corresponding path program 8 times [2018-10-12 20:55:32,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:32,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:32,586 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:32,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:32,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-12 20:55:32,587 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-12 20:55:32,587 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-12 20:55:32,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=489, Unknown=0, NotChecked=0, Total=552 [2018-10-12 20:55:32,588 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 24 states. [2018-10-12 20:55:34,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:34,750 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-12 20:55:34,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-12 20:55:34,752 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 136 [2018-10-12 20:55:34,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:34,753 INFO L225 Difference]: With dead ends: 163 [2018-10-12 20:55:34,753 INFO L226 Difference]: Without dead ends: 163 [2018-10-12 20:55:34,754 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 396 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=353, Invalid=2403, Unknown=0, NotChecked=0, Total=2756 [2018-10-12 20:55:34,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-12 20:55:34,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 151. [2018-10-12 20:55:34,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-12 20:55:34,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-12 20:55:34,763 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 136 [2018-10-12 20:55:34,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:34,764 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-12 20:55:34,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-12 20:55:34,764 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-12 20:55:34,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-12 20:55:34,767 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:34,767 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:34,767 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:34,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:34,768 INFO L82 PathProgramCache]: Analyzing trace with hash 265564717, now seen corresponding path program 9 times [2018-10-12 20:55:34,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:34,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:35,471 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 0 proven. 558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:35,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:35,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-12 20:55:35,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-12 20:55:35,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-12 20:55:35,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=581, Unknown=0, NotChecked=0, Total=650 [2018-10-12 20:55:35,473 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 26 states. [2018-10-12 20:55:38,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:38,329 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-12 20:55:38,330 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-12 20:55:38,330 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 150 [2018-10-12 20:55:38,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:38,331 INFO L225 Difference]: With dead ends: 177 [2018-10-12 20:55:38,332 INFO L226 Difference]: Without dead ends: 177 [2018-10-12 20:55:38,333 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=390, Invalid=2916, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:55:38,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-12 20:55:38,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 165. [2018-10-12 20:55:38,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-12 20:55:38,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-12 20:55:38,341 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 150 [2018-10-12 20:55:38,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:38,342 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-12 20:55:38,342 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-12 20:55:38,342 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-12 20:55:38,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-12 20:55:38,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:38,346 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:38,346 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:38,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:38,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1146816351, now seen corresponding path program 10 times [2018-10-12 20:55:38,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:38,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:39,308 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:39,309 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:39,309 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-12 20:55:39,309 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-12 20:55:39,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-12 20:55:39,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=681, Unknown=0, NotChecked=0, Total=756 [2018-10-12 20:55:39,310 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 28 states. [2018-10-12 20:55:42,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:42,102 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-12 20:55:42,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-12 20:55:42,103 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 164 [2018-10-12 20:55:42,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:42,105 INFO L225 Difference]: With dead ends: 191 [2018-10-12 20:55:42,105 INFO L226 Difference]: Without dead ends: 191 [2018-10-12 20:55:42,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=427, Invalid=3479, Unknown=0, NotChecked=0, Total=3906 [2018-10-12 20:55:42,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-12 20:55:42,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 179. [2018-10-12 20:55:42,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-12 20:55:42,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-12 20:55:42,112 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 164 [2018-10-12 20:55:42,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:42,112 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-12 20:55:42,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-12 20:55:42,113 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-12 20:55:42,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-12 20:55:42,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:42,116 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:42,116 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:42,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:42,116 INFO L82 PathProgramCache]: Analyzing trace with hash -418421739, now seen corresponding path program 11 times [2018-10-12 20:55:42,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:43,379 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 0 proven. 836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:43,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:43,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-12 20:55:43,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-12 20:55:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-12 20:55:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=789, Unknown=0, NotChecked=0, Total=870 [2018-10-12 20:55:43,381 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 30 states. [2018-10-12 20:55:46,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:46,576 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-10-12 20:55:46,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-12 20:55:46,576 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 178 [2018-10-12 20:55:46,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:46,578 INFO L225 Difference]: With dead ends: 205 [2018-10-12 20:55:46,578 INFO L226 Difference]: Without dead ends: 205 [2018-10-12 20:55:46,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 690 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=464, Invalid=4092, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:55:46,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-10-12 20:55:46,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 193. [2018-10-12 20:55:46,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-12 20:55:46,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-12 20:55:46,584 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 178 [2018-10-12 20:55:46,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:46,585 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-12 20:55:46,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-12 20:55:46,585 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-12 20:55:46,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-12 20:55:46,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:46,588 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:46,588 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:46,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:46,589 INFO L82 PathProgramCache]: Analyzing trace with hash 1036956809, now seen corresponding path program 12 times [2018-10-12 20:55:46,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:46,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:47,796 INFO L134 CoverageAnalysis]: Checked inductivity of 996 backedges. 0 proven. 996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:47,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:47,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-12 20:55:47,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-12 20:55:47,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-12 20:55:47,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2018-10-12 20:55:47,798 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 32 states. [2018-10-12 20:55:48,659 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 28 [2018-10-12 20:55:51,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:51,575 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-12 20:55:51,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-12 20:55:51,576 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 192 [2018-10-12 20:55:51,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:51,578 INFO L225 Difference]: With dead ends: 219 [2018-10-12 20:55:51,578 INFO L226 Difference]: Without dead ends: 219 [2018-10-12 20:55:51,580 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 806 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=501, Invalid=4755, Unknown=0, NotChecked=0, Total=5256 [2018-10-12 20:55:51,580 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-12 20:55:51,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 207. [2018-10-12 20:55:51,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-12 20:55:51,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-12 20:55:51,584 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 192 [2018-10-12 20:55:51,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:51,585 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-12 20:55:51,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-12 20:55:51,585 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-12 20:55:51,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-12 20:55:51,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:51,587 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:51,587 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:51,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:51,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1561449987, now seen corresponding path program 13 times [2018-10-12 20:55:51,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:53,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 0 proven. 1170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:53,182 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:53,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-12 20:55:53,183 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-12 20:55:53,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-12 20:55:53,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=1029, Unknown=0, NotChecked=0, Total=1122 [2018-10-12 20:55:53,184 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 34 states. [2018-10-12 20:55:55,328 WARN L178 SmtUtils]: Spent 163.00 ms on a formula simplification that was a NOOP. DAG size: 30 [2018-10-12 20:55:57,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:55:57,222 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-12 20:55:57,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-12 20:55:57,223 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 206 [2018-10-12 20:55:57,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:55:57,225 INFO L225 Difference]: With dead ends: 233 [2018-10-12 20:55:57,225 INFO L226 Difference]: Without dead ends: 233 [2018-10-12 20:55:57,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 931 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=538, Invalid=5468, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 20:55:57,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-12 20:55:57,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 221. [2018-10-12 20:55:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-12 20:55:57,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-12 20:55:57,232 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 206 [2018-10-12 20:55:57,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:55:57,233 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-12 20:55:57,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-12 20:55:57,233 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-12 20:55:57,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-12 20:55:57,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:55:57,234 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:55:57,235 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:55:57,235 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:55:57,235 INFO L82 PathProgramCache]: Analyzing trace with hash 617153649, now seen corresponding path program 14 times [2018-10-12 20:55:57,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:55:57,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:55:58,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1358 backedges. 0 proven. 1358 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:55:58,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:55:58,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-12 20:55:58,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-12 20:55:58,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-12 20:55:58,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1161, Unknown=0, NotChecked=0, Total=1260 [2018-10-12 20:55:58,492 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 36 states. [2018-10-12 20:56:03,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:03,119 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-12 20:56:03,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-12 20:56:03,119 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 220 [2018-10-12 20:56:03,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:03,121 INFO L225 Difference]: With dead ends: 247 [2018-10-12 20:56:03,121 INFO L226 Difference]: Without dead ends: 247 [2018-10-12 20:56:03,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=575, Invalid=6231, Unknown=0, NotChecked=0, Total=6806 [2018-10-12 20:56:03,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-10-12 20:56:03,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 235. [2018-10-12 20:56:03,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-12 20:56:03,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-12 20:56:03,129 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 220 [2018-10-12 20:56:03,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:03,129 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-12 20:56:03,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-12 20:56:03,129 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-12 20:56:03,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-12 20:56:03,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:03,131 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:03,131 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:03,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:03,132 INFO L82 PathProgramCache]: Analyzing trace with hash -250969115, now seen corresponding path program 15 times [2018-10-12 20:56:03,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:03,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:04,454 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:04,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:04,455 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-12 20:56:04,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-12 20:56:04,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-12 20:56:04,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1301, Unknown=0, NotChecked=0, Total=1406 [2018-10-12 20:56:04,456 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 38 states. [2018-10-12 20:56:09,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:09,613 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-10-12 20:56:09,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-12 20:56:09,614 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 234 [2018-10-12 20:56:09,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:09,616 INFO L225 Difference]: With dead ends: 261 [2018-10-12 20:56:09,616 INFO L226 Difference]: Without dead ends: 261 [2018-10-12 20:56:09,618 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1208 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=612, Invalid=7044, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 20:56:09,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-12 20:56:09,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 249. [2018-10-12 20:56:09,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-12 20:56:09,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-12 20:56:09,623 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 234 [2018-10-12 20:56:09,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:09,624 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-12 20:56:09,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-12 20:56:09,624 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-12 20:56:09,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-12 20:56:09,625 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:09,625 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:09,626 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:09,626 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:09,626 INFO L82 PathProgramCache]: Analyzing trace with hash 1219356761, now seen corresponding path program 16 times [2018-10-12 20:56:09,627 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:09,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:11,054 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 0 proven. 1776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:11,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:11,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-12 20:56:11,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-12 20:56:11,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-12 20:56:11,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1449, Unknown=0, NotChecked=0, Total=1560 [2018-10-12 20:56:11,056 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 40 states. [2018-10-12 20:56:16,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:16,658 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-12 20:56:16,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-12 20:56:16,659 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 248 [2018-10-12 20:56:16,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:16,661 INFO L225 Difference]: With dead ends: 275 [2018-10-12 20:56:16,662 INFO L226 Difference]: Without dead ends: 275 [2018-10-12 20:56:16,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1360 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=649, Invalid=7907, Unknown=0, NotChecked=0, Total=8556 [2018-10-12 20:56:16,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-12 20:56:16,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 263. [2018-10-12 20:56:16,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-12 20:56:16,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-12 20:56:16,670 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 248 [2018-10-12 20:56:16,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:16,671 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-12 20:56:16,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-12 20:56:16,671 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-12 20:56:16,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-12 20:56:16,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:16,673 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:16,673 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:16,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:16,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1946055117, now seen corresponding path program 17 times [2018-10-12 20:56:16,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:16,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:18,557 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 0 proven. 2006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:18,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:18,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-12 20:56:18,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-12 20:56:18,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-12 20:56:18,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=1605, Unknown=0, NotChecked=0, Total=1722 [2018-10-12 20:56:18,559 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 42 states. [2018-10-12 20:56:24,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:24,754 INFO L93 Difference]: Finished difference Result 289 states and 289 transitions. [2018-10-12 20:56:24,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-12 20:56:24,760 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 262 [2018-10-12 20:56:24,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:24,762 INFO L225 Difference]: With dead ends: 289 [2018-10-12 20:56:24,762 INFO L226 Difference]: Without dead ends: 289 [2018-10-12 20:56:24,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1521 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=686, Invalid=8820, Unknown=0, NotChecked=0, Total=9506 [2018-10-12 20:56:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2018-10-12 20:56:24,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 277. [2018-10-12 20:56:24,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-12 20:56:24,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-12 20:56:24,769 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 262 [2018-10-12 20:56:24,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:24,769 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-12 20:56:24,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-12 20:56:24,770 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-12 20:56:24,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-12 20:56:24,771 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:24,771 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:24,772 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:24,772 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:24,772 INFO L82 PathProgramCache]: Analyzing trace with hash -1231593407, now seen corresponding path program 18 times [2018-10-12 20:56:24,773 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:24,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:26,861 INFO L134 CoverageAnalysis]: Checked inductivity of 2250 backedges. 0 proven. 2250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:26,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:26,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-12 20:56:26,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-12 20:56:26,862 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-12 20:56:26,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1769, Unknown=0, NotChecked=0, Total=1892 [2018-10-12 20:56:26,863 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 44 states. [2018-10-12 20:56:33,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:33,711 INFO L93 Difference]: Finished difference Result 303 states and 303 transitions. [2018-10-12 20:56:33,711 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-12 20:56:33,711 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 276 [2018-10-12 20:56:33,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:33,713 INFO L225 Difference]: With dead ends: 303 [2018-10-12 20:56:33,714 INFO L226 Difference]: Without dead ends: 303 [2018-10-12 20:56:33,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1691 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=723, Invalid=9783, Unknown=0, NotChecked=0, Total=10506 [2018-10-12 20:56:33,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-12 20:56:33,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 291. [2018-10-12 20:56:33,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-12 20:56:33,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-12 20:56:33,720 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 276 [2018-10-12 20:56:33,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:33,721 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-12 20:56:33,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-12 20:56:33,721 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-12 20:56:33,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-12 20:56:33,722 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:33,723 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:33,723 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:33,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:33,723 INFO L82 PathProgramCache]: Analyzing trace with hash 1130623925, now seen corresponding path program 19 times [2018-10-12 20:56:33,724 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:33,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:36,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:36,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:36,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-12 20:56:36,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-12 20:56:36,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-12 20:56:36,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1941, Unknown=0, NotChecked=0, Total=2070 [2018-10-12 20:56:36,416 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 46 states. [2018-10-12 20:56:44,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:44,414 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-12 20:56:44,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-12 20:56:44,415 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 290 [2018-10-12 20:56:44,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:44,417 INFO L225 Difference]: With dead ends: 317 [2018-10-12 20:56:44,417 INFO L226 Difference]: Without dead ends: 317 [2018-10-12 20:56:44,419 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=760, Invalid=10796, Unknown=0, NotChecked=0, Total=11556 [2018-10-12 20:56:44,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-12 20:56:44,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 305. [2018-10-12 20:56:44,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-12 20:56:44,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-12 20:56:44,424 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 290 [2018-10-12 20:56:44,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:44,425 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-12 20:56:44,425 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-12 20:56:44,425 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-12 20:56:44,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-12 20:56:44,427 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:44,427 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:44,428 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:44,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:44,428 INFO L82 PathProgramCache]: Analyzing trace with hash 815754281, now seen corresponding path program 20 times [2018-10-12 20:56:44,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:46,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2780 backedges. 0 proven. 2780 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:46,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:46,648 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-12 20:56:46,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-12 20:56:46,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-12 20:56:46,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2018-10-12 20:56:46,649 INFO L87 Difference]: Start difference. First operand 305 states and 305 transitions. Second operand 48 states. [2018-10-12 20:56:54,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:56:54,839 INFO L93 Difference]: Finished difference Result 331 states and 331 transitions. [2018-10-12 20:56:54,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-12 20:56:54,840 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 304 [2018-10-12 20:56:54,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:56:54,843 INFO L225 Difference]: With dead ends: 331 [2018-10-12 20:56:54,843 INFO L226 Difference]: Without dead ends: 331 [2018-10-12 20:56:54,844 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2058 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=797, Invalid=11859, Unknown=0, NotChecked=0, Total=12656 [2018-10-12 20:56:54,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states. [2018-10-12 20:56:54,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 319. [2018-10-12 20:56:54,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 319 states. [2018-10-12 20:56:54,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 319 transitions. [2018-10-12 20:56:54,849 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 319 transitions. Word has length 304 [2018-10-12 20:56:54,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:56:54,849 INFO L481 AbstractCegarLoop]: Abstraction has 319 states and 319 transitions. [2018-10-12 20:56:54,849 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-12 20:56:54,850 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 319 transitions. [2018-10-12 20:56:54,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2018-10-12 20:56:54,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:56:54,851 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:56:54,852 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:56:54,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:56:54,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1809123741, now seen corresponding path program 21 times [2018-10-12 20:56:54,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:56:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:56:56,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3066 backedges. 0 proven. 3066 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:56:56,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:56:56,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-12 20:56:56,985 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-12 20:56:56,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-12 20:56:56,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2309, Unknown=0, NotChecked=0, Total=2450 [2018-10-12 20:56:56,986 INFO L87 Difference]: Start difference. First operand 319 states and 319 transitions. Second operand 50 states. [2018-10-12 20:57:05,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:05,776 INFO L93 Difference]: Finished difference Result 345 states and 345 transitions. [2018-10-12 20:57:05,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-12 20:57:05,778 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 318 [2018-10-12 20:57:05,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:05,780 INFO L225 Difference]: With dead ends: 345 [2018-10-12 20:57:05,780 INFO L226 Difference]: Without dead ends: 345 [2018-10-12 20:57:05,782 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2255 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=834, Invalid=12972, Unknown=0, NotChecked=0, Total=13806 [2018-10-12 20:57:05,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2018-10-12 20:57:05,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 333. [2018-10-12 20:57:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-12 20:57:05,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-12 20:57:05,787 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 318 [2018-10-12 20:57:05,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:05,788 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-12 20:57:05,788 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-12 20:57:05,788 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-12 20:57:05,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-12 20:57:05,790 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:05,790 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:57:05,790 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:05,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:05,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1377825775, now seen corresponding path program 22 times [2018-10-12 20:57:05,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:05,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:57:08,669 INFO L134 CoverageAnalysis]: Checked inductivity of 3366 backedges. 0 proven. 3366 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:57:08,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:57:08,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-12 20:57:08,670 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-12 20:57:08,670 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-12 20:57:08,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2505, Unknown=0, NotChecked=0, Total=2652 [2018-10-12 20:57:08,671 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 52 states. [2018-10-12 20:57:18,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:18,301 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-12 20:57:18,302 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-12 20:57:18,302 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 332 [2018-10-12 20:57:18,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:18,304 INFO L225 Difference]: With dead ends: 359 [2018-10-12 20:57:18,304 INFO L226 Difference]: Without dead ends: 359 [2018-10-12 20:57:18,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2461 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=871, Invalid=14135, Unknown=0, NotChecked=0, Total=15006 [2018-10-12 20:57:18,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-12 20:57:18,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 347. [2018-10-12 20:57:18,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 347 states. [2018-10-12 20:57:18,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 347 transitions. [2018-10-12 20:57:18,311 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 347 transitions. Word has length 332 [2018-10-12 20:57:18,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:18,311 INFO L481 AbstractCegarLoop]: Abstraction has 347 states and 347 transitions. [2018-10-12 20:57:18,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-12 20:57:18,311 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 347 transitions. [2018-10-12 20:57:18,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2018-10-12 20:57:18,313 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:18,314 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:57:18,314 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:18,314 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:18,314 INFO L82 PathProgramCache]: Analyzing trace with hash 1860940677, now seen corresponding path program 23 times [2018-10-12 20:57:18,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:18,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:57:21,257 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 0 proven. 3680 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:57:21,257 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:57:21,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-12 20:57:21,258 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-12 20:57:21,258 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-12 20:57:21,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=2709, Unknown=0, NotChecked=0, Total=2862 [2018-10-12 20:57:21,259 INFO L87 Difference]: Start difference. First operand 347 states and 347 transitions. Second operand 54 states. [2018-10-12 20:57:31,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:31,492 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-12 20:57:31,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-12 20:57:31,493 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 346 [2018-10-12 20:57:31,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:31,495 INFO L225 Difference]: With dead ends: 373 [2018-10-12 20:57:31,495 INFO L226 Difference]: Without dead ends: 373 [2018-10-12 20:57:31,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2676 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=908, Invalid=15348, Unknown=0, NotChecked=0, Total=16256 [2018-10-12 20:57:31,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2018-10-12 20:57:31,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 361. [2018-10-12 20:57:31,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-12 20:57:31,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 361 transitions. [2018-10-12 20:57:31,503 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 361 transitions. Word has length 346 [2018-10-12 20:57:31,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:31,503 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 361 transitions. [2018-10-12 20:57:31,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-12 20:57:31,504 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 361 transitions. [2018-10-12 20:57:31,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-12 20:57:31,506 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:31,506 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:57:31,506 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:31,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:31,507 INFO L82 PathProgramCache]: Analyzing trace with hash -629981191, now seen corresponding path program 24 times [2018-10-12 20:57:31,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:57:34,807 INFO L134 CoverageAnalysis]: Checked inductivity of 4008 backedges. 0 proven. 4008 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:57:34,808 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:57:34,808 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-12 20:57:34,808 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-12 20:57:34,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-12 20:57:34,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2921, Unknown=0, NotChecked=0, Total=3080 [2018-10-12 20:57:34,809 INFO L87 Difference]: Start difference. First operand 361 states and 361 transitions. Second operand 56 states. [2018-10-12 20:57:45,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:57:45,642 INFO L93 Difference]: Finished difference Result 387 states and 387 transitions. [2018-10-12 20:57:45,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-12 20:57:45,642 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 360 [2018-10-12 20:57:45,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:57:45,644 INFO L225 Difference]: With dead ends: 387 [2018-10-12 20:57:45,644 INFO L226 Difference]: Without dead ends: 387 [2018-10-12 20:57:45,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2900 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=945, Invalid=16611, Unknown=0, NotChecked=0, Total=17556 [2018-10-12 20:57:45,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-12 20:57:45,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 375. [2018-10-12 20:57:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 375 states. [2018-10-12 20:57:45,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 375 states to 375 states and 375 transitions. [2018-10-12 20:57:45,650 INFO L78 Accepts]: Start accepts. Automaton has 375 states and 375 transitions. Word has length 360 [2018-10-12 20:57:45,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:57:45,650 INFO L481 AbstractCegarLoop]: Abstraction has 375 states and 375 transitions. [2018-10-12 20:57:45,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-12 20:57:45,650 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 375 transitions. [2018-10-12 20:57:45,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 375 [2018-10-12 20:57:45,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:57:45,652 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:57:45,653 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:57:45,653 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:57:45,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1019088531, now seen corresponding path program 25 times [2018-10-12 20:57:45,654 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:57:45,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:57:48,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 0 proven. 4350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:57:48,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:57:48,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-12 20:57:48,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-12 20:57:48,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-12 20:57:48,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=3141, Unknown=0, NotChecked=0, Total=3306 [2018-10-12 20:57:48,679 INFO L87 Difference]: Start difference. First operand 375 states and 375 transitions. Second operand 58 states. [2018-10-12 20:58:01,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:58:01,029 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-12 20:58:01,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-12 20:58:01,029 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 374 [2018-10-12 20:58:01,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:58:01,032 INFO L225 Difference]: With dead ends: 401 [2018-10-12 20:58:01,032 INFO L226 Difference]: Without dead ends: 401 [2018-10-12 20:58:01,033 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3133 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=982, Invalid=17924, Unknown=0, NotChecked=0, Total=18906 [2018-10-12 20:58:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-12 20:58:01,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 389. [2018-10-12 20:58:01,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-12 20:58:01,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-12 20:58:01,038 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 374 [2018-10-12 20:58:01,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:58:01,038 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-12 20:58:01,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-12 20:58:01,039 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-12 20:58:01,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-12 20:58:01,041 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:58:01,041 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:58:01,041 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:58:01,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:58:01,042 INFO L82 PathProgramCache]: Analyzing trace with hash -1754069023, now seen corresponding path program 26 times [2018-10-12 20:58:01,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:58:01,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:03,934 INFO L134 CoverageAnalysis]: Checked inductivity of 4706 backedges. 0 proven. 4706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:58:03,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:03,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-12 20:58:03,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-12 20:58:03,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-12 20:58:03,935 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3369, Unknown=0, NotChecked=0, Total=3540 [2018-10-12 20:58:03,935 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 60 states. [2018-10-12 20:58:16,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:58:16,579 INFO L93 Difference]: Finished difference Result 415 states and 415 transitions. [2018-10-12 20:58:16,580 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-12 20:58:16,580 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 388 [2018-10-12 20:58:16,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:58:16,582 INFO L225 Difference]: With dead ends: 415 [2018-10-12 20:58:16,582 INFO L226 Difference]: Without dead ends: 415 [2018-10-12 20:58:16,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3375 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=1019, Invalid=19287, Unknown=0, NotChecked=0, Total=20306 [2018-10-12 20:58:16,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states. [2018-10-12 20:58:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 403. [2018-10-12 20:58:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-12 20:58:16,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-12 20:58:16,588 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 388 [2018-10-12 20:58:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:58:16,588 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-12 20:58:16,589 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-12 20:58:16,589 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-12 20:58:16,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-12 20:58:16,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:58:16,591 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:58:16,592 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:58:16,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:58:16,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1416741717, now seen corresponding path program 27 times [2018-10-12 20:58:16,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:58:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:19,750 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 0 proven. 5076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:58:19,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:19,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-12 20:58:19,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-12 20:58:19,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-12 20:58:19,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=3605, Unknown=0, NotChecked=0, Total=3782 [2018-10-12 20:58:19,751 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 62 states. [2018-10-12 20:58:33,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:58:33,291 INFO L93 Difference]: Finished difference Result 429 states and 429 transitions. [2018-10-12 20:58:33,291 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-12 20:58:33,291 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 402 [2018-10-12 20:58:33,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:58:33,294 INFO L225 Difference]: With dead ends: 429 [2018-10-12 20:58:33,294 INFO L226 Difference]: Without dead ends: 429 [2018-10-12 20:58:33,295 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3626 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=1056, Invalid=20700, Unknown=0, NotChecked=0, Total=21756 [2018-10-12 20:58:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2018-10-12 20:58:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2018-10-12 20:58:33,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 417 states. [2018-10-12 20:58:33,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 417 transitions. [2018-10-12 20:58:33,300 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 417 transitions. Word has length 402 [2018-10-12 20:58:33,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:58:33,301 INFO L481 AbstractCegarLoop]: Abstraction has 417 states and 417 transitions. [2018-10-12 20:58:33,301 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-12 20:58:33,301 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 417 transitions. [2018-10-12 20:58:33,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 417 [2018-10-12 20:58:33,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:58:33,303 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:58:33,304 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:58:33,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:58:33,304 INFO L82 PathProgramCache]: Analyzing trace with hash 2063164361, now seen corresponding path program 28 times [2018-10-12 20:58:33,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:58:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:36,948 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:58:36,948 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:36,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-12 20:58:36,949 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-12 20:58:36,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-12 20:58:36,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=3849, Unknown=0, NotChecked=0, Total=4032 [2018-10-12 20:58:36,949 INFO L87 Difference]: Start difference. First operand 417 states and 417 transitions. Second operand 64 states. [2018-10-12 20:58:51,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:58:51,254 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-12 20:58:51,254 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-12 20:58:51,254 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 416 [2018-10-12 20:58:51,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:58:51,256 INFO L225 Difference]: With dead ends: 443 [2018-10-12 20:58:51,256 INFO L226 Difference]: Without dead ends: 443 [2018-10-12 20:58:51,258 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3886 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=1093, Invalid=22163, Unknown=0, NotChecked=0, Total=23256 [2018-10-12 20:58:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-12 20:58:51,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 431. [2018-10-12 20:58:51,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 431 states. [2018-10-12 20:58:51,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 431 states to 431 states and 431 transitions. [2018-10-12 20:58:51,263 INFO L78 Accepts]: Start accepts. Automaton has 431 states and 431 transitions. Word has length 416 [2018-10-12 20:58:51,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:58:51,264 INFO L481 AbstractCegarLoop]: Abstraction has 431 states and 431 transitions. [2018-10-12 20:58:51,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-12 20:58:51,264 INFO L276 IsEmpty]: Start isEmpty. Operand 431 states and 431 transitions. [2018-10-12 20:58:51,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2018-10-12 20:58:51,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:58:51,267 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:58:51,267 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:58:51,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:58:51,267 INFO L82 PathProgramCache]: Analyzing trace with hash 51718461, now seen corresponding path program 29 times [2018-10-12 20:58:51,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:58:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:58:53,435 WARN L178 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:58:55,790 INFO L134 CoverageAnalysis]: Checked inductivity of 5858 backedges. 0 proven. 5858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:58:55,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:58:55,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-12 20:58:55,791 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-12 20:58:55,791 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-12 20:58:55,791 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=4101, Unknown=0, NotChecked=0, Total=4290 [2018-10-12 20:58:55,792 INFO L87 Difference]: Start difference. First operand 431 states and 431 transitions. Second operand 66 states. [2018-10-12 20:59:11,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:59:11,140 INFO L93 Difference]: Finished difference Result 457 states and 457 transitions. [2018-10-12 20:59:11,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-12 20:59:11,141 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 430 [2018-10-12 20:59:11,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:59:11,142 INFO L225 Difference]: With dead ends: 457 [2018-10-12 20:59:11,143 INFO L226 Difference]: Without dead ends: 457 [2018-10-12 20:59:11,144 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4155 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=1130, Invalid=23676, Unknown=0, NotChecked=0, Total=24806 [2018-10-12 20:59:11,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2018-10-12 20:59:11,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 445. [2018-10-12 20:59:11,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 445 states. [2018-10-12 20:59:11,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 445 states to 445 states and 445 transitions. [2018-10-12 20:59:11,149 INFO L78 Accepts]: Start accepts. Automaton has 445 states and 445 transitions. Word has length 430 [2018-10-12 20:59:11,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:59:11,149 INFO L481 AbstractCegarLoop]: Abstraction has 445 states and 445 transitions. [2018-10-12 20:59:11,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-12 20:59:11,149 INFO L276 IsEmpty]: Start isEmpty. Operand 445 states and 445 transitions. [2018-10-12 20:59:11,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2018-10-12 20:59:11,152 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:59:11,152 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:59:11,152 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:59:11,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:59:11,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1344295857, now seen corresponding path program 30 times [2018-10-12 20:59:11,153 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:59:11,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:59:15,368 INFO L134 CoverageAnalysis]: Checked inductivity of 6270 backedges. 0 proven. 6270 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:59:15,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:59:15,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-12 20:59:15,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-12 20:59:15,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-12 20:59:15,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4361, Unknown=0, NotChecked=0, Total=4556 [2018-10-12 20:59:15,370 INFO L87 Difference]: Start difference. First operand 445 states and 445 transitions. Second operand 68 states. [2018-10-12 20:59:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:59:31,537 INFO L93 Difference]: Finished difference Result 471 states and 471 transitions. [2018-10-12 20:59:31,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-12 20:59:31,537 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 444 [2018-10-12 20:59:31,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:59:31,539 INFO L225 Difference]: With dead ends: 471 [2018-10-12 20:59:31,539 INFO L226 Difference]: Without dead ends: 471 [2018-10-12 20:59:31,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4433 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=1167, Invalid=25239, Unknown=0, NotChecked=0, Total=26406 [2018-10-12 20:59:31,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2018-10-12 20:59:31,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 459. [2018-10-12 20:59:31,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 459 states. [2018-10-12 20:59:31,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 459 transitions. [2018-10-12 20:59:31,545 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 459 transitions. Word has length 444 [2018-10-12 20:59:31,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:59:31,546 INFO L481 AbstractCegarLoop]: Abstraction has 459 states and 459 transitions. [2018-10-12 20:59:31,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-12 20:59:31,546 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 459 transitions. [2018-10-12 20:59:31,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 459 [2018-10-12 20:59:31,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:59:31,549 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:59:31,549 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:59:31,549 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:59:31,549 INFO L82 PathProgramCache]: Analyzing trace with hash 616964901, now seen corresponding path program 31 times [2018-10-12 20:59:31,550 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:59:31,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:59:35,951 INFO L134 CoverageAnalysis]: Checked inductivity of 6696 backedges. 0 proven. 6696 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:59:35,951 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:59:35,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-12 20:59:35,952 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-12 20:59:35,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-12 20:59:35,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=4629, Unknown=0, NotChecked=0, Total=4830 [2018-10-12 20:59:35,953 INFO L87 Difference]: Start difference. First operand 459 states and 459 transitions. Second operand 70 states. [2018-10-12 20:59:53,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 20:59:53,120 INFO L93 Difference]: Finished difference Result 485 states and 485 transitions. [2018-10-12 20:59:53,120 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-12 20:59:53,120 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 458 [2018-10-12 20:59:53,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 20:59:53,122 INFO L225 Difference]: With dead ends: 485 [2018-10-12 20:59:53,122 INFO L226 Difference]: Without dead ends: 485 [2018-10-12 20:59:53,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=1204, Invalid=26852, Unknown=0, NotChecked=0, Total=28056 [2018-10-12 20:59:53,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2018-10-12 20:59:53,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 473. [2018-10-12 20:59:53,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-12 20:59:53,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-12 20:59:53,128 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 458 [2018-10-12 20:59:53,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 20:59:53,129 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-12 20:59:53,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-12 20:59:53,129 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-12 20:59:53,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-12 20:59:53,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 20:59:53,131 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 20:59:53,131 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 20:59:53,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 20:59:53,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1761486951, now seen corresponding path program 32 times [2018-10-12 20:59:53,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 20:59:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 20:59:54,224 WARN L178 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-10-12 20:59:54,751 WARN L178 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2018-10-12 20:59:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 7136 backedges. 0 proven. 7136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 20:59:59,281 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 20:59:59,281 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-12 20:59:59,282 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-12 20:59:59,282 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-12 20:59:59,282 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=4905, Unknown=0, NotChecked=0, Total=5112 [2018-10-12 20:59:59,283 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 72 states. [2018-10-12 21:00:17,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:00:17,566 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-12 21:00:17,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-12 21:00:17,567 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 472 [2018-10-12 21:00:17,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:00:17,569 INFO L225 Difference]: With dead ends: 499 [2018-10-12 21:00:17,570 INFO L226 Difference]: Without dead ends: 499 [2018-10-12 21:00:17,572 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 171 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5016 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=1241, Invalid=28515, Unknown=0, NotChecked=0, Total=29756 [2018-10-12 21:00:17,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2018-10-12 21:00:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 487. [2018-10-12 21:00:17,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 487 states. [2018-10-12 21:00:17,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 487 transitions. [2018-10-12 21:00:17,578 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 487 transitions. Word has length 472 [2018-10-12 21:00:17,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:00:17,578 INFO L481 AbstractCegarLoop]: Abstraction has 487 states and 487 transitions. [2018-10-12 21:00:17,578 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-12 21:00:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 487 transitions. [2018-10-12 21:00:17,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2018-10-12 21:00:17,581 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:00:17,582 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:00:17,582 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:00:17,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:00:17,582 INFO L82 PathProgramCache]: Analyzing trace with hash 69120269, now seen corresponding path program 33 times [2018-10-12 21:00:17,583 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:00:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:00:22,205 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 0 proven. 7590 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:00:22,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:00:22,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-12 21:00:22,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-12 21:00:22,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-12 21:00:22,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=5189, Unknown=0, NotChecked=0, Total=5402 [2018-10-12 21:00:22,207 INFO L87 Difference]: Start difference. First operand 487 states and 487 transitions. Second operand 74 states. [2018-10-12 21:00:41,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:00:41,631 INFO L93 Difference]: Finished difference Result 513 states and 513 transitions. [2018-10-12 21:00:41,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-12 21:00:41,631 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 486 [2018-10-12 21:00:41,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:00:41,633 INFO L225 Difference]: With dead ends: 513 [2018-10-12 21:00:41,633 INFO L226 Difference]: Without dead ends: 513 [2018-10-12 21:00:41,634 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5321 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=1278, Invalid=30228, Unknown=0, NotChecked=0, Total=31506 [2018-10-12 21:00:41,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-12 21:00:41,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 501. [2018-10-12 21:00:41,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 501 states. [2018-10-12 21:00:41,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 501 states to 501 states and 501 transitions. [2018-10-12 21:00:41,640 INFO L78 Accepts]: Start accepts. Automaton has 501 states and 501 transitions. Word has length 486 [2018-10-12 21:00:41,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:00:41,640 INFO L481 AbstractCegarLoop]: Abstraction has 501 states and 501 transitions. [2018-10-12 21:00:41,640 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-12 21:00:41,640 INFO L276 IsEmpty]: Start isEmpty. Operand 501 states and 501 transitions. [2018-10-12 21:00:41,643 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2018-10-12 21:00:41,643 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:00:41,644 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:00:41,644 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:00:41,644 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:00:41,644 INFO L82 PathProgramCache]: Analyzing trace with hash 79163265, now seen corresponding path program 34 times [2018-10-12 21:00:41,645 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:00:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:00:46,629 INFO L134 CoverageAnalysis]: Checked inductivity of 8058 backedges. 0 proven. 8058 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:00:46,629 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:00:46,629 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-12 21:00:46,630 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-12 21:00:46,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-12 21:00:46,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5481, Unknown=0, NotChecked=0, Total=5700 [2018-10-12 21:00:46,631 INFO L87 Difference]: Start difference. First operand 501 states and 501 transitions. Second operand 76 states. [2018-10-12 21:01:07,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:01:07,355 INFO L93 Difference]: Finished difference Result 527 states and 527 transitions. [2018-10-12 21:01:07,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-12 21:01:07,355 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 500 [2018-10-12 21:01:07,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:01:07,357 INFO L225 Difference]: With dead ends: 527 [2018-10-12 21:01:07,357 INFO L226 Difference]: Without dead ends: 527 [2018-10-12 21:01:07,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5635 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=1315, Invalid=31991, Unknown=0, NotChecked=0, Total=33306 [2018-10-12 21:01:07,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2018-10-12 21:01:07,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 515. [2018-10-12 21:01:07,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-12 21:01:07,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-12 21:01:07,363 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 500 [2018-10-12 21:01:07,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:01:07,364 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-12 21:01:07,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-12 21:01:07,364 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-12 21:01:07,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-12 21:01:07,367 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:01:07,367 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:01:07,368 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:01:07,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:01:07,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1622725365, now seen corresponding path program 35 times [2018-10-12 21:01:07,369 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:01:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:01:12,408 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 0 proven. 8540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:01:12,408 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:01:12,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-12 21:01:12,409 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-12 21:01:12,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-12 21:01:12,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=5781, Unknown=0, NotChecked=0, Total=6006 [2018-10-12 21:01:12,410 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 78 states. [2018-10-12 21:01:33,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:01:33,914 INFO L93 Difference]: Finished difference Result 541 states and 541 transitions. [2018-10-12 21:01:33,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-12 21:01:33,917 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 514 [2018-10-12 21:01:33,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:01:33,919 INFO L225 Difference]: With dead ends: 541 [2018-10-12 21:01:33,919 INFO L226 Difference]: Without dead ends: 541 [2018-10-12 21:01:33,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 186 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5958 ImplicationChecksByTransitivity, 11.2s TimeCoverageRelationStatistics Valid=1352, Invalid=33804, Unknown=0, NotChecked=0, Total=35156 [2018-10-12 21:01:33,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2018-10-12 21:01:33,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 529. [2018-10-12 21:01:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 529 states. [2018-10-12 21:01:33,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 529 transitions. [2018-10-12 21:01:33,927 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 529 transitions. Word has length 514 [2018-10-12 21:01:33,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:01:33,927 INFO L481 AbstractCegarLoop]: Abstraction has 529 states and 529 transitions. [2018-10-12 21:01:33,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-12 21:01:33,928 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 529 transitions. [2018-10-12 21:01:33,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2018-10-12 21:01:33,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:01:33,931 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:01:33,931 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:01:33,931 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:01:33,932 INFO L82 PathProgramCache]: Analyzing trace with hash 56400745, now seen corresponding path program 36 times [2018-10-12 21:01:33,932 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:01:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:01:39,134 INFO L134 CoverageAnalysis]: Checked inductivity of 9036 backedges. 0 proven. 9036 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:01:39,135 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:01:39,135 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-12 21:01:39,135 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-12 21:01:39,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-12 21:01:39,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=6089, Unknown=0, NotChecked=0, Total=6320 [2018-10-12 21:01:39,136 INFO L87 Difference]: Start difference. First operand 529 states and 529 transitions. Second operand 80 states. [2018-10-12 21:02:02,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:02:02,044 INFO L93 Difference]: Finished difference Result 555 states and 555 transitions. [2018-10-12 21:02:02,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-12 21:02:02,045 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 528 [2018-10-12 21:02:02,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:02:02,047 INFO L225 Difference]: With dead ends: 555 [2018-10-12 21:02:02,048 INFO L226 Difference]: Without dead ends: 555 [2018-10-12 21:02:02,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 193 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 191 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6290 ImplicationChecksByTransitivity, 11.7s TimeCoverageRelationStatistics Valid=1389, Invalid=35667, Unknown=0, NotChecked=0, Total=37056 [2018-10-12 21:02:02,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2018-10-12 21:02:02,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 543. [2018-10-12 21:02:02,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-12 21:02:02,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-12 21:02:02,053 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 528 [2018-10-12 21:02:02,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:02:02,054 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-12 21:02:02,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-12 21:02:02,054 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-12 21:02:02,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-12 21:02:02,057 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:02:02,058 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:02:02,058 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:02:02,058 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:02:02,059 INFO L82 PathProgramCache]: Analyzing trace with hash -282162979, now seen corresponding path program 37 times [2018-10-12 21:02:02,059 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:02:02,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:02:07,796 INFO L134 CoverageAnalysis]: Checked inductivity of 9546 backedges. 0 proven. 9546 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:02:07,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:02:07,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-12 21:02:07,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-12 21:02:07,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-12 21:02:07,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=6405, Unknown=0, NotChecked=0, Total=6642 [2018-10-12 21:02:07,798 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 82 states. [2018-10-12 21:02:32,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:02:32,045 INFO L93 Difference]: Finished difference Result 569 states and 569 transitions. [2018-10-12 21:02:32,048 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-12 21:02:32,048 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 542 [2018-10-12 21:02:32,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:02:32,050 INFO L225 Difference]: With dead ends: 569 [2018-10-12 21:02:32,051 INFO L226 Difference]: Without dead ends: 569 [2018-10-12 21:02:32,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 196 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6631 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=1426, Invalid=37580, Unknown=0, NotChecked=0, Total=39006 [2018-10-12 21:02:32,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2018-10-12 21:02:32,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 557. [2018-10-12 21:02:32,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 557 states. [2018-10-12 21:02:32,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 557 states to 557 states and 557 transitions. [2018-10-12 21:02:32,058 INFO L78 Accepts]: Start accepts. Automaton has 557 states and 557 transitions. Word has length 542 [2018-10-12 21:02:32,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:02:32,058 INFO L481 AbstractCegarLoop]: Abstraction has 557 states and 557 transitions. [2018-10-12 21:02:32,058 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-12 21:02:32,058 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 557 transitions. [2018-10-12 21:02:32,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2018-10-12 21:02:32,062 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:02:32,062 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:02:32,062 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:02:32,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:02:32,063 INFO L82 PathProgramCache]: Analyzing trace with hash 839506769, now seen corresponding path program 38 times [2018-10-12 21:02:32,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:02:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:02:37,480 INFO L134 CoverageAnalysis]: Checked inductivity of 10070 backedges. 0 proven. 10070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:02:37,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:02:37,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-12 21:02:37,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-12 21:02:37,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-12 21:02:37,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6729, Unknown=0, NotChecked=0, Total=6972 [2018-10-12 21:02:37,482 INFO L87 Difference]: Start difference. First operand 557 states and 557 transitions. Second operand 84 states. [2018-10-12 21:03:02,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:03:02,749 INFO L93 Difference]: Finished difference Result 583 states and 583 transitions. [2018-10-12 21:03:02,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-12 21:03:02,749 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 556 [2018-10-12 21:03:02,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:03:02,751 INFO L225 Difference]: With dead ends: 583 [2018-10-12 21:03:02,751 INFO L226 Difference]: Without dead ends: 583 [2018-10-12 21:03:02,753 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6981 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=1463, Invalid=39543, Unknown=0, NotChecked=0, Total=41006 [2018-10-12 21:03:02,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2018-10-12 21:03:02,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 571. [2018-10-12 21:03:02,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 571 states. [2018-10-12 21:03:02,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 571 transitions. [2018-10-12 21:03:02,757 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 571 transitions. Word has length 556 [2018-10-12 21:03:02,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:03:02,757 INFO L481 AbstractCegarLoop]: Abstraction has 571 states and 571 transitions. [2018-10-12 21:03:02,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-12 21:03:02,757 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 571 transitions. [2018-10-12 21:03:02,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2018-10-12 21:03:02,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:03:02,761 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-12 21:03:02,761 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:03:02,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:03:02,762 INFO L82 PathProgramCache]: Analyzing trace with hash -652619067, now seen corresponding path program 39 times [2018-10-12 21:03:02,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:03:02,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:03:08,658 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 0 proven. 10608 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:03:08,658 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:03:08,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-12 21:03:08,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-12 21:03:08,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-12 21:03:08,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=7061, Unknown=0, NotChecked=0, Total=7310 [2018-10-12 21:03:08,659 INFO L87 Difference]: Start difference. First operand 571 states and 571 transitions. Second operand 86 states. [2018-10-12 21:03:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-12 21:03:34,999 INFO L93 Difference]: Finished difference Result 597 states and 597 transitions. [2018-10-12 21:03:35,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-12 21:03:35,000 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 570 [2018-10-12 21:03:35,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-12 21:03:35,003 INFO L225 Difference]: With dead ends: 597 [2018-10-12 21:03:35,003 INFO L226 Difference]: Without dead ends: 597 [2018-10-12 21:03:35,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7340 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=1500, Invalid=41556, Unknown=0, NotChecked=0, Total=43056 [2018-10-12 21:03:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2018-10-12 21:03:35,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 585. [2018-10-12 21:03:35,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2018-10-12 21:03:35,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 585 transitions. [2018-10-12 21:03:35,009 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 585 transitions. Word has length 570 [2018-10-12 21:03:35,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-12 21:03:35,009 INFO L481 AbstractCegarLoop]: Abstraction has 585 states and 585 transitions. [2018-10-12 21:03:35,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-12 21:03:35,009 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 585 transitions. [2018-10-12 21:03:35,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 585 [2018-10-12 21:03:35,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-12 21:03:35,012 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 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] [2018-10-12 21:03:35,012 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-12 21:03:35,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-12 21:03:35,013 INFO L82 PathProgramCache]: Analyzing trace with hash -455495879, now seen corresponding path program 40 times [2018-10-12 21:03:35,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-12 21:03:35,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-12 21:03:41,334 INFO L134 CoverageAnalysis]: Checked inductivity of 11160 backedges. 0 proven. 11160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-12 21:03:41,334 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-12 21:03:41,334 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-12 21:03:41,335 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-12 21:03:41,335 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-12 21:03:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=7401, Unknown=0, NotChecked=0, Total=7656 [2018-10-12 21:03:41,336 INFO L87 Difference]: Start difference. First operand 585 states and 585 transitions. Second operand 88 states.