java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/fragtest_simple_true-unreach-call_true-termination.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 13:03:47,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 13:03:47,642 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 13:03:47,653 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 13:03:47,654 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 13:03:47,655 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 13:03:47,656 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 13:03:47,658 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 13:03:47,659 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 13:03:47,660 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 13:03:47,661 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 13:03:47,661 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 13:03:47,662 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 13:03:47,663 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 13:03:47,664 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 13:03:47,665 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 13:03:47,666 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 13:03:47,668 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 13:03:47,670 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 13:03:47,671 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 13:03:47,672 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 13:03:47,674 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 13:03:47,676 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 13:03:47,677 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 13:03:47,677 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 13:03:47,681 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 13:03:47,683 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 13:03:47,684 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 13:03:47,685 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 13:03:47,688 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 13:03:47,688 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 13:03:47,689 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 13:03:47,690 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 13:03:47,690 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 13:03:47,691 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 13:03:47,693 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 13:03:47,694 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-15 13:03:47,711 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 13:03:47,712 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 13:03:47,712 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 13:03:47,713 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 13:03:47,713 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 13:03:47,713 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 13:03:47,714 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 13:03:47,715 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 13:03:47,715 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 13:03:47,715 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 13:03:47,715 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 13:03:47,715 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 13:03:47,716 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 13:03:47,717 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 13:03:47,717 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 13:03:47,777 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 13:03:47,791 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 13:03:47,796 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 13:03:47,798 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 13:03:47,798 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 13:03:47,799 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/fragtest_simple_true-unreach-call_true-termination.i_4.bpl [2018-10-15 13:03:47,799 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/fragtest_simple_true-unreach-call_true-termination.i_4.bpl' [2018-10-15 13:03:47,875 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 13:03:47,877 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 13:03:47,878 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 13:03:47,878 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 13:03:47,878 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 13:03:47,905 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,917 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,918 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,922 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,925 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,926 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/1) ... [2018-10-15 13:03:47,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 13:03:47,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 13:03:47,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 13:03:47,929 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 13:03:47,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (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-15 13:03:47,993 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 13:03:47,993 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 13:03:47,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 13:03:48,380 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 13:03:48,381 INFO L202 PluginConnector]: Adding new model fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:48 BoogieIcfgContainer [2018-10-15 13:03:48,381 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 13:03:48,382 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 13:03:48,382 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 13:03:48,383 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 13:03:48,387 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:48" (1/1) ... [2018-10-15 13:03:48,392 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 13:03:48,410 INFO L202 PluginConnector]: Adding new model fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:48 BasicIcfg [2018-10-15 13:03:48,410 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 13:03:48,411 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 13:03:48,411 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 13:03:48,415 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 13:03:48,415 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 01:03:47" (1/3) ... [2018-10-15 13:03:48,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad8a24 and model type fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:03:48, skipping insertion in model container [2018-10-15 13:03:48,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:03:48" (2/3) ... [2018-10-15 13:03:48,417 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2cad8a24 and model type fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 01:03:48, skipping insertion in model container [2018-10-15 13:03:48,417 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "fragtest_simple_true-unreach-call_true-termination.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 01:03:48" (3/3) ... [2018-10-15 13:03:48,419 INFO L112 eAbstractionObserver]: Analyzing ICFG fragtest_simple_true-unreach-call_true-termination.i_4.bplleft_unchanged_by_heapseparator [2018-10-15 13:03:48,430 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 13:03:48,441 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 13:03:48,459 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 13:03:48,489 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 13:03:48,490 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 13:03:48,490 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 13:03:48,490 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 13:03:48,490 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 13:03:48,490 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 13:03:48,491 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 13:03:48,491 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 13:03:48,491 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 13:03:48,506 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states. [2018-10-15 13:03:48,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 13:03:48,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:48,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:48,517 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:48,524 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:48,524 INFO L82 PathProgramCache]: Analyzing trace with hash -2024338191, now seen corresponding path program 1 times [2018-10-15 13:03:48,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:48,796 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-15 13:03:48,800 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:48,800 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-10-15 13:03:48,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 13:03:48,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 13:03:48,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 13:03:48,820 INFO L87 Difference]: Start difference. First operand 37 states. Second operand 5 states. [2018-10-15 13:03:49,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:49,007 INFO L93 Difference]: Finished difference Result 45 states and 46 transitions. [2018-10-15 13:03:49,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 13:03:49,010 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 26 [2018-10-15 13:03:49,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:49,023 INFO L225 Difference]: With dead ends: 45 [2018-10-15 13:03:49,023 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 13:03:49,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:49,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 13:03:49,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 39. [2018-10-15 13:03:49,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 13:03:49,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-15 13:03:49,067 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 26 [2018-10-15 13:03:49,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:49,068 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-15 13:03:49,068 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 13:03:49,068 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-15 13:03:49,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 13:03:49,069 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:49,070 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:49,070 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:49,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:49,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1679132810, now seen corresponding path program 1 times [2018-10-15 13:03:49,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:49,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:49,274 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:49,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 13:03:49,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-10-15 13:03:49,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 13:03:49,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 13:03:49,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2018-10-15 13:03:49,278 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 6 states. [2018-10-15 13:03:49,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:49,612 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 13:03:49,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 13:03:49,613 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 34 [2018-10-15 13:03:49,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:49,615 INFO L225 Difference]: With dead ends: 55 [2018-10-15 13:03:49,615 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 13:03:49,616 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:03:49,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 13:03:49,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 13:03:49,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 13:03:49,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2018-10-15 13:03:49,626 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 34 [2018-10-15 13:03:49,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:49,627 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2018-10-15 13:03:49,627 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 13:03:49,627 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2018-10-15 13:03:49,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 13:03:49,628 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:49,628 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:49,629 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:49,629 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:49,629 INFO L82 PathProgramCache]: Analyzing trace with hash 1108351152, now seen corresponding path program 1 times [2018-10-15 13:03:49,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:49,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:49,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:49,889 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:03:49,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:03:49,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:03:49,890 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:49,890 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand 8 states. [2018-10-15 13:03:50,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:50,321 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-10-15 13:03:50,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 13:03:50,322 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 40 [2018-10-15 13:03:50,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:50,323 INFO L225 Difference]: With dead ends: 58 [2018-10-15 13:03:50,325 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 13:03:50,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:50,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 13:03:50,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 49. [2018-10-15 13:03:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 13:03:50,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 50 transitions. [2018-10-15 13:03:50,340 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 50 transitions. Word has length 40 [2018-10-15 13:03:50,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:50,343 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 50 transitions. [2018-10-15 13:03:50,343 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:03:50,343 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 50 transitions. [2018-10-15 13:03:50,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 13:03:50,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:50,346 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:50,346 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:50,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:50,347 INFO L82 PathProgramCache]: Analyzing trace with hash -442342071, now seen corresponding path program 2 times [2018-10-15 13:03:50,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:50,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 16 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:50,580 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:50,581 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 13:03:50,581 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 13:03:50,582 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 13:03:50,582 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2018-10-15 13:03:50,582 INFO L87 Difference]: Start difference. First operand 49 states and 50 transitions. Second operand 8 states. [2018-10-15 13:03:50,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:50,794 INFO L93 Difference]: Finished difference Result 69 states and 70 transitions. [2018-10-15 13:03:50,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 13:03:50,795 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 48 [2018-10-15 13:03:50,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:50,796 INFO L225 Difference]: With dead ends: 69 [2018-10-15 13:03:50,796 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 13:03:50,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2018-10-15 13:03:50,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 13:03:50,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 55. [2018-10-15 13:03:50,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 13:03:50,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 56 transitions. [2018-10-15 13:03:50,804 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 56 transitions. Word has length 48 [2018-10-15 13:03:50,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:50,805 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 56 transitions. [2018-10-15 13:03:50,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 13:03:50,807 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 56 transitions. [2018-10-15 13:03:50,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 13:03:50,808 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:50,809 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:50,809 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:50,809 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:50,809 INFO L82 PathProgramCache]: Analyzing trace with hash -2005746961, now seen corresponding path program 3 times [2018-10-15 13:03:50,810 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:50,980 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 10 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:50,981 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:50,981 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 13:03:50,981 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 13:03:50,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 13:03:50,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 13:03:50,982 INFO L87 Difference]: Start difference. First operand 55 states and 56 transitions. Second operand 9 states. [2018-10-15 13:03:51,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:51,316 INFO L93 Difference]: Finished difference Result 72 states and 73 transitions. [2018-10-15 13:03:51,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 13:03:51,318 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 54 [2018-10-15 13:03:51,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:51,320 INFO L225 Difference]: With dead ends: 72 [2018-10-15 13:03:51,320 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:03:51,321 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=161, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:51,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:03:51,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 63. [2018-10-15 13:03:51,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 13:03:51,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-15 13:03:51,328 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 54 [2018-10-15 13:03:51,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:51,328 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-15 13:03:51,328 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 13:03:51,328 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-15 13:03:51,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 13:03:51,330 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:51,330 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:51,330 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:51,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:51,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1964660872, now seen corresponding path program 4 times [2018-10-15 13:03:51,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:51,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:51,551 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 36 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:51,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:51,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 13:03:51,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 13:03:51,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 13:03:51,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2018-10-15 13:03:51,553 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 10 states. [2018-10-15 13:03:52,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,017 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-10-15 13:03:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 13:03:52,022 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 62 [2018-10-15 13:03:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,024 INFO L225 Difference]: With dead ends: 91 [2018-10-15 13:03:52,024 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 13:03:52,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2018-10-15 13:03:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 13:03:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2018-10-15 13:03:52,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 13:03:52,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-15 13:03:52,031 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 62 [2018-10-15 13:03:52,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,032 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-15 13:03:52,032 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 13:03:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-15 13:03:52,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 13:03:52,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,033 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,034 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,034 INFO L82 PathProgramCache]: Analyzing trace with hash 175690670, now seen corresponding path program 5 times [2018-10-15 13:03:52,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,205 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 36 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:03:52,206 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:03:52,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:03:52,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:03:52,207 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 11 states. [2018-10-15 13:03:52,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,471 INFO L93 Difference]: Finished difference Result 105 states and 106 transitions. [2018-10-15 13:03:52,471 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 13:03:52,471 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 68 [2018-10-15 13:03:52,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,473 INFO L225 Difference]: With dead ends: 105 [2018-10-15 13:03:52,473 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 13:03:52,474 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=223, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:03:52,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 13:03:52,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2018-10-15 13:03:52,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 13:03:52,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-15 13:03:52,480 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 68 [2018-10-15 13:03:52,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,480 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-15 13:03:52,480 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:03:52,480 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-15 13:03:52,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 13:03:52,482 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,482 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,482 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,482 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,483 INFO L82 PathProgramCache]: Analyzing trace with hash 435935828, now seen corresponding path program 6 times [2018-10-15 13:03:52,484 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:52,804 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 44 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:52,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:52,804 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 13:03:52,805 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 13:03:52,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 13:03:52,805 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2018-10-15 13:03:52,806 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 11 states. [2018-10-15 13:03:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:53,079 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-10-15 13:03:53,080 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 13:03:53,080 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 74 [2018-10-15 13:03:53,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:53,082 INFO L225 Difference]: With dead ends: 100 [2018-10-15 13:03:53,082 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 13:03:53,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=151, Invalid=311, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:03:53,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 13:03:53,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 91. [2018-10-15 13:03:53,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 13:03:53,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 92 transitions. [2018-10-15 13:03:53,091 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 92 transitions. Word has length 74 [2018-10-15 13:03:53,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:53,091 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 92 transitions. [2018-10-15 13:03:53,091 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 13:03:53,091 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 92 transitions. [2018-10-15 13:03:53,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 13:03:53,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:53,093 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:53,093 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:53,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:53,094 INFO L82 PathProgramCache]: Analyzing trace with hash 606798470, now seen corresponding path program 7 times [2018-10-15 13:03:53,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:53,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:53,358 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 100 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:53,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:53,359 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 13:03:53,359 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 13:03:53,359 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 13:03:53,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2018-10-15 13:03:53,360 INFO L87 Difference]: Start difference. First operand 91 states and 92 transitions. Second operand 14 states. [2018-10-15 13:03:53,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:53,765 INFO L93 Difference]: Finished difference Result 135 states and 136 transitions. [2018-10-15 13:03:53,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 13:03:53,766 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 90 [2018-10-15 13:03:53,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:53,767 INFO L225 Difference]: With dead ends: 135 [2018-10-15 13:03:53,768 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 13:03:53,768 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=180, Invalid=372, Unknown=0, NotChecked=0, Total=552 [2018-10-15 13:03:53,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 13:03:53,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2018-10-15 13:03:53,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 13:03:53,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 98 transitions. [2018-10-15 13:03:53,775 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 98 transitions. Word has length 90 [2018-10-15 13:03:53,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:53,776 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 98 transitions. [2018-10-15 13:03:53,776 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 13:03:53,776 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 98 transitions. [2018-10-15 13:03:53,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 13:03:53,778 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:53,778 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:53,778 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:53,779 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:53,779 INFO L82 PathProgramCache]: Analyzing trace with hash -1523652436, now seen corresponding path program 8 times [2018-10-15 13:03:53,780 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:53,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:54,038 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 100 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:54,038 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:54,038 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:03:54,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:03:54,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:03:54,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:03:54,039 INFO L87 Difference]: Start difference. First operand 97 states and 98 transitions. Second operand 15 states. [2018-10-15 13:03:54,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:54,687 INFO L93 Difference]: Finished difference Result 149 states and 150 transitions. [2018-10-15 13:03:54,687 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 13:03:54,687 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 96 [2018-10-15 13:03:54,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:54,688 INFO L225 Difference]: With dead ends: 149 [2018-10-15 13:03:54,688 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 13:03:54,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=237, Invalid=465, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:03:54,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 13:03:54,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2018-10-15 13:03:54,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 13:03:54,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 104 transitions. [2018-10-15 13:03:54,696 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 104 transitions. Word has length 96 [2018-10-15 13:03:54,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:54,696 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 104 transitions. [2018-10-15 13:03:54,696 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:03:54,696 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 104 transitions. [2018-10-15 13:03:54,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 13:03:54,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:54,698 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:54,699 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:54,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:54,699 INFO L82 PathProgramCache]: Analyzing trace with hash -883221934, now seen corresponding path program 9 times [2018-10-15 13:03:54,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:54,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:54,999 INFO L134 CoverageAnalysis]: Checked inductivity of 202 backedges. 102 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:54,999 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:54,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 13:03:55,000 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 13:03:55,000 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 13:03:55,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-10-15 13:03:55,001 INFO L87 Difference]: Start difference. First operand 103 states and 104 transitions. Second operand 13 states. [2018-10-15 13:03:55,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:55,382 INFO L93 Difference]: Finished difference Result 128 states and 129 transitions. [2018-10-15 13:03:55,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 13:03:55,382 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 102 [2018-10-15 13:03:55,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:55,384 INFO L225 Difference]: With dead ends: 128 [2018-10-15 13:03:55,384 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:03:55,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=247, Invalid=509, Unknown=0, NotChecked=0, Total=756 [2018-10-15 13:03:55,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:03:55,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 119. [2018-10-15 13:03:55,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 13:03:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 120 transitions. [2018-10-15 13:03:55,391 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 120 transitions. Word has length 102 [2018-10-15 13:03:55,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:55,392 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 120 transitions. [2018-10-15 13:03:55,392 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 13:03:55,392 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 120 transitions. [2018-10-15 13:03:55,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 13:03:55,394 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:55,394 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:55,394 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:55,395 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:55,395 INFO L82 PathProgramCache]: Analyzing trace with hash 230065796, now seen corresponding path program 10 times [2018-10-15 13:03:55,396 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:55,659 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 196 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:55,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:55,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 13:03:55,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 13:03:55,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 13:03:55,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=224, Unknown=0, NotChecked=0, Total=306 [2018-10-15 13:03:55,661 INFO L87 Difference]: Start difference. First operand 119 states and 120 transitions. Second operand 18 states. [2018-10-15 13:03:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,245 INFO L93 Difference]: Finished difference Result 179 states and 180 transitions. [2018-10-15 13:03:56,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 13:03:56,247 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 118 [2018-10-15 13:03:56,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,248 INFO L225 Difference]: With dead ends: 179 [2018-10-15 13:03:56,248 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 13:03:56,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=320, Invalid=672, Unknown=0, NotChecked=0, Total=992 [2018-10-15 13:03:56,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 13:03:56,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 125. [2018-10-15 13:03:56,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 13:03:56,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 126 transitions. [2018-10-15 13:03:56,255 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 126 transitions. Word has length 118 [2018-10-15 13:03:56,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,255 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 126 transitions. [2018-10-15 13:03:56,255 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 13:03:56,255 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 126 transitions. [2018-10-15 13:03:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 13:03:56,257 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,257 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,257 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,258 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,258 INFO L82 PathProgramCache]: Analyzing trace with hash -1520347222, now seen corresponding path program 11 times [2018-10-15 13:03:56,259 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:56,473 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 196 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:56,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:56,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:03:56,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:03:56,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:03:56,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:03:56,474 INFO L87 Difference]: Start difference. First operand 125 states and 126 transitions. Second operand 19 states. [2018-10-15 13:03:56,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,899 INFO L93 Difference]: Finished difference Result 193 states and 194 transitions. [2018-10-15 13:03:56,899 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 13:03:56,899 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 124 [2018-10-15 13:03:56,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,901 INFO L225 Difference]: With dead ends: 193 [2018-10-15 13:03:56,901 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 13:03:56,902 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=395, Invalid=795, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:03:56,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 13:03:56,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-15 13:03:56,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 13:03:56,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 132 transitions. [2018-10-15 13:03:56,905 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 132 transitions. Word has length 124 [2018-10-15 13:03:56,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,905 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 132 transitions. [2018-10-15 13:03:56,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:03:56,906 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 132 transitions. [2018-10-15 13:03:56,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 13:03:56,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,907 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,908 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,908 INFO L82 PathProgramCache]: Analyzing trace with hash 639120464, now seen corresponding path program 12 times [2018-10-15 13:03:56,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:57,242 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 184 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:57,242 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:57,242 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 13:03:57,243 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 13:03:57,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 13:03:57,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2018-10-15 13:03:57,243 INFO L87 Difference]: Start difference. First operand 131 states and 132 transitions. Second operand 15 states. [2018-10-15 13:03:57,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:57,903 INFO L93 Difference]: Finished difference Result 156 states and 157 transitions. [2018-10-15 13:03:57,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 13:03:57,903 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 130 [2018-10-15 13:03:57,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:57,905 INFO L225 Difference]: With dead ends: 156 [2018-10-15 13:03:57,905 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:03:57,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=367, Invalid=755, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:03:57,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:03:57,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 147. [2018-10-15 13:03:57,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 13:03:57,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-15 13:03:57,910 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 130 [2018-10-15 13:03:57,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:57,911 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-15 13:03:57,911 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 13:03:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-15 13:03:57,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 13:03:57,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:57,913 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:57,913 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:57,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:57,913 INFO L82 PathProgramCache]: Analyzing trace with hash -307501950, now seen corresponding path program 13 times [2018-10-15 13:03:57,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:58,909 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 324 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:58,910 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:58,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 13:03:58,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 13:03:58,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 13:03:58,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2018-10-15 13:03:58,911 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 22 states. [2018-10-15 13:03:59,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:59,466 INFO L93 Difference]: Finished difference Result 223 states and 224 transitions. [2018-10-15 13:03:59,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 13:03:59,467 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 146 [2018-10-15 13:03:59,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:59,468 INFO L225 Difference]: With dead ends: 223 [2018-10-15 13:03:59,469 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 13:03:59,471 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=500, Invalid=1060, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:03:59,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 13:03:59,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 153. [2018-10-15 13:03:59,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 13:03:59,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-10-15 13:03:59,475 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 146 [2018-10-15 13:03:59,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:59,476 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-10-15 13:03:59,476 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 13:03:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-10-15 13:03:59,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 13:03:59,477 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:59,478 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:59,478 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:59,478 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:59,478 INFO L82 PathProgramCache]: Analyzing trace with hash 499065000, now seen corresponding path program 14 times [2018-10-15 13:03:59,479 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:59,997 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 324 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:59,997 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:59,997 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:03:59,998 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:03:59,998 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:03:59,998 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:03:59,998 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 23 states. [2018-10-15 13:04:00,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:00,650 INFO L93 Difference]: Finished difference Result 237 states and 238 transitions. [2018-10-15 13:04:00,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 13:04:00,650 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 152 [2018-10-15 13:04:00,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:00,652 INFO L225 Difference]: With dead ends: 237 [2018-10-15 13:04:00,652 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 13:04:00,653 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 180 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=593, Invalid=1213, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:04:00,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 13:04:00,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 159. [2018-10-15 13:04:00,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 13:04:00,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-15 13:04:00,656 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 152 [2018-10-15 13:04:00,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:00,656 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-15 13:04:00,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:04:00,657 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-15 13:04:00,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 13:04:00,657 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:00,658 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:00,658 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:00,658 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:00,658 INFO L82 PathProgramCache]: Analyzing trace with hash -2086524850, now seen corresponding path program 15 times [2018-10-15 13:04:00,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 290 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:00,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:00,935 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 13:04:00,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 13:04:00,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 13:04:00,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=164, Unknown=0, NotChecked=0, Total=272 [2018-10-15 13:04:00,936 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 17 states. [2018-10-15 13:04:01,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:01,355 INFO L93 Difference]: Finished difference Result 184 states and 185 transitions. [2018-10-15 13:04:01,356 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 13:04:01,356 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 158 [2018-10-15 13:04:01,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:01,358 INFO L225 Difference]: With dead ends: 184 [2018-10-15 13:04:01,358 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:04:01,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 428 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=511, Invalid=1049, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 13:04:01,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:04:01,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 175. [2018-10-15 13:04:01,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 13:04:01,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 176 transitions. [2018-10-15 13:04:01,363 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 176 transitions. Word has length 158 [2018-10-15 13:04:01,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:01,364 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 176 transitions. [2018-10-15 13:04:01,364 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 13:04:01,364 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 176 transitions. [2018-10-15 13:04:01,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 13:04:01,365 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:01,365 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:01,365 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:01,365 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:01,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1601838208, now seen corresponding path program 16 times [2018-10-15 13:04:01,366 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:01,789 INFO L134 CoverageAnalysis]: Checked inductivity of 774 backedges. 484 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:01,790 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:01,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 13:04:01,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 13:04:01,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 13:04:01,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2018-10-15 13:04:01,791 INFO L87 Difference]: Start difference. First operand 175 states and 176 transitions. Second operand 26 states. [2018-10-15 13:04:02,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:02,447 INFO L93 Difference]: Finished difference Result 267 states and 268 transitions. [2018-10-15 13:04:02,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 13:04:02,448 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 174 [2018-10-15 13:04:02,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:02,449 INFO L225 Difference]: With dead ends: 267 [2018-10-15 13:04:02,450 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 13:04:02,451 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 251 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=720, Invalid=1536, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 13:04:02,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 13:04:02,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 13:04:02,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 13:04:02,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 182 transitions. [2018-10-15 13:04:02,455 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 182 transitions. Word has length 174 [2018-10-15 13:04:02,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:02,455 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 182 transitions. [2018-10-15 13:04:02,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 13:04:02,455 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 182 transitions. [2018-10-15 13:04:02,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 13:04:02,456 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:02,456 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:02,457 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:02,457 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:02,457 INFO L82 PathProgramCache]: Analyzing trace with hash 1618428838, now seen corresponding path program 17 times [2018-10-15 13:04:02,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:02,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:03,379 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 484 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:03,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:03,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:04:03,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:04:03,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:04:03,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=519, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:04:03,381 INFO L87 Difference]: Start difference. First operand 181 states and 182 transitions. Second operand 27 states. [2018-10-15 13:04:04,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:04,888 INFO L93 Difference]: Finished difference Result 281 states and 282 transitions. [2018-10-15 13:04:04,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 13:04:04,889 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 180 [2018-10-15 13:04:04,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:04,891 INFO L225 Difference]: With dead ends: 281 [2018-10-15 13:04:04,891 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 13:04:04,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 264 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=831, Invalid=1719, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:04:04,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 13:04:04,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 187. [2018-10-15 13:04:04,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 13:04:04,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 188 transitions. [2018-10-15 13:04:04,897 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 188 transitions. Word has length 180 [2018-10-15 13:04:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:04,897 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 188 transitions. [2018-10-15 13:04:04,897 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:04:04,897 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 188 transitions. [2018-10-15 13:04:04,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 13:04:04,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:04,899 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:04,899 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:04,899 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:04,900 INFO L82 PathProgramCache]: Analyzing trace with hash -588777908, now seen corresponding path program 18 times [2018-10-15 13:04:04,900 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:04,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:05,301 INFO L134 CoverageAnalysis]: Checked inductivity of 904 backedges. 420 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:05,301 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:05,302 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 13:04:05,302 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 13:04:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 13:04:05,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=203, Unknown=0, NotChecked=0, Total=342 [2018-10-15 13:04:05,303 INFO L87 Difference]: Start difference. First operand 187 states and 188 transitions. Second operand 19 states. [2018-10-15 13:04:05,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:05,861 INFO L93 Difference]: Finished difference Result 212 states and 213 transitions. [2018-10-15 13:04:05,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 13:04:05,862 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 186 [2018-10-15 13:04:05,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:05,864 INFO L225 Difference]: With dead ends: 212 [2018-10-15 13:04:05,864 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 13:04:05,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 584 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=679, Invalid=1391, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:04:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 13:04:05,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 203. [2018-10-15 13:04:05,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 13:04:05,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 204 transitions. [2018-10-15 13:04:05,869 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 204 transitions. Word has length 186 [2018-10-15 13:04:05,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:05,869 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 204 transitions. [2018-10-15 13:04:05,869 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 13:04:05,869 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 204 transitions. [2018-10-15 13:04:05,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 13:04:05,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:05,871 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:05,871 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:05,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash -1643106690, now seen corresponding path program 19 times [2018-10-15 13:04:05,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:05,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:06,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 676 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:06,386 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:06,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 13:04:06,386 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 13:04:06,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 13:04:06,387 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=226, Invalid=644, Unknown=0, NotChecked=0, Total=870 [2018-10-15 13:04:06,387 INFO L87 Difference]: Start difference. First operand 203 states and 204 transitions. Second operand 30 states. [2018-10-15 13:04:07,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:07,201 INFO L93 Difference]: Finished difference Result 311 states and 312 transitions. [2018-10-15 13:04:07,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 13:04:07,204 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 202 [2018-10-15 13:04:07,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:07,206 INFO L225 Difference]: With dead ends: 311 [2018-10-15 13:04:07,206 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 13:04:07,207 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 349 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=980, Invalid=2100, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 13:04:07,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 13:04:07,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 209. [2018-10-15 13:04:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 13:04:07,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 210 transitions. [2018-10-15 13:04:07,211 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 210 transitions. Word has length 202 [2018-10-15 13:04:07,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:07,211 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 210 transitions. [2018-10-15 13:04:07,212 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 13:04:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 210 transitions. [2018-10-15 13:04:07,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 13:04:07,213 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:07,213 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:07,213 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:07,213 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:07,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1086799708, now seen corresponding path program 20 times [2018-10-15 13:04:07,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:07,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1170 backedges. 676 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:07,960 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:07,960 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:04:07,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:04:07,961 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:04:07,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=689, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:04:07,962 INFO L87 Difference]: Start difference. First operand 209 states and 210 transitions. Second operand 31 states. [2018-10-15 13:04:09,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:09,895 INFO L93 Difference]: Finished difference Result 325 states and 326 transitions. [2018-10-15 13:04:09,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 13:04:09,895 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 208 [2018-10-15 13:04:09,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:09,897 INFO L225 Difference]: With dead ends: 325 [2018-10-15 13:04:09,897 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 13:04:09,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 364 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1109, Invalid=2313, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:04:09,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 13:04:09,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 215. [2018-10-15 13:04:09,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 13:04:09,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 216 transitions. [2018-10-15 13:04:09,902 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 216 transitions. Word has length 208 [2018-10-15 13:04:09,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:09,903 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 216 transitions. [2018-10-15 13:04:09,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:04:09,903 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 216 transitions. [2018-10-15 13:04:09,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 13:04:09,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:09,904 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:09,904 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:09,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:09,905 INFO L82 PathProgramCache]: Analyzing trace with hash -1973903798, now seen corresponding path program 21 times [2018-10-15 13:04:09,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:09,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:11,067 INFO L134 CoverageAnalysis]: Checked inductivity of 1250 backedges. 574 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:11,067 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:11,067 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 13:04:11,068 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 13:04:11,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 13:04:11,068 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=246, Unknown=0, NotChecked=0, Total=420 [2018-10-15 13:04:11,069 INFO L87 Difference]: Start difference. First operand 215 states and 216 transitions. Second operand 21 states. [2018-10-15 13:04:11,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:11,870 INFO L93 Difference]: Finished difference Result 240 states and 241 transitions. [2018-10-15 13:04:11,870 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 13:04:11,871 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 214 [2018-10-15 13:04:11,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:11,872 INFO L225 Difference]: With dead ends: 240 [2018-10-15 13:04:11,873 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 13:04:11,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 764 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=871, Invalid=1781, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 13:04:11,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 13:04:11,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 231. [2018-10-15 13:04:11,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 13:04:11,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 232 transitions. [2018-10-15 13:04:11,879 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 232 transitions. Word has length 214 [2018-10-15 13:04:11,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:11,879 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 232 transitions. [2018-10-15 13:04:11,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 13:04:11,880 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 232 transitions. [2018-10-15 13:04:11,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 13:04:11,881 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:11,881 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 15, 15, 15, 15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:11,881 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:11,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:11,882 INFO L82 PathProgramCache]: Analyzing trace with hash 1138563708, now seen corresponding path program 22 times [2018-10-15 13:04:11,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:11,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:12,869 INFO L134 CoverageAnalysis]: Checked inductivity of 1474 backedges. 900 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:12,869 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:12,869 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 13:04:12,870 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 13:04:12,870 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 13:04:12,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=290, Invalid=832, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 13:04:12,871 INFO L87 Difference]: Start difference. First operand 231 states and 232 transitions. Second operand 34 states. [2018-10-15 13:04:13,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:13,988 INFO L93 Difference]: Finished difference Result 355 states and 356 transitions. [2018-10-15 13:04:13,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 13:04:13,988 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 230 [2018-10-15 13:04:13,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:13,989 INFO L225 Difference]: With dead ends: 355 [2018-10-15 13:04:13,990 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 13:04:13,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 463 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1280, Invalid=2752, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:04:13,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 13:04:13,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 237. [2018-10-15 13:04:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-15 13:04:13,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 238 transitions. [2018-10-15 13:04:13,996 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 238 transitions. Word has length 230 [2018-10-15 13:04:13,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:13,997 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 238 transitions. [2018-10-15 13:04:13,997 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 13:04:13,997 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 238 transitions. [2018-10-15 13:04:13,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-15 13:04:13,998 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:13,998 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:13,999 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:13,999 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:13,999 INFO L82 PathProgramCache]: Analyzing trace with hash 1261606818, now seen corresponding path program 23 times [2018-10-15 13:04:14,000 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:14,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:14,659 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 900 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:14,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:14,659 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:04:14,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:04:14,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:04:14,660 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=307, Invalid=883, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:04:14,660 INFO L87 Difference]: Start difference. First operand 237 states and 238 transitions. Second operand 35 states. [2018-10-15 13:04:15,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:15,810 INFO L93 Difference]: Finished difference Result 369 states and 370 transitions. [2018-10-15 13:04:15,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 13:04:15,811 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 236 [2018-10-15 13:04:15,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:15,813 INFO L225 Difference]: With dead ends: 369 [2018-10-15 13:04:15,813 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 13:04:15,815 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 480 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1427, Invalid=2995, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:04:15,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 13:04:15,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 243. [2018-10-15 13:04:15,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 13:04:15,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 244 transitions. [2018-10-15 13:04:15,819 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 244 transitions. Word has length 236 [2018-10-15 13:04:15,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:15,819 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 244 transitions. [2018-10-15 13:04:15,820 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:04:15,820 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 244 transitions. [2018-10-15 13:04:15,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 13:04:15,821 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:15,821 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:15,821 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:15,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:15,822 INFO L82 PathProgramCache]: Analyzing trace with hash 65216584, now seen corresponding path program 24 times [2018-10-15 13:04:15,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 1652 backedges. 752 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:16,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:16,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 13:04:16,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 13:04:16,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 13:04:16,377 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=293, Unknown=0, NotChecked=0, Total=506 [2018-10-15 13:04:16,377 INFO L87 Difference]: Start difference. First operand 243 states and 244 transitions. Second operand 23 states. [2018-10-15 13:04:18,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:18,739 INFO L93 Difference]: Finished difference Result 268 states and 269 transitions. [2018-10-15 13:04:18,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 13:04:18,739 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 242 [2018-10-15 13:04:18,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:18,741 INFO L225 Difference]: With dead ends: 268 [2018-10-15 13:04:18,741 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 13:04:18,743 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 968 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=1087, Invalid=2219, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:04:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 13:04:18,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 259. [2018-10-15 13:04:18,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 13:04:18,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 260 transitions. [2018-10-15 13:04:18,747 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 260 transitions. Word has length 242 [2018-10-15 13:04:18,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:18,747 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 260 transitions. [2018-10-15 13:04:18,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 13:04:18,747 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 260 transitions. [2018-10-15 13:04:18,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 13:04:18,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:18,749 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 17, 17, 17, 17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:18,749 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:18,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:18,750 INFO L82 PathProgramCache]: Analyzing trace with hash 181395578, now seen corresponding path program 25 times [2018-10-15 13:04:18,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:18,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:19,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1908 backedges. 1156 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:19,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:19,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 13:04:19,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 13:04:19,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 13:04:19,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=1044, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 13:04:19,737 INFO L87 Difference]: Start difference. First operand 259 states and 260 transitions. Second operand 38 states. [2018-10-15 13:04:20,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:20,945 INFO L93 Difference]: Finished difference Result 399 states and 400 transitions. [2018-10-15 13:04:20,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 13:04:20,945 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 258 [2018-10-15 13:04:20,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:20,947 INFO L225 Difference]: With dead ends: 399 [2018-10-15 13:04:20,947 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 13:04:20,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1620, Invalid=3492, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 13:04:20,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 13:04:20,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 265. [2018-10-15 13:04:20,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 13:04:20,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 266 transitions. [2018-10-15 13:04:20,953 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 266 transitions. Word has length 258 [2018-10-15 13:04:20,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:20,953 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 266 transitions. [2018-10-15 13:04:20,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 13:04:20,954 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 266 transitions. [2018-10-15 13:04:20,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 13:04:20,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:20,955 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:20,955 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:20,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:20,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1793865568, now seen corresponding path program 26 times [2018-10-15 13:04:20,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:22,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2006 backedges. 1156 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:22,134 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:22,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:04:22,134 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:04:22,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:04:22,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=1101, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:04:22,135 INFO L87 Difference]: Start difference. First operand 265 states and 266 transitions. Second operand 39 states. [2018-10-15 13:04:23,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:23,963 INFO L93 Difference]: Finished difference Result 413 states and 414 transitions. [2018-10-15 13:04:23,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 13:04:23,963 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 264 [2018-10-15 13:04:23,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:23,965 INFO L225 Difference]: With dead ends: 413 [2018-10-15 13:04:23,965 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 13:04:23,967 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 612 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=1785, Invalid=3765, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:04:23,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 13:04:23,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2018-10-15 13:04:23,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 13:04:23,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 272 transitions. [2018-10-15 13:04:23,971 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 272 transitions. Word has length 264 [2018-10-15 13:04:23,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:23,971 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 272 transitions. [2018-10-15 13:04:23,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:04:23,972 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 272 transitions. [2018-10-15 13:04:23,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 13:04:23,973 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:23,973 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:23,973 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:23,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:23,974 INFO L82 PathProgramCache]: Analyzing trace with hash -1594459066, now seen corresponding path program 27 times [2018-10-15 13:04:23,974 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 954 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:25,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:25,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 13:04:25,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 13:04:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 13:04:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=344, Unknown=0, NotChecked=0, Total=600 [2018-10-15 13:04:25,110 INFO L87 Difference]: Start difference. First operand 271 states and 272 transitions. Second operand 25 states. [2018-10-15 13:04:25,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:25,902 INFO L93 Difference]: Finished difference Result 296 states and 297 transitions. [2018-10-15 13:04:25,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 13:04:25,903 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 270 [2018-10-15 13:04:25,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:25,905 INFO L225 Difference]: With dead ends: 296 [2018-10-15 13:04:25,905 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 13:04:25,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1196 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1327, Invalid=2705, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 13:04:25,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 13:04:25,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 287. [2018-10-15 13:04:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 13:04:25,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 288 transitions. [2018-10-15 13:04:25,910 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 288 transitions. Word has length 270 [2018-10-15 13:04:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:25,910 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 288 transitions. [2018-10-15 13:04:25,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 13:04:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 288 transitions. [2018-10-15 13:04:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-15 13:04:25,911 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:25,911 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 19, 19, 19, 19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:25,912 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:25,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1940422536, now seen corresponding path program 28 times [2018-10-15 13:04:25,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:26,694 INFO L134 CoverageAnalysis]: Checked inductivity of 2398 backedges. 1444 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:26,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:26,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 13:04:26,695 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 13:04:26,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 13:04:26,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=442, Invalid=1280, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 13:04:26,695 INFO L87 Difference]: Start difference. First operand 287 states and 288 transitions. Second operand 42 states. [2018-10-15 13:04:28,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:28,375 INFO L93 Difference]: Finished difference Result 443 states and 444 transitions. [2018-10-15 13:04:28,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 13:04:28,376 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 286 [2018-10-15 13:04:28,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:28,378 INFO L225 Difference]: With dead ends: 443 [2018-10-15 13:04:28,378 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 13:04:28,379 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 739 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2000, Invalid=4320, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 13:04:28,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 13:04:28,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2018-10-15 13:04:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 13:04:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 294 transitions. [2018-10-15 13:04:28,383 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 294 transitions. Word has length 286 [2018-10-15 13:04:28,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:28,383 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 294 transitions. [2018-10-15 13:04:28,383 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 13:04:28,384 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 294 transitions. [2018-10-15 13:04:28,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 13:04:28,385 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:28,385 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:28,385 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:28,386 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:28,386 INFO L82 PathProgramCache]: Analyzing trace with hash 1829458846, now seen corresponding path program 29 times [2018-10-15 13:04:28,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:28,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:29,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 1444 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:29,433 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:29,433 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:04:29,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:04:29,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:04:29,434 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=463, Invalid=1343, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:04:29,434 INFO L87 Difference]: Start difference. First operand 293 states and 294 transitions. Second operand 43 states. [2018-10-15 13:04:31,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:31,124 INFO L93 Difference]: Finished difference Result 457 states and 458 transitions. [2018-10-15 13:04:31,125 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 13:04:31,125 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 292 [2018-10-15 13:04:31,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:31,127 INFO L225 Difference]: With dead ends: 457 [2018-10-15 13:04:31,127 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 13:04:31,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 760 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2183, Invalid=4623, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:04:31,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 13:04:31,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 299. [2018-10-15 13:04:31,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 13:04:31,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 300 transitions. [2018-10-15 13:04:31,131 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 300 transitions. Word has length 292 [2018-10-15 13:04:31,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:31,131 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 300 transitions. [2018-10-15 13:04:31,131 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:04:31,131 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 300 transitions. [2018-10-15 13:04:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 13:04:31,133 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:31,133 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:31,133 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:31,133 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1484894788, now seen corresponding path program 30 times [2018-10-15 13:04:31,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:31,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:31,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2624 backedges. 1180 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:31,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:31,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 13:04:31,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 13:04:31,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 13:04:31,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=399, Unknown=0, NotChecked=0, Total=702 [2018-10-15 13:04:31,663 INFO L87 Difference]: Start difference. First operand 299 states and 300 transitions. Second operand 27 states. [2018-10-15 13:04:32,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:32,944 INFO L93 Difference]: Finished difference Result 324 states and 325 transitions. [2018-10-15 13:04:32,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 13:04:32,944 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 298 [2018-10-15 13:04:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:32,947 INFO L225 Difference]: With dead ends: 324 [2018-10-15 13:04:32,947 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 13:04:32,948 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1591, Invalid=3239, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:04:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 13:04:32,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 315. [2018-10-15 13:04:32,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-10-15 13:04:32,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 316 transitions. [2018-10-15 13:04:32,952 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 316 transitions. Word has length 298 [2018-10-15 13:04:32,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:32,953 INFO L481 AbstractCegarLoop]: Abstraction has 315 states and 316 transitions. [2018-10-15 13:04:32,953 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 13:04:32,953 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 316 transitions. [2018-10-15 13:04:32,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2018-10-15 13:04:32,954 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:32,955 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 21, 21, 21, 21, 21, 21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:32,955 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:32,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:32,955 INFO L82 PathProgramCache]: Analyzing trace with hash 23263862, now seen corresponding path program 31 times [2018-10-15 13:04:32,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:32,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2944 backedges. 1764 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:34,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:34,026 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 13:04:34,027 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 13:04:34,027 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 13:04:34,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=530, Invalid=1540, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 13:04:34,027 INFO L87 Difference]: Start difference. First operand 315 states and 316 transitions. Second operand 46 states. [2018-10-15 13:04:35,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:35,920 INFO L93 Difference]: Finished difference Result 487 states and 488 transitions. [2018-10-15 13:04:35,920 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 13:04:35,920 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 314 [2018-10-15 13:04:35,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:35,922 INFO L225 Difference]: With dead ends: 487 [2018-10-15 13:04:35,923 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 13:04:35,924 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 901 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2420, Invalid=5236, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:04:35,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 13:04:35,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 321. [2018-10-15 13:04:35,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 321 states. [2018-10-15 13:04:35,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 322 transitions. [2018-10-15 13:04:35,929 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 322 transitions. Word has length 314 [2018-10-15 13:04:35,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:35,929 INFO L481 AbstractCegarLoop]: Abstraction has 321 states and 322 transitions. [2018-10-15 13:04:35,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 13:04:35,929 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 322 transitions. [2018-10-15 13:04:35,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 321 [2018-10-15 13:04:35,931 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:35,931 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:35,931 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:35,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:35,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1563936612, now seen corresponding path program 32 times [2018-10-15 13:04:35,933 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:35,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:36,935 INFO L134 CoverageAnalysis]: Checked inductivity of 3066 backedges. 1764 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:36,935 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:36,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:04:36,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:04:36,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:04:36,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=553, Invalid=1609, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:04:36,937 INFO L87 Difference]: Start difference. First operand 321 states and 322 transitions. Second operand 47 states. [2018-10-15 13:04:38,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:38,616 INFO L93 Difference]: Finished difference Result 501 states and 502 transitions. [2018-10-15 13:04:38,616 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 13:04:38,616 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 320 [2018-10-15 13:04:38,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:38,619 INFO L225 Difference]: With dead ends: 501 [2018-10-15 13:04:38,619 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 13:04:38,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 924 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2621, Invalid=5569, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:04:38,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 13:04:38,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 327. [2018-10-15 13:04:38,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 327 states. [2018-10-15 13:04:38,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 327 states to 327 states and 328 transitions. [2018-10-15 13:04:38,624 INFO L78 Accepts]: Start accepts. Automaton has 327 states and 328 transitions. Word has length 320 [2018-10-15 13:04:38,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:38,625 INFO L481 AbstractCegarLoop]: Abstraction has 327 states and 328 transitions. [2018-10-15 13:04:38,625 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:04:38,625 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 328 transitions. [2018-10-15 13:04:38,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2018-10-15 13:04:38,627 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:38,627 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:38,627 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:38,627 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:38,627 INFO L82 PathProgramCache]: Analyzing trace with hash -2131508670, now seen corresponding path program 33 times [2018-10-15 13:04:38,628 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:39,202 INFO L134 CoverageAnalysis]: Checked inductivity of 3194 backedges. 1430 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:39,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:39,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 13:04:39,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 13:04:39,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 13:04:39,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=458, Unknown=0, NotChecked=0, Total=812 [2018-10-15 13:04:39,203 INFO L87 Difference]: Start difference. First operand 327 states and 328 transitions. Second operand 29 states. [2018-10-15 13:04:40,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:40,443 INFO L93 Difference]: Finished difference Result 352 states and 353 transitions. [2018-10-15 13:04:40,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 13:04:40,444 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 326 [2018-10-15 13:04:40,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:40,446 INFO L225 Difference]: With dead ends: 352 [2018-10-15 13:04:40,446 INFO L226 Difference]: Without dead ends: 352 [2018-10-15 13:04:40,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1724 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1879, Invalid=3821, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 13:04:40,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-15 13:04:40,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 343. [2018-10-15 13:04:40,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 13:04:40,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 344 transitions. [2018-10-15 13:04:40,452 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 344 transitions. Word has length 326 [2018-10-15 13:04:40,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:40,452 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 344 transitions. [2018-10-15 13:04:40,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 13:04:40,453 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 344 transitions. [2018-10-15 13:04:40,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-15 13:04:40,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:40,455 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 23, 23, 23, 23, 23, 23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:40,455 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:40,455 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:40,455 INFO L82 PathProgramCache]: Analyzing trace with hash 39931508, now seen corresponding path program 34 times [2018-10-15 13:04:40,456 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:41,584 INFO L134 CoverageAnalysis]: Checked inductivity of 3546 backedges. 2116 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:41,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:41,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 13:04:41,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 13:04:41,585 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 13:04:41,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=626, Invalid=1824, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 13:04:41,586 INFO L87 Difference]: Start difference. First operand 343 states and 344 transitions. Second operand 50 states. [2018-10-15 13:04:43,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:43,387 INFO L93 Difference]: Finished difference Result 531 states and 532 transitions. [2018-10-15 13:04:43,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 13:04:43,387 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 342 [2018-10-15 13:04:43,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:43,390 INFO L225 Difference]: With dead ends: 531 [2018-10-15 13:04:43,390 INFO L226 Difference]: Without dead ends: 352 [2018-10-15 13:04:43,392 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1079 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2880, Invalid=6240, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 13:04:43,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2018-10-15 13:04:43,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 349. [2018-10-15 13:04:43,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 13:04:43,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 350 transitions. [2018-10-15 13:04:43,396 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 350 transitions. Word has length 342 [2018-10-15 13:04:43,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:43,396 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 350 transitions. [2018-10-15 13:04:43,396 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 13:04:43,396 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 350 transitions. [2018-10-15 13:04:43,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 13:04:43,398 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:43,398 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:43,399 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:43,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:43,399 INFO L82 PathProgramCache]: Analyzing trace with hash -981895270, now seen corresponding path program 35 times [2018-10-15 13:04:43,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:44,535 INFO L134 CoverageAnalysis]: Checked inductivity of 3680 backedges. 2116 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:44,535 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:44,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:04:44,536 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:04:44,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:04:44,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=651, Invalid=1899, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:04:44,537 INFO L87 Difference]: Start difference. First operand 349 states and 350 transitions. Second operand 51 states. [2018-10-15 13:04:46,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:46,799 INFO L93 Difference]: Finished difference Result 545 states and 546 transitions. [2018-10-15 13:04:46,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 13:04:46,799 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 348 [2018-10-15 13:04:46,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:46,801 INFO L225 Difference]: With dead ends: 545 [2018-10-15 13:04:46,801 INFO L226 Difference]: Without dead ends: 358 [2018-10-15 13:04:46,802 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1104 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3099, Invalid=6603, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:04:46,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2018-10-15 13:04:46,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 355. [2018-10-15 13:04:46,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 355 states. [2018-10-15 13:04:46,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 355 states to 355 states and 356 transitions. [2018-10-15 13:04:46,807 INFO L78 Accepts]: Start accepts. Automaton has 355 states and 356 transitions. Word has length 348 [2018-10-15 13:04:46,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:46,807 INFO L481 AbstractCegarLoop]: Abstraction has 355 states and 356 transitions. [2018-10-15 13:04:46,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:04:46,807 INFO L276 IsEmpty]: Start isEmpty. Operand 355 states and 356 transitions. [2018-10-15 13:04:46,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 355 [2018-10-15 13:04:46,809 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:46,809 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:46,811 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:46,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:46,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1875137472, now seen corresponding path program 36 times [2018-10-15 13:04:46,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:46,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:47,518 INFO L134 CoverageAnalysis]: Checked inductivity of 3820 backedges. 1704 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:47,518 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:47,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 13:04:47,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 13:04:47,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 13:04:47,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=521, Unknown=0, NotChecked=0, Total=930 [2018-10-15 13:04:47,520 INFO L87 Difference]: Start difference. First operand 355 states and 356 transitions. Second operand 31 states. [2018-10-15 13:04:48,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:48,645 INFO L93 Difference]: Finished difference Result 380 states and 381 transitions. [2018-10-15 13:04:48,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 13:04:48,646 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 354 [2018-10-15 13:04:48,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:48,648 INFO L225 Difference]: With dead ends: 380 [2018-10-15 13:04:48,648 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 13:04:48,649 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2024 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2191, Invalid=4451, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:04:48,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 13:04:48,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 371. [2018-10-15 13:04:48,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 13:04:48,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 372 transitions. [2018-10-15 13:04:48,652 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 372 transitions. Word has length 354 [2018-10-15 13:04:48,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:48,652 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 372 transitions. [2018-10-15 13:04:48,652 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 13:04:48,652 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 372 transitions. [2018-10-15 13:04:48,654 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 13:04:48,654 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:48,654 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 25, 25, 25, 25, 25, 25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:48,654 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:48,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:48,655 INFO L82 PathProgramCache]: Analyzing trace with hash 1195474034, now seen corresponding path program 37 times [2018-10-15 13:04:48,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:50,306 INFO L134 CoverageAnalysis]: Checked inductivity of 4204 backedges. 2500 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:50,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:50,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 13:04:50,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 13:04:50,307 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 13:04:50,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=730, Invalid=2132, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 13:04:50,308 INFO L87 Difference]: Start difference. First operand 371 states and 372 transitions. Second operand 54 states. [2018-10-15 13:04:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:52,641 INFO L93 Difference]: Finished difference Result 575 states and 576 transitions. [2018-10-15 13:04:52,642 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 13:04:52,642 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 370 [2018-10-15 13:04:52,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:52,644 INFO L225 Difference]: With dead ends: 575 [2018-10-15 13:04:52,644 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 13:04:52,646 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1273 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3380, Invalid=7332, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 13:04:52,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 13:04:52,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 377. [2018-10-15 13:04:52,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 377 states. [2018-10-15 13:04:52,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 378 transitions. [2018-10-15 13:04:52,651 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 378 transitions. Word has length 370 [2018-10-15 13:04:52,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:52,651 INFO L481 AbstractCegarLoop]: Abstraction has 377 states and 378 transitions. [2018-10-15 13:04:52,651 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 13:04:52,651 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 378 transitions. [2018-10-15 13:04:52,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 377 [2018-10-15 13:04:52,653 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:52,654 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:52,654 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:52,654 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:52,654 INFO L82 PathProgramCache]: Analyzing trace with hash -473034600, now seen corresponding path program 38 times [2018-10-15 13:04:52,655 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:52,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:53,971 INFO L134 CoverageAnalysis]: Checked inductivity of 4350 backedges. 2500 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:53,972 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:53,972 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:04:53,972 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:04:53,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:04:53,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=757, Invalid=2213, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:04:53,973 INFO L87 Difference]: Start difference. First operand 377 states and 378 transitions. Second operand 55 states. [2018-10-15 13:04:56,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:56,586 INFO L93 Difference]: Finished difference Result 589 states and 590 transitions. [2018-10-15 13:04:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 13:04:56,586 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 376 [2018-10-15 13:04:56,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:56,589 INFO L225 Difference]: With dead ends: 589 [2018-10-15 13:04:56,589 INFO L226 Difference]: Without dead ends: 386 [2018-10-15 13:04:56,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1300 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3617, Invalid=7725, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:04:56,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2018-10-15 13:04:56,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 383. [2018-10-15 13:04:56,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-15 13:04:56,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 384 transitions. [2018-10-15 13:04:56,593 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 384 transitions. Word has length 376 [2018-10-15 13:04:56,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:56,593 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 384 transitions. [2018-10-15 13:04:56,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:04:56,593 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 384 transitions. [2018-10-15 13:04:56,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-15 13:04:56,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:56,595 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:56,595 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:56,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:56,595 INFO L82 PathProgramCache]: Analyzing trace with hash -607621058, now seen corresponding path program 39 times [2018-10-15 13:04:56,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:04:57,417 INFO L134 CoverageAnalysis]: Checked inductivity of 4502 backedges. 2002 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:04:57,417 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:04:57,417 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 13:04:57,418 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 13:04:57,418 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 13:04:57,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=588, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 13:04:57,419 INFO L87 Difference]: Start difference. First operand 383 states and 384 transitions. Second operand 33 states. [2018-10-15 13:04:58,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:04:58,725 INFO L93 Difference]: Finished difference Result 408 states and 409 transitions. [2018-10-15 13:04:58,725 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 13:04:58,725 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 382 [2018-10-15 13:04:58,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:04:58,727 INFO L225 Difference]: With dead ends: 408 [2018-10-15 13:04:58,727 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 13:04:58,728 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2348 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2527, Invalid=5129, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 13:04:58,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 13:04:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 399. [2018-10-15 13:04:58,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 399 states. [2018-10-15 13:04:58,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 399 states to 399 states and 400 transitions. [2018-10-15 13:04:58,731 INFO L78 Accepts]: Start accepts. Automaton has 399 states and 400 transitions. Word has length 382 [2018-10-15 13:04:58,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:04:58,732 INFO L481 AbstractCegarLoop]: Abstraction has 399 states and 400 transitions. [2018-10-15 13:04:58,732 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 13:04:58,732 INFO L276 IsEmpty]: Start isEmpty. Operand 399 states and 400 transitions. [2018-10-15 13:04:58,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 399 [2018-10-15 13:04:58,734 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:04:58,734 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 27, 27, 27, 27, 27, 27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:04:58,734 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:04:58,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:04:58,735 INFO L82 PathProgramCache]: Analyzing trace with hash 1735558256, now seen corresponding path program 40 times [2018-10-15 13:04:58,735 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:04:58,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:00,009 INFO L134 CoverageAnalysis]: Checked inductivity of 4918 backedges. 2916 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:00,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:00,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 13:05:00,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 13:05:00,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 13:05:00,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=842, Invalid=2464, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 13:05:00,011 INFO L87 Difference]: Start difference. First operand 399 states and 400 transitions. Second operand 58 states. [2018-10-15 13:05:02,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:02,712 INFO L93 Difference]: Finished difference Result 619 states and 620 transitions. [2018-10-15 13:05:02,713 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 13:05:02,713 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 398 [2018-10-15 13:05:02,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:02,715 INFO L225 Difference]: With dead ends: 619 [2018-10-15 13:05:02,715 INFO L226 Difference]: Without dead ends: 408 [2018-10-15 13:05:02,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1483 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3920, Invalid=8512, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 13:05:02,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2018-10-15 13:05:02,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 405. [2018-10-15 13:05:02,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 405 states. [2018-10-15 13:05:02,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 405 states to 405 states and 406 transitions. [2018-10-15 13:05:02,721 INFO L78 Accepts]: Start accepts. Automaton has 405 states and 406 transitions. Word has length 398 [2018-10-15 13:05:02,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:02,721 INFO L481 AbstractCegarLoop]: Abstraction has 405 states and 406 transitions. [2018-10-15 13:05:02,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 13:05:02,721 INFO L276 IsEmpty]: Start isEmpty. Operand 405 states and 406 transitions. [2018-10-15 13:05:02,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 405 [2018-10-15 13:05:02,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:02,724 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:02,724 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:02,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:02,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1274348438, now seen corresponding path program 41 times [2018-10-15 13:05:02,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:02,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:04,356 INFO L134 CoverageAnalysis]: Checked inductivity of 5076 backedges. 2916 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:04,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:04,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:05:04,357 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:05:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:05:04,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=871, Invalid=2551, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:05:04,357 INFO L87 Difference]: Start difference. First operand 405 states and 406 transitions. Second operand 59 states. [2018-10-15 13:05:07,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:07,414 INFO L93 Difference]: Finished difference Result 633 states and 634 transitions. [2018-10-15 13:05:07,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 13:05:07,415 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 404 [2018-10-15 13:05:07,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:07,416 INFO L225 Difference]: With dead ends: 633 [2018-10-15 13:05:07,417 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 13:05:07,418 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1512 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4175, Invalid=8935, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:05:07,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 13:05:07,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 411. [2018-10-15 13:05:07,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 411 states. [2018-10-15 13:05:07,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 412 transitions. [2018-10-15 13:05:07,422 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 412 transitions. Word has length 404 [2018-10-15 13:05:07,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:07,423 INFO L481 AbstractCegarLoop]: Abstraction has 411 states and 412 transitions. [2018-10-15 13:05:07,423 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:05:07,423 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 412 transitions. [2018-10-15 13:05:07,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 411 [2018-10-15 13:05:07,425 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:07,425 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:07,426 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:07,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:07,426 INFO L82 PathProgramCache]: Analyzing trace with hash 1485377084, now seen corresponding path program 42 times [2018-10-15 13:05:07,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:08,141 INFO L134 CoverageAnalysis]: Checked inductivity of 5240 backedges. 2324 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:08,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:08,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 13:05:08,142 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 13:05:08,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 13:05:08,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=659, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 13:05:08,142 INFO L87 Difference]: Start difference. First operand 411 states and 412 transitions. Second operand 35 states. [2018-10-15 13:05:09,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:09,622 INFO L93 Difference]: Finished difference Result 436 states and 437 transitions. [2018-10-15 13:05:09,622 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 13:05:09,622 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 410 [2018-10-15 13:05:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:09,625 INFO L225 Difference]: With dead ends: 436 [2018-10-15 13:05:09,625 INFO L226 Difference]: Without dead ends: 436 [2018-10-15 13:05:09,626 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2696 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2887, Invalid=5855, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:05:09,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-15 13:05:09,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 427. [2018-10-15 13:05:09,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 427 states. [2018-10-15 13:05:09,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 427 states to 427 states and 428 transitions. [2018-10-15 13:05:09,631 INFO L78 Accepts]: Start accepts. Automaton has 427 states and 428 transitions. Word has length 410 [2018-10-15 13:05:09,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:09,631 INFO L481 AbstractCegarLoop]: Abstraction has 427 states and 428 transitions. [2018-10-15 13:05:09,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 13:05:09,632 INFO L276 IsEmpty]: Start isEmpty. Operand 427 states and 428 transitions. [2018-10-15 13:05:09,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 427 [2018-10-15 13:05:09,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:09,634 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 29, 29, 29, 29, 29, 29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:09,634 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:09,634 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:09,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1713150354, now seen corresponding path program 43 times [2018-10-15 13:05:09,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:11,606 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 3364 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:11,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:11,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 13:05:11,607 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 13:05:11,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 13:05:11,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=962, Invalid=2820, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 13:05:11,608 INFO L87 Difference]: Start difference. First operand 427 states and 428 transitions. Second operand 62 states. [2018-10-15 13:05:14,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:14,647 INFO L93 Difference]: Finished difference Result 663 states and 664 transitions. [2018-10-15 13:05:14,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 13:05:14,648 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 426 [2018-10-15 13:05:14,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:14,650 INFO L225 Difference]: With dead ends: 663 [2018-10-15 13:05:14,650 INFO L226 Difference]: Without dead ends: 436 [2018-10-15 13:05:14,652 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1709 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4500, Invalid=9780, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:05:14,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2018-10-15 13:05:14,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 433. [2018-10-15 13:05:14,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-15 13:05:14,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 434 transitions. [2018-10-15 13:05:14,656 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 434 transitions. Word has length 426 [2018-10-15 13:05:14,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:14,656 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 434 transitions. [2018-10-15 13:05:14,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 13:05:14,656 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 434 transitions. [2018-10-15 13:05:14,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-15 13:05:14,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:14,658 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:14,658 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:14,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:14,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1268600980, now seen corresponding path program 44 times [2018-10-15 13:05:14,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:14,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 5858 backedges. 3364 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:16,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:16,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:05:16,567 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:05:16,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:05:16,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=2913, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:05:16,568 INFO L87 Difference]: Start difference. First operand 433 states and 434 transitions. Second operand 63 states. [2018-10-15 13:05:19,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:19,660 INFO L93 Difference]: Finished difference Result 677 states and 678 transitions. [2018-10-15 13:05:19,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 13:05:19,660 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 432 [2018-10-15 13:05:19,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:19,662 INFO L225 Difference]: With dead ends: 677 [2018-10-15 13:05:19,663 INFO L226 Difference]: Without dead ends: 442 [2018-10-15 13:05:19,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1740 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4773, Invalid=10233, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:05:19,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2018-10-15 13:05:19,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 439. [2018-10-15 13:05:19,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 439 states. [2018-10-15 13:05:19,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 439 states to 439 states and 440 transitions. [2018-10-15 13:05:19,667 INFO L78 Accepts]: Start accepts. Automaton has 439 states and 440 transitions. Word has length 432 [2018-10-15 13:05:19,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:19,667 INFO L481 AbstractCegarLoop]: Abstraction has 439 states and 440 transitions. [2018-10-15 13:05:19,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:05:19,667 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 440 transitions. [2018-10-15 13:05:19,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2018-10-15 13:05:19,670 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:19,670 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:19,670 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:19,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:19,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1525450298, now seen corresponding path program 45 times [2018-10-15 13:05:19,671 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:20,478 INFO L134 CoverageAnalysis]: Checked inductivity of 6034 backedges. 2670 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:20,479 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:20,479 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 13:05:20,479 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 13:05:20,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 13:05:20,480 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=734, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 13:05:20,480 INFO L87 Difference]: Start difference. First operand 439 states and 440 transitions. Second operand 37 states. [2018-10-15 13:05:22,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:22,239 INFO L93 Difference]: Finished difference Result 464 states and 465 transitions. [2018-10-15 13:05:22,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 13:05:22,240 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 438 [2018-10-15 13:05:22,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:22,243 INFO L225 Difference]: With dead ends: 464 [2018-10-15 13:05:22,243 INFO L226 Difference]: Without dead ends: 464 [2018-10-15 13:05:22,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3068 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=3271, Invalid=6629, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 13:05:22,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-15 13:05:22,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 455. [2018-10-15 13:05:22,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2018-10-15 13:05:22,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 456 transitions. [2018-10-15 13:05:22,248 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 456 transitions. Word has length 438 [2018-10-15 13:05:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:22,249 INFO L481 AbstractCegarLoop]: Abstraction has 455 states and 456 transitions. [2018-10-15 13:05:22,249 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 13:05:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 456 transitions. [2018-10-15 13:05:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2018-10-15 13:05:22,251 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:22,251 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 31, 31, 31, 31, 31, 31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:22,252 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:22,252 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:22,252 INFO L82 PathProgramCache]: Analyzing trace with hash 1963139692, now seen corresponding path program 46 times [2018-10-15 13:05:22,253 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:22,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:23,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6514 backedges. 3844 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:23,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:23,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 13:05:23,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 13:05:23,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 13:05:23,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1090, Invalid=3200, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 13:05:23,996 INFO L87 Difference]: Start difference. First operand 455 states and 456 transitions. Second operand 66 states. [2018-10-15 13:05:27,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:27,606 INFO L93 Difference]: Finished difference Result 707 states and 708 transitions. [2018-10-15 13:05:27,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 13:05:27,607 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 454 [2018-10-15 13:05:27,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:27,609 INFO L225 Difference]: With dead ends: 707 [2018-10-15 13:05:27,610 INFO L226 Difference]: Without dead ends: 464 [2018-10-15 13:05:27,611 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1951 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5120, Invalid=11136, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:05:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2018-10-15 13:05:27,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 461. [2018-10-15 13:05:27,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-10-15 13:05:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 462 transitions. [2018-10-15 13:05:27,615 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 462 transitions. Word has length 454 [2018-10-15 13:05:27,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:27,615 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 462 transitions. [2018-10-15 13:05:27,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 13:05:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 462 transitions. [2018-10-15 13:05:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-15 13:05:27,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:27,618 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:27,618 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:27,618 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash -269092974, now seen corresponding path program 47 times [2018-10-15 13:05:27,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:27,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:29,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6696 backedges. 3844 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:29,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:29,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:05:29,249 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:05:29,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:05:29,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1123, Invalid=3299, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:05:29,250 INFO L87 Difference]: Start difference. First operand 461 states and 462 transitions. Second operand 67 states. [2018-10-15 13:05:32,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:32,914 INFO L93 Difference]: Finished difference Result 721 states and 722 transitions. [2018-10-15 13:05:32,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 13:05:32,914 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 460 [2018-10-15 13:05:32,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:32,916 INFO L225 Difference]: With dead ends: 721 [2018-10-15 13:05:32,917 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 13:05:32,918 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1984 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5411, Invalid=11619, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:05:32,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 13:05:32,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 467. [2018-10-15 13:05:32,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 467 states. [2018-10-15 13:05:32,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 468 transitions. [2018-10-15 13:05:32,921 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 468 transitions. Word has length 460 [2018-10-15 13:05:32,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:32,921 INFO L481 AbstractCegarLoop]: Abstraction has 467 states and 468 transitions. [2018-10-15 13:05:32,921 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:05:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 468 transitions. [2018-10-15 13:05:32,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 467 [2018-10-15 13:05:32,924 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:32,924 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:32,924 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:32,925 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:32,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1457641528, now seen corresponding path program 48 times [2018-10-15 13:05:32,925 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:32,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:33,764 INFO L134 CoverageAnalysis]: Checked inductivity of 6884 backedges. 3040 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:33,765 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:33,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 13:05:33,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 13:05:33,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 13:05:33,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=813, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 13:05:33,766 INFO L87 Difference]: Start difference. First operand 467 states and 468 transitions. Second operand 39 states. [2018-10-15 13:05:35,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:35,501 INFO L93 Difference]: Finished difference Result 492 states and 493 transitions. [2018-10-15 13:05:35,502 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 13:05:35,502 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 466 [2018-10-15 13:05:35,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:35,505 INFO L225 Difference]: With dead ends: 492 [2018-10-15 13:05:35,505 INFO L226 Difference]: Without dead ends: 492 [2018-10-15 13:05:35,506 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3464 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3679, Invalid=7451, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 13:05:35,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-10-15 13:05:35,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 483. [2018-10-15 13:05:35,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 13:05:35,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 484 transitions. [2018-10-15 13:05:35,511 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 484 transitions. Word has length 466 [2018-10-15 13:05:35,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:35,512 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 484 transitions. [2018-10-15 13:05:35,512 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 13:05:35,512 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 484 transitions. [2018-10-15 13:05:35,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 13:05:35,514 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:35,515 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 33, 33, 33, 33, 33, 33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:35,515 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:35,515 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:35,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1363101590, now seen corresponding path program 49 times [2018-10-15 13:05:35,516 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:35,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:37,675 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 4356 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:37,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:37,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 13:05:37,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 13:05:37,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 13:05:37,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1226, Invalid=3604, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 13:05:37,677 INFO L87 Difference]: Start difference. First operand 483 states and 484 transitions. Second operand 70 states. [2018-10-15 13:05:41,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:41,601 INFO L93 Difference]: Finished difference Result 751 states and 752 transitions. [2018-10-15 13:05:41,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 13:05:41,601 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 482 [2018-10-15 13:05:41,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:41,604 INFO L225 Difference]: With dead ends: 751 [2018-10-15 13:05:41,604 INFO L226 Difference]: Without dead ends: 492 [2018-10-15 13:05:41,605 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5780, Invalid=12580, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 13:05:41,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2018-10-15 13:05:41,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 489. [2018-10-15 13:05:41,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 489 states. [2018-10-15 13:05:41,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 490 transitions. [2018-10-15 13:05:41,608 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 490 transitions. Word has length 482 [2018-10-15 13:05:41,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:41,609 INFO L481 AbstractCegarLoop]: Abstraction has 489 states and 490 transitions. [2018-10-15 13:05:41,609 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 13:05:41,609 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 490 transitions. [2018-10-15 13:05:41,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2018-10-15 13:05:41,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:41,612 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:41,612 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:41,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:41,612 INFO L82 PathProgramCache]: Analyzing trace with hash -978454384, now seen corresponding path program 50 times [2018-10-15 13:05:41,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:41,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:43,457 INFO L134 CoverageAnalysis]: Checked inductivity of 7590 backedges. 4356 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:43,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:43,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 13:05:43,458 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 13:05:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 13:05:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1261, Invalid=3709, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 13:05:43,459 INFO L87 Difference]: Start difference. First operand 489 states and 490 transitions. Second operand 71 states. [2018-10-15 13:05:48,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:48,166 INFO L93 Difference]: Finished difference Result 765 states and 766 transitions. [2018-10-15 13:05:48,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 13:05:48,166 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 488 [2018-10-15 13:05:48,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:48,169 INFO L225 Difference]: With dead ends: 765 [2018-10-15 13:05:48,169 INFO L226 Difference]: Without dead ends: 498 [2018-10-15 13:05:48,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2244 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6089, Invalid=13093, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:05:48,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 498 states. [2018-10-15 13:05:48,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 498 to 495. [2018-10-15 13:05:48,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 495 states. [2018-10-15 13:05:48,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 495 states to 495 states and 496 transitions. [2018-10-15 13:05:48,174 INFO L78 Accepts]: Start accepts. Automaton has 495 states and 496 transitions. Word has length 488 [2018-10-15 13:05:48,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:48,174 INFO L481 AbstractCegarLoop]: Abstraction has 495 states and 496 transitions. [2018-10-15 13:05:48,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 13:05:48,174 INFO L276 IsEmpty]: Start isEmpty. Operand 495 states and 496 transitions. [2018-10-15 13:05:48,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2018-10-15 13:05:48,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:48,176 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:48,176 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:48,176 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:48,177 INFO L82 PathProgramCache]: Analyzing trace with hash -1613233098, now seen corresponding path program 51 times [2018-10-15 13:05:48,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:49,158 INFO L134 CoverageAnalysis]: Checked inductivity of 7790 backedges. 3434 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:49,159 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:49,159 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 13:05:49,159 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 13:05:49,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 13:05:49,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=896, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 13:05:49,160 INFO L87 Difference]: Start difference. First operand 495 states and 496 transitions. Second operand 41 states. [2018-10-15 13:05:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:51,061 INFO L93 Difference]: Finished difference Result 520 states and 521 transitions. [2018-10-15 13:05:51,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 13:05:51,061 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 494 [2018-10-15 13:05:51,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:51,064 INFO L225 Difference]: With dead ends: 520 [2018-10-15 13:05:51,064 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 13:05:51,065 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3884 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=4111, Invalid=8321, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 13:05:51,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 13:05:51,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 511. [2018-10-15 13:05:51,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 511 states. [2018-10-15 13:05:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 511 states to 511 states and 512 transitions. [2018-10-15 13:05:51,068 INFO L78 Accepts]: Start accepts. Automaton has 511 states and 512 transitions. Word has length 494 [2018-10-15 13:05:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:51,069 INFO L481 AbstractCegarLoop]: Abstraction has 511 states and 512 transitions. [2018-10-15 13:05:51,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 13:05:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 511 states and 512 transitions. [2018-10-15 13:05:51,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 511 [2018-10-15 13:05:51,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:51,071 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 35, 35, 35, 35, 35, 35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:51,071 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:51,071 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:51,072 INFO L82 PathProgramCache]: Analyzing trace with hash -594859928, now seen corresponding path program 52 times [2018-10-15 13:05:51,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:51,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:53,167 INFO L134 CoverageAnalysis]: Checked inductivity of 8334 backedges. 4900 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:53,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:53,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 13:05:53,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 13:05:53,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 13:05:53,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1370, Invalid=4032, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 13:05:53,169 INFO L87 Difference]: Start difference. First operand 511 states and 512 transitions. Second operand 74 states. [2018-10-15 13:05:57,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:05:57,456 INFO L93 Difference]: Finished difference Result 795 states and 796 transitions. [2018-10-15 13:05:57,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 13:05:57,457 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 510 [2018-10-15 13:05:57,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:05:57,459 INFO L225 Difference]: With dead ends: 795 [2018-10-15 13:05:57,460 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 13:05:57,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2483 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6480, Invalid=14112, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 13:05:57,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 13:05:57,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 517. [2018-10-15 13:05:57,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 517 states. [2018-10-15 13:05:57,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 517 states to 517 states and 518 transitions. [2018-10-15 13:05:57,464 INFO L78 Accepts]: Start accepts. Automaton has 517 states and 518 transitions. Word has length 510 [2018-10-15 13:05:57,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:05:57,465 INFO L481 AbstractCegarLoop]: Abstraction has 517 states and 518 transitions. [2018-10-15 13:05:57,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 13:05:57,465 INFO L276 IsEmpty]: Start isEmpty. Operand 517 states and 518 transitions. [2018-10-15 13:05:57,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 517 [2018-10-15 13:05:57,467 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:05:57,467 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:05:57,467 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:05:57,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:05:57,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1728818290, now seen corresponding path program 53 times [2018-10-15 13:05:57,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:05:57,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:05:59,425 INFO L134 CoverageAnalysis]: Checked inductivity of 8540 backedges. 4900 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:05:59,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:05:59,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 13:05:59,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 13:05:59,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 13:05:59,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1407, Invalid=4143, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 13:05:59,426 INFO L87 Difference]: Start difference. First operand 517 states and 518 transitions. Second operand 75 states. [2018-10-15 13:06:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:03,912 INFO L93 Difference]: Finished difference Result 809 states and 810 transitions. [2018-10-15 13:06:03,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 13:06:03,912 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 516 [2018-10-15 13:06:03,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:03,914 INFO L225 Difference]: With dead ends: 809 [2018-10-15 13:06:03,914 INFO L226 Difference]: Without dead ends: 526 [2018-10-15 13:06:03,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2520 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6807, Invalid=14655, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:06:03,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2018-10-15 13:06:03,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 523. [2018-10-15 13:06:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 13:06:03,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 524 transitions. [2018-10-15 13:06:03,919 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 524 transitions. Word has length 516 [2018-10-15 13:06:03,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:03,919 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 524 transitions. [2018-10-15 13:06:03,919 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 13:06:03,919 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 524 transitions. [2018-10-15 13:06:03,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 13:06:03,921 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:03,921 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:03,921 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:03,921 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:03,922 INFO L82 PathProgramCache]: Analyzing trace with hash 683543092, now seen corresponding path program 54 times [2018-10-15 13:06:03,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:04,977 INFO L134 CoverageAnalysis]: Checked inductivity of 8752 backedges. 3852 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:04,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:04,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 13:06:04,978 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 13:06:04,978 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 13:06:04,979 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=983, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 13:06:04,979 INFO L87 Difference]: Start difference. First operand 523 states and 524 transitions. Second operand 43 states. [2018-10-15 13:06:07,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:07,338 INFO L93 Difference]: Finished difference Result 548 states and 549 transitions. [2018-10-15 13:06:07,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 13:06:07,339 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 522 [2018-10-15 13:06:07,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:07,341 INFO L225 Difference]: With dead ends: 548 [2018-10-15 13:06:07,342 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 13:06:07,343 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4328 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=4567, Invalid=9239, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 13:06:07,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 13:06:07,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 539. [2018-10-15 13:06:07,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 539 states. [2018-10-15 13:06:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 540 transitions. [2018-10-15 13:06:07,347 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 540 transitions. Word has length 522 [2018-10-15 13:06:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:07,347 INFO L481 AbstractCegarLoop]: Abstraction has 539 states and 540 transitions. [2018-10-15 13:06:07,347 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 13:06:07,347 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 540 transitions. [2018-10-15 13:06:07,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2018-10-15 13:06:07,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:07,350 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 37, 37, 37, 37, 37, 37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:07,350 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:07,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:07,350 INFO L82 PathProgramCache]: Analyzing trace with hash 860975718, now seen corresponding path program 55 times [2018-10-15 13:06:07,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:09,448 INFO L134 CoverageAnalysis]: Checked inductivity of 9328 backedges. 5476 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:09,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:09,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 13:06:09,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 13:06:09,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 13:06:09,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1522, Invalid=4484, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 13:06:09,449 INFO L87 Difference]: Start difference. First operand 539 states and 540 transitions. Second operand 78 states. [2018-10-15 13:06:14,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:14,327 INFO L93 Difference]: Finished difference Result 839 states and 840 transitions. [2018-10-15 13:06:14,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 13:06:14,327 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 538 [2018-10-15 13:06:14,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:14,330 INFO L225 Difference]: With dead ends: 839 [2018-10-15 13:06:14,330 INFO L226 Difference]: Without dead ends: 548 [2018-10-15 13:06:14,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2773 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=7220, Invalid=15732, Unknown=0, NotChecked=0, Total=22952 [2018-10-15 13:06:14,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2018-10-15 13:06:14,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 545. [2018-10-15 13:06:14,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 545 states. [2018-10-15 13:06:14,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 546 transitions. [2018-10-15 13:06:14,335 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 546 transitions. Word has length 538 [2018-10-15 13:06:14,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:14,335 INFO L481 AbstractCegarLoop]: Abstraction has 545 states and 546 transitions. [2018-10-15 13:06:14,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 13:06:14,335 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 546 transitions. [2018-10-15 13:06:14,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 545 [2018-10-15 13:06:14,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:14,337 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:14,337 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:14,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:14,338 INFO L82 PathProgramCache]: Analyzing trace with hash 897058956, now seen corresponding path program 56 times [2018-10-15 13:06:14,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:14,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:16,520 INFO L134 CoverageAnalysis]: Checked inductivity of 9546 backedges. 5476 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:16,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:16,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 13:06:16,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 13:06:16,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 13:06:16,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1561, Invalid=4601, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 13:06:16,521 INFO L87 Difference]: Start difference. First operand 545 states and 546 transitions. Second operand 79 states. [2018-10-15 13:06:21,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:21,072 INFO L93 Difference]: Finished difference Result 853 states and 854 transitions. [2018-10-15 13:06:21,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 13:06:21,073 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 544 [2018-10-15 13:06:21,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:21,075 INFO L225 Difference]: With dead ends: 853 [2018-10-15 13:06:21,075 INFO L226 Difference]: Without dead ends: 554 [2018-10-15 13:06:21,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2812 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7565, Invalid=16305, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 13:06:21,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 554 states. [2018-10-15 13:06:21,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 554 to 551. [2018-10-15 13:06:21,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-15 13:06:21,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 552 transitions. [2018-10-15 13:06:21,081 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 552 transitions. Word has length 544 [2018-10-15 13:06:21,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:21,081 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 552 transitions. [2018-10-15 13:06:21,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 13:06:21,081 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 552 transitions. [2018-10-15 13:06:21,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-15 13:06:21,083 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:21,084 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:21,084 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:21,084 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:21,084 INFO L82 PathProgramCache]: Analyzing trace with hash 1141041714, now seen corresponding path program 57 times [2018-10-15 13:06:21,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:21,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:22,405 INFO L134 CoverageAnalysis]: Checked inductivity of 9770 backedges. 4294 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:22,405 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:22,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 13:06:22,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 13:06:22,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 13:06:22,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=1074, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 13:06:22,406 INFO L87 Difference]: Start difference. First operand 551 states and 552 transitions. Second operand 45 states. [2018-10-15 13:06:24,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:24,640 INFO L93 Difference]: Finished difference Result 576 states and 577 transitions. [2018-10-15 13:06:24,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 13:06:24,640 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 550 [2018-10-15 13:06:24,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:24,643 INFO L225 Difference]: With dead ends: 576 [2018-10-15 13:06:24,643 INFO L226 Difference]: Without dead ends: 576 [2018-10-15 13:06:24,644 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4796 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=5047, Invalid=10205, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:06:24,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-15 13:06:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 567. [2018-10-15 13:06:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 567 states. [2018-10-15 13:06:24,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 567 states to 567 states and 568 transitions. [2018-10-15 13:06:24,648 INFO L78 Accepts]: Start accepts. Automaton has 567 states and 568 transitions. Word has length 550 [2018-10-15 13:06:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:24,649 INFO L481 AbstractCegarLoop]: Abstraction has 567 states and 568 transitions. [2018-10-15 13:06:24,649 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 13:06:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 567 states and 568 transitions. [2018-10-15 13:06:24,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 567 [2018-10-15 13:06:24,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:24,652 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 39, 39, 39, 39, 39, 39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:24,652 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:24,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:24,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1199740516, now seen corresponding path program 58 times [2018-10-15 13:06:24,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:24,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:27,131 INFO L134 CoverageAnalysis]: Checked inductivity of 10378 backedges. 6084 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:27,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:27,131 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 13:06:27,132 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 13:06:27,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 13:06:27,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1682, Invalid=4960, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 13:06:27,132 INFO L87 Difference]: Start difference. First operand 567 states and 568 transitions. Second operand 82 states. [2018-10-15 13:06:32,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:32,321 INFO L93 Difference]: Finished difference Result 883 states and 884 transitions. [2018-10-15 13:06:32,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 13:06:32,322 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 566 [2018-10-15 13:06:32,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:32,325 INFO L225 Difference]: With dead ends: 883 [2018-10-15 13:06:32,325 INFO L226 Difference]: Without dead ends: 576 [2018-10-15 13:06:32,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3079 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=8000, Invalid=17440, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 13:06:32,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-15 13:06:32,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 573. [2018-10-15 13:06:32,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 13:06:32,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 574 transitions. [2018-10-15 13:06:32,330 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 574 transitions. Word has length 566 [2018-10-15 13:06:32,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:32,330 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 574 transitions. [2018-10-15 13:06:32,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 13:06:32,330 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 574 transitions. [2018-10-15 13:06:32,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 13:06:32,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:32,333 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:32,333 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:32,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:32,334 INFO L82 PathProgramCache]: Analyzing trace with hash 644355978, now seen corresponding path program 59 times [2018-10-15 13:06:32,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:32,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:34,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10608 backedges. 6084 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:34,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:34,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 13:06:34,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 13:06:34,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 13:06:34,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1723, Invalid=5083, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 13:06:34,760 INFO L87 Difference]: Start difference. First operand 573 states and 574 transitions. Second operand 83 states. [2018-10-15 13:06:40,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:40,296 INFO L93 Difference]: Finished difference Result 897 states and 898 transitions. [2018-10-15 13:06:40,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:06:40,296 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 572 [2018-10-15 13:06:40,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:40,299 INFO L225 Difference]: With dead ends: 897 [2018-10-15 13:06:40,299 INFO L226 Difference]: Without dead ends: 582 [2018-10-15 13:06:40,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3120 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8363, Invalid=18043, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 13:06:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2018-10-15 13:06:40,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 579. [2018-10-15 13:06:40,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2018-10-15 13:06:40,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 580 transitions. [2018-10-15 13:06:40,304 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 580 transitions. Word has length 572 [2018-10-15 13:06:40,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:40,304 INFO L481 AbstractCegarLoop]: Abstraction has 579 states and 580 transitions. [2018-10-15 13:06:40,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 13:06:40,305 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 580 transitions. [2018-10-15 13:06:40,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 579 [2018-10-15 13:06:40,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:40,307 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:40,307 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:40,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:40,308 INFO L82 PathProgramCache]: Analyzing trace with hash 1670751280, now seen corresponding path program 60 times [2018-10-15 13:06:40,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:40,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:41,472 INFO L134 CoverageAnalysis]: Checked inductivity of 10844 backedges. 4760 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:41,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:41,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 13:06:41,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 13:06:41,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 13:06:41,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1169, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 13:06:41,473 INFO L87 Difference]: Start difference. First operand 579 states and 580 transitions. Second operand 47 states. [2018-10-15 13:06:44,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:44,164 INFO L93 Difference]: Finished difference Result 604 states and 605 transitions. [2018-10-15 13:06:44,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 13:06:44,164 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 578 [2018-10-15 13:06:44,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:44,168 INFO L225 Difference]: With dead ends: 604 [2018-10-15 13:06:44,168 INFO L226 Difference]: Without dead ends: 604 [2018-10-15 13:06:44,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 170 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5288 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=5551, Invalid=11219, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:06:44,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-15 13:06:44,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 595. [2018-10-15 13:06:44,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2018-10-15 13:06:44,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 596 transitions. [2018-10-15 13:06:44,173 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 596 transitions. Word has length 578 [2018-10-15 13:06:44,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:44,173 INFO L481 AbstractCegarLoop]: Abstraction has 595 states and 596 transitions. [2018-10-15 13:06:44,173 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 13:06:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 596 transitions. [2018-10-15 13:06:44,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2018-10-15 13:06:44,176 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:44,176 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 41, 41, 41, 41, 41, 41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:44,176 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:44,177 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:44,177 INFO L82 PathProgramCache]: Analyzing trace with hash -854748062, now seen corresponding path program 61 times [2018-10-15 13:06:44,177 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:44,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:46,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11484 backedges. 6724 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:46,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:46,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 13:06:46,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 13:06:46,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 13:06:46,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1850, Invalid=5460, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 13:06:46,700 INFO L87 Difference]: Start difference. First operand 595 states and 596 transitions. Second operand 86 states. [2018-10-15 13:06:51,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:06:51,704 INFO L93 Difference]: Finished difference Result 927 states and 928 transitions. [2018-10-15 13:06:51,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 13:06:51,704 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 594 [2018-10-15 13:06:51,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:06:51,707 INFO L225 Difference]: With dead ends: 927 [2018-10-15 13:06:51,707 INFO L226 Difference]: Without dead ends: 604 [2018-10-15 13:06:51,709 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 166 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3401 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8820, Invalid=19236, Unknown=0, NotChecked=0, Total=28056 [2018-10-15 13:06:51,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2018-10-15 13:06:51,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 601. [2018-10-15 13:06:51,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2018-10-15 13:06:51,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 602 transitions. [2018-10-15 13:06:51,713 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 602 transitions. Word has length 594 [2018-10-15 13:06:51,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:06:51,713 INFO L481 AbstractCegarLoop]: Abstraction has 601 states and 602 transitions. [2018-10-15 13:06:51,713 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 13:06:51,713 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 602 transitions. [2018-10-15 13:06:51,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2018-10-15 13:06:51,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:06:51,716 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:06:51,716 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:06:51,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:06:51,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1987281032, now seen corresponding path program 62 times [2018-10-15 13:06:51,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:06:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:06:54,800 INFO L134 CoverageAnalysis]: Checked inductivity of 11726 backedges. 6724 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:06:54,800 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:06:54,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 13:06:54,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 13:06:54,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 13:06:54,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1893, Invalid=5589, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 13:06:54,802 INFO L87 Difference]: Start difference. First operand 601 states and 602 transitions. Second operand 87 states. [2018-10-15 13:07:00,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:00,530 INFO L93 Difference]: Finished difference Result 941 states and 942 transitions. [2018-10-15 13:07:00,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 13:07:00,530 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 600 [2018-10-15 13:07:00,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:00,533 INFO L225 Difference]: With dead ends: 941 [2018-10-15 13:07:00,533 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 13:07:00,534 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3444 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9201, Invalid=19869, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 13:07:00,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 13:07:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 607. [2018-10-15 13:07:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 607 states. [2018-10-15 13:07:00,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 607 states and 608 transitions. [2018-10-15 13:07:00,538 INFO L78 Accepts]: Start accepts. Automaton has 607 states and 608 transitions. Word has length 600 [2018-10-15 13:07:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:00,539 INFO L481 AbstractCegarLoop]: Abstraction has 607 states and 608 transitions. [2018-10-15 13:07:00,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 13:07:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 607 states and 608 transitions. [2018-10-15 13:07:00,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 607 [2018-10-15 13:07:00,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:00,542 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:00,542 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:00,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:00,543 INFO L82 PathProgramCache]: Analyzing trace with hash -656066514, now seen corresponding path program 63 times [2018-10-15 13:07:00,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:00,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:01,764 INFO L134 CoverageAnalysis]: Checked inductivity of 11974 backedges. 5250 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:01,764 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:01,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 13:07:01,765 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 13:07:01,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 13:07:01,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1268, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 13:07:01,765 INFO L87 Difference]: Start difference. First operand 607 states and 608 transitions. Second operand 49 states. [2018-10-15 13:07:04,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:04,676 INFO L93 Difference]: Finished difference Result 632 states and 633 transitions. [2018-10-15 13:07:04,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 13:07:04,676 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 606 [2018-10-15 13:07:04,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:04,679 INFO L225 Difference]: With dead ends: 632 [2018-10-15 13:07:04,679 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 13:07:04,680 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5804 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=6079, Invalid=12281, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 13:07:04,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 13:07:04,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 623. [2018-10-15 13:07:04,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 13:07:04,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 624 transitions. [2018-10-15 13:07:04,685 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 624 transitions. Word has length 606 [2018-10-15 13:07:04,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:04,686 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 624 transitions. [2018-10-15 13:07:04,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 13:07:04,686 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 624 transitions. [2018-10-15 13:07:04,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 13:07:04,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:04,690 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 43, 43, 43, 43, 43, 43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:04,690 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:04,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:04,691 INFO L82 PathProgramCache]: Analyzing trace with hash 1466002528, now seen corresponding path program 64 times [2018-10-15 13:07:04,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:07,474 INFO L134 CoverageAnalysis]: Checked inductivity of 12646 backedges. 7396 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:07,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:07,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 13:07:07,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 13:07:07,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 13:07:07,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2026, Invalid=5984, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 13:07:07,475 INFO L87 Difference]: Start difference. First operand 623 states and 624 transitions. Second operand 90 states. [2018-10-15 13:07:14,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:14,150 INFO L93 Difference]: Finished difference Result 971 states and 972 transitions. [2018-10-15 13:07:14,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 13:07:14,150 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 622 [2018-10-15 13:07:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:14,153 INFO L225 Difference]: With dead ends: 971 [2018-10-15 13:07:14,154 INFO L226 Difference]: Without dead ends: 632 [2018-10-15 13:07:14,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 174 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3739 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9680, Invalid=21120, Unknown=0, NotChecked=0, Total=30800 [2018-10-15 13:07:14,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 632 states. [2018-10-15 13:07:14,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 632 to 629. [2018-10-15 13:07:14,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 629 states. [2018-10-15 13:07:14,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 629 states to 629 states and 630 transitions. [2018-10-15 13:07:14,159 INFO L78 Accepts]: Start accepts. Automaton has 629 states and 630 transitions. Word has length 622 [2018-10-15 13:07:14,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:14,160 INFO L481 AbstractCegarLoop]: Abstraction has 629 states and 630 transitions. [2018-10-15 13:07:14,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 13:07:14,160 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 630 transitions. [2018-10-15 13:07:14,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 629 [2018-10-15 13:07:14,163 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:14,164 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:14,164 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:14,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:14,164 INFO L82 PathProgramCache]: Analyzing trace with hash 1875460998, now seen corresponding path program 65 times [2018-10-15 13:07:14,165 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:17,021 INFO L134 CoverageAnalysis]: Checked inductivity of 12900 backedges. 7396 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:17,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:17,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 13:07:17,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 13:07:17,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 13:07:17,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2071, Invalid=6119, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 13:07:17,023 INFO L87 Difference]: Start difference. First operand 629 states and 630 transitions. Second operand 91 states. [2018-10-15 13:07:22,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:22,712 INFO L93 Difference]: Finished difference Result 985 states and 986 transitions. [2018-10-15 13:07:22,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 13:07:22,712 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 628 [2018-10-15 13:07:22,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:22,714 INFO L225 Difference]: With dead ends: 985 [2018-10-15 13:07:22,715 INFO L226 Difference]: Without dead ends: 638 [2018-10-15 13:07:22,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3784 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10079, Invalid=21783, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 13:07:22,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2018-10-15 13:07:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2018-10-15 13:07:22,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2018-10-15 13:07:22,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 636 transitions. [2018-10-15 13:07:22,720 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 636 transitions. Word has length 628 [2018-10-15 13:07:22,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:22,721 INFO L481 AbstractCegarLoop]: Abstraction has 635 states and 636 transitions. [2018-10-15 13:07:22,721 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 13:07:22,721 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 636 transitions. [2018-10-15 13:07:22,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 635 [2018-10-15 13:07:22,723 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:22,724 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:22,724 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:22,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:22,724 INFO L82 PathProgramCache]: Analyzing trace with hash -1797216724, now seen corresponding path program 66 times [2018-10-15 13:07:22,725 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:24,315 INFO L134 CoverageAnalysis]: Checked inductivity of 13160 backedges. 5764 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:24,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:24,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 13:07:24,316 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 13:07:24,316 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 13:07:24,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1371, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 13:07:24,317 INFO L87 Difference]: Start difference. First operand 635 states and 636 transitions. Second operand 51 states. [2018-10-15 13:07:27,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:27,128 INFO L93 Difference]: Finished difference Result 660 states and 661 transitions. [2018-10-15 13:07:27,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 13:07:27,129 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 634 [2018-10-15 13:07:27,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:27,132 INFO L225 Difference]: With dead ends: 660 [2018-10-15 13:07:27,132 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 13:07:27,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 186 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6344 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=6631, Invalid=13391, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 13:07:27,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 13:07:27,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 651. [2018-10-15 13:07:27,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 651 states. [2018-10-15 13:07:27,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 652 transitions. [2018-10-15 13:07:27,137 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 652 transitions. Word has length 634 [2018-10-15 13:07:27,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:27,137 INFO L481 AbstractCegarLoop]: Abstraction has 651 states and 652 transitions. [2018-10-15 13:07:27,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 13:07:27,138 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 652 transitions. [2018-10-15 13:07:27,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 651 [2018-10-15 13:07:27,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:27,141 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 45, 45, 45, 45, 45, 45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:27,141 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:27,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:27,141 INFO L82 PathProgramCache]: Analyzing trace with hash 426581598, now seen corresponding path program 67 times [2018-10-15 13:07:27,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:30,509 INFO L134 CoverageAnalysis]: Checked inductivity of 13864 backedges. 8100 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:30,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:30,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-15 13:07:30,510 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-15 13:07:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-15 13:07:30,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2210, Invalid=6532, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 13:07:30,510 INFO L87 Difference]: Start difference. First operand 651 states and 652 transitions. Second operand 94 states. [2018-10-15 13:07:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:36,901 INFO L93 Difference]: Finished difference Result 1015 states and 1016 transitions. [2018-10-15 13:07:36,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 13:07:36,901 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 650 [2018-10-15 13:07:36,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:36,903 INFO L225 Difference]: With dead ends: 1015 [2018-10-15 13:07:36,904 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 13:07:36,905 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4093 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=10580, Invalid=23092, Unknown=0, NotChecked=0, Total=33672 [2018-10-15 13:07:36,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 13:07:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 657. [2018-10-15 13:07:36,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 657 states. [2018-10-15 13:07:36,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 657 states to 657 states and 658 transitions. [2018-10-15 13:07:36,909 INFO L78 Accepts]: Start accepts. Automaton has 657 states and 658 transitions. Word has length 650 [2018-10-15 13:07:36,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:36,909 INFO L481 AbstractCegarLoop]: Abstraction has 657 states and 658 transitions. [2018-10-15 13:07:36,909 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-15 13:07:36,909 INFO L276 IsEmpty]: Start isEmpty. Operand 657 states and 658 transitions. [2018-10-15 13:07:36,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 657 [2018-10-15 13:07:36,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:36,912 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:36,913 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:36,913 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:36,913 INFO L82 PathProgramCache]: Analyzing trace with hash 1545101444, now seen corresponding path program 68 times [2018-10-15 13:07:36,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:36,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:40,339 INFO L134 CoverageAnalysis]: Checked inductivity of 14130 backedges. 8100 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:40,339 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:40,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 13:07:40,340 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 13:07:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 13:07:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2257, Invalid=6673, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 13:07:40,340 INFO L87 Difference]: Start difference. First operand 657 states and 658 transitions. Second operand 95 states. [2018-10-15 13:07:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:46,676 INFO L93 Difference]: Finished difference Result 1029 states and 1030 transitions. [2018-10-15 13:07:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 13:07:46,676 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 656 [2018-10-15 13:07:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:46,680 INFO L225 Difference]: With dead ends: 1029 [2018-10-15 13:07:46,680 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 13:07:46,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4140 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10997, Invalid=23785, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 13:07:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 13:07:46,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 663. [2018-10-15 13:07:46,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-15 13:07:46,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 664 transitions. [2018-10-15 13:07:46,686 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 664 transitions. Word has length 656 [2018-10-15 13:07:46,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:46,686 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 664 transitions. [2018-10-15 13:07:46,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 13:07:46,686 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 664 transitions. [2018-10-15 13:07:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-10-15 13:07:46,689 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:46,690 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:46,690 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:46,690 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:46,690 INFO L82 PathProgramCache]: Analyzing trace with hash -403247574, now seen corresponding path program 69 times [2018-10-15 13:07:46,691 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:48,144 INFO L134 CoverageAnalysis]: Checked inductivity of 14402 backedges. 6302 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:48,145 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:48,145 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 13:07:48,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 13:07:48,146 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 13:07:48,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1478, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 13:07:48,146 INFO L87 Difference]: Start difference. First operand 663 states and 664 transitions. Second operand 53 states. [2018-10-15 13:07:51,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:07:51,409 INFO L93 Difference]: Finished difference Result 688 states and 689 transitions. [2018-10-15 13:07:51,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 13:07:51,409 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 662 [2018-10-15 13:07:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:07:51,413 INFO L225 Difference]: With dead ends: 688 [2018-10-15 13:07:51,413 INFO L226 Difference]: Without dead ends: 688 [2018-10-15 13:07:51,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6908 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=7207, Invalid=14549, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 13:07:51,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-15 13:07:51,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 679. [2018-10-15 13:07:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 679 states. [2018-10-15 13:07:51,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 680 transitions. [2018-10-15 13:07:51,419 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 680 transitions. Word has length 662 [2018-10-15 13:07:51,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:07:51,420 INFO L481 AbstractCegarLoop]: Abstraction has 679 states and 680 transitions. [2018-10-15 13:07:51,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 13:07:51,420 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 680 transitions. [2018-10-15 13:07:51,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 679 [2018-10-15 13:07:51,424 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:07:51,424 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 47, 47, 47, 47, 47, 47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:07:51,424 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:07:51,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:07:51,425 INFO L82 PathProgramCache]: Analyzing trace with hash -1516262820, now seen corresponding path program 70 times [2018-10-15 13:07:51,425 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:07:51,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:07:54,911 INFO L134 CoverageAnalysis]: Checked inductivity of 15138 backedges. 8836 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:07:54,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:07:54,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 13:07:54,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 13:07:54,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 13:07:54,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2402, Invalid=7104, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 13:07:54,912 INFO L87 Difference]: Start difference. First operand 679 states and 680 transitions. Second operand 98 states. [2018-10-15 13:08:00,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:00,734 INFO L93 Difference]: Finished difference Result 1059 states and 1060 transitions. [2018-10-15 13:08:00,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:08:00,735 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 678 [2018-10-15 13:08:00,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:00,738 INFO L225 Difference]: With dead ends: 1059 [2018-10-15 13:08:00,738 INFO L226 Difference]: Without dead ends: 688 [2018-10-15 13:08:00,740 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 190 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4463 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=11520, Invalid=25152, Unknown=0, NotChecked=0, Total=36672 [2018-10-15 13:08:00,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 688 states. [2018-10-15 13:08:00,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 688 to 685. [2018-10-15 13:08:00,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 685 states. [2018-10-15 13:08:00,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 685 states to 685 states and 686 transitions. [2018-10-15 13:08:00,745 INFO L78 Accepts]: Start accepts. Automaton has 685 states and 686 transitions. Word has length 678 [2018-10-15 13:08:00,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:00,745 INFO L481 AbstractCegarLoop]: Abstraction has 685 states and 686 transitions. [2018-10-15 13:08:00,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 13:08:00,745 INFO L276 IsEmpty]: Start isEmpty. Operand 685 states and 686 transitions. [2018-10-15 13:08:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2018-10-15 13:08:00,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:00,749 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:00,749 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:00,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:00,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1150277506, now seen corresponding path program 71 times [2018-10-15 13:08:00,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:04,181 INFO L134 CoverageAnalysis]: Checked inductivity of 15416 backedges. 8836 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:04,181 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:04,181 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 13:08:04,182 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 13:08:04,182 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 13:08:04,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2451, Invalid=7251, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 13:08:04,183 INFO L87 Difference]: Start difference. First operand 685 states and 686 transitions. Second operand 99 states. [2018-10-15 13:08:11,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:11,124 INFO L93 Difference]: Finished difference Result 1073 states and 1074 transitions. [2018-10-15 13:08:11,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 13:08:11,124 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 684 [2018-10-15 13:08:11,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:11,127 INFO L225 Difference]: With dead ends: 1073 [2018-10-15 13:08:11,127 INFO L226 Difference]: Without dead ends: 694 [2018-10-15 13:08:11,128 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4512 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=11955, Invalid=25875, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 13:08:11,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2018-10-15 13:08:11,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 691. [2018-10-15 13:08:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 691 states. [2018-10-15 13:08:11,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 691 states and 692 transitions. [2018-10-15 13:08:11,133 INFO L78 Accepts]: Start accepts. Automaton has 691 states and 692 transitions. Word has length 684 [2018-10-15 13:08:11,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:11,133 INFO L481 AbstractCegarLoop]: Abstraction has 691 states and 692 transitions. [2018-10-15 13:08:11,133 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 13:08:11,133 INFO L276 IsEmpty]: Start isEmpty. Operand 691 states and 692 transitions. [2018-10-15 13:08:11,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 691 [2018-10-15 13:08:11,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:11,136 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:11,137 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:11,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:11,137 INFO L82 PathProgramCache]: Analyzing trace with hash 1108807720, now seen corresponding path program 72 times [2018-10-15 13:08:11,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 15700 backedges. 6864 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:12,683 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:12,683 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 13:08:12,684 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 13:08:12,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 13:08:12,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1589, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 13:08:12,684 INFO L87 Difference]: Start difference. First operand 691 states and 692 transitions. Second operand 55 states. [2018-10-15 13:08:16,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:16,196 INFO L93 Difference]: Finished difference Result 716 states and 717 transitions. [2018-10-15 13:08:16,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 151 states. [2018-10-15 13:08:16,196 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 690 [2018-10-15 13:08:16,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:16,199 INFO L225 Difference]: With dead ends: 716 [2018-10-15 13:08:16,199 INFO L226 Difference]: Without dead ends: 716 [2018-10-15 13:08:16,200 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7496 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=7807, Invalid=15755, Unknown=0, NotChecked=0, Total=23562 [2018-10-15 13:08:16,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-10-15 13:08:16,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 707. [2018-10-15 13:08:16,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 707 states. [2018-10-15 13:08:16,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 708 transitions. [2018-10-15 13:08:16,204 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 708 transitions. Word has length 690 [2018-10-15 13:08:16,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:16,205 INFO L481 AbstractCegarLoop]: Abstraction has 707 states and 708 transitions. [2018-10-15 13:08:16,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 13:08:16,205 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 708 transitions. [2018-10-15 13:08:16,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2018-10-15 13:08:16,208 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:16,208 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 49, 49, 49, 49, 49, 49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:16,209 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:16,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:16,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1377300390, now seen corresponding path program 73 times [2018-10-15 13:08:16,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:19,779 INFO L134 CoverageAnalysis]: Checked inductivity of 16468 backedges. 9604 proven. 6864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:19,779 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:19,779 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 13:08:19,780 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 13:08:19,780 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 13:08:19,780 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2602, Invalid=7700, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 13:08:19,780 INFO L87 Difference]: Start difference. First operand 707 states and 708 transitions. Second operand 102 states. [2018-10-15 13:08:26,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:26,210 INFO L93 Difference]: Finished difference Result 1103 states and 1104 transitions. [2018-10-15 13:08:26,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 13:08:26,210 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 706 [2018-10-15 13:08:26,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:26,214 INFO L225 Difference]: With dead ends: 1103 [2018-10-15 13:08:26,214 INFO L226 Difference]: Without dead ends: 716 [2018-10-15 13:08:26,215 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 198 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4849 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=12500, Invalid=27300, Unknown=0, NotChecked=0, Total=39800 [2018-10-15 13:08:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 716 states. [2018-10-15 13:08:26,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 716 to 713. [2018-10-15 13:08:26,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-10-15 13:08:26,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 714 transitions. [2018-10-15 13:08:26,220 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 714 transitions. Word has length 706 [2018-10-15 13:08:26,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:26,220 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 714 transitions. [2018-10-15 13:08:26,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 13:08:26,221 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 714 transitions. [2018-10-15 13:08:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-10-15 13:08:26,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:26,224 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:26,224 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:26,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -1310807936, now seen corresponding path program 74 times [2018-10-15 13:08:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:26,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:29,837 INFO L134 CoverageAnalysis]: Checked inductivity of 16758 backedges. 9604 proven. 7154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:29,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:29,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 13:08:29,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 13:08:29,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 13:08:29,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2653, Invalid=7853, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 13:08:29,838 INFO L87 Difference]: Start difference. First operand 713 states and 714 transitions. Second operand 103 states. [2018-10-15 13:08:37,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:37,325 INFO L93 Difference]: Finished difference Result 1117 states and 1118 transitions. [2018-10-15 13:08:37,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 13:08:37,325 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 712 [2018-10-15 13:08:37,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:37,327 INFO L225 Difference]: With dead ends: 1117 [2018-10-15 13:08:37,328 INFO L226 Difference]: Without dead ends: 722 [2018-10-15 13:08:37,328 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4900 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=12953, Invalid=28053, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 13:08:37,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 722 states. [2018-10-15 13:08:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 722 to 719. [2018-10-15 13:08:37,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 719 states. [2018-10-15 13:08:37,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 719 states to 719 states and 720 transitions. [2018-10-15 13:08:37,333 INFO L78 Accepts]: Start accepts. Automaton has 719 states and 720 transitions. Word has length 712 [2018-10-15 13:08:37,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:37,333 INFO L481 AbstractCegarLoop]: Abstraction has 719 states and 720 transitions. [2018-10-15 13:08:37,333 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 13:08:37,334 INFO L276 IsEmpty]: Start isEmpty. Operand 719 states and 720 transitions. [2018-10-15 13:08:37,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 719 [2018-10-15 13:08:37,337 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:37,337 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:37,337 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:37,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:37,338 INFO L82 PathProgramCache]: Analyzing trace with hash -223343578, now seen corresponding path program 75 times [2018-10-15 13:08:37,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:38,990 INFO L134 CoverageAnalysis]: Checked inductivity of 17054 backedges. 7450 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:38,990 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:38,990 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 13:08:38,991 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 13:08:38,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 13:08:38,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1704, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 13:08:38,991 INFO L87 Difference]: Start difference. First operand 719 states and 720 transitions. Second operand 57 states. [2018-10-15 13:08:42,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:42,620 INFO L93 Difference]: Finished difference Result 744 states and 745 transitions. [2018-10-15 13:08:42,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 157 states. [2018-10-15 13:08:42,620 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 718 [2018-10-15 13:08:42,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:42,624 INFO L225 Difference]: With dead ends: 744 [2018-10-15 13:08:42,624 INFO L226 Difference]: Without dead ends: 744 [2018-10-15 13:08:42,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8108 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=8431, Invalid=17009, Unknown=0, NotChecked=0, Total=25440 [2018-10-15 13:08:42,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-15 13:08:42,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 735. [2018-10-15 13:08:42,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 735 states. [2018-10-15 13:08:42,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 735 states to 735 states and 736 transitions. [2018-10-15 13:08:42,630 INFO L78 Accepts]: Start accepts. Automaton has 735 states and 736 transitions. Word has length 718 [2018-10-15 13:08:42,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:42,631 INFO L481 AbstractCegarLoop]: Abstraction has 735 states and 736 transitions. [2018-10-15 13:08:42,631 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 13:08:42,631 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states and 736 transitions. [2018-10-15 13:08:42,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 735 [2018-10-15 13:08:42,634 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:42,635 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 51, 51, 51, 51, 51, 51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:42,635 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:42,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:42,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1011527592, now seen corresponding path program 76 times [2018-10-15 13:08:42,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:46,682 INFO L134 CoverageAnalysis]: Checked inductivity of 17854 backedges. 10404 proven. 7450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:46,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:46,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-10-15 13:08:46,683 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-15 13:08:46,683 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-15 13:08:46,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2810, Invalid=8320, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 13:08:46,684 INFO L87 Difference]: Start difference. First operand 735 states and 736 transitions. Second operand 106 states. [2018-10-15 13:08:54,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:08:54,101 INFO L93 Difference]: Finished difference Result 1147 states and 1148 transitions. [2018-10-15 13:08:54,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 13:08:54,101 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 734 [2018-10-15 13:08:54,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:08:54,105 INFO L225 Difference]: With dead ends: 1147 [2018-10-15 13:08:54,105 INFO L226 Difference]: Without dead ends: 744 [2018-10-15 13:08:54,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 208 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5251 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=13520, Invalid=29536, Unknown=0, NotChecked=0, Total=43056 [2018-10-15 13:08:54,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 744 states. [2018-10-15 13:08:54,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 744 to 741. [2018-10-15 13:08:54,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 741 states. [2018-10-15 13:08:54,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 741 states to 741 states and 742 transitions. [2018-10-15 13:08:54,113 INFO L78 Accepts]: Start accepts. Automaton has 741 states and 742 transitions. Word has length 734 [2018-10-15 13:08:54,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:08:54,114 INFO L481 AbstractCegarLoop]: Abstraction has 741 states and 742 transitions. [2018-10-15 13:08:54,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-15 13:08:54,114 INFO L276 IsEmpty]: Start isEmpty. Operand 741 states and 742 transitions. [2018-10-15 13:08:54,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 741 [2018-10-15 13:08:54,118 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:08:54,118 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:08:54,118 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:08:54,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:08:54,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1815335806, now seen corresponding path program 77 times [2018-10-15 13:08:54,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:08:54,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:08:58,331 INFO L134 CoverageAnalysis]: Checked inductivity of 18156 backedges. 10404 proven. 7752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:08:58,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:08:58,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 13:08:58,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 13:08:58,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 13:08:58,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2863, Invalid=8479, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 13:08:58,333 INFO L87 Difference]: Start difference. First operand 741 states and 742 transitions. Second operand 107 states. [2018-10-15 13:09:05,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:05,442 INFO L93 Difference]: Finished difference Result 1161 states and 1162 transitions. [2018-10-15 13:09:05,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 13:09:05,442 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 740 [2018-10-15 13:09:05,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:05,446 INFO L225 Difference]: With dead ends: 1161 [2018-10-15 13:09:05,446 INFO L226 Difference]: Without dead ends: 750 [2018-10-15 13:09:05,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5304 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=13991, Invalid=30319, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 13:09:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-15 13:09:05,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 747. [2018-10-15 13:09:05,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 747 states. [2018-10-15 13:09:05,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 747 states to 747 states and 748 transitions. [2018-10-15 13:09:05,455 INFO L78 Accepts]: Start accepts. Automaton has 747 states and 748 transitions. Word has length 740 [2018-10-15 13:09:05,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:05,455 INFO L481 AbstractCegarLoop]: Abstraction has 747 states and 748 transitions. [2018-10-15 13:09:05,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 13:09:05,455 INFO L276 IsEmpty]: Start isEmpty. Operand 747 states and 748 transitions. [2018-10-15 13:09:05,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 747 [2018-10-15 13:09:05,460 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:05,460 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:05,461 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:05,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:05,461 INFO L82 PathProgramCache]: Analyzing trace with hash -391060956, now seen corresponding path program 78 times [2018-10-15 13:09:05,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:05,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:07,384 INFO L134 CoverageAnalysis]: Checked inductivity of 18464 backedges. 8060 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:07,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:07,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 13:09:07,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 13:09:07,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 13:09:07,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1823, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 13:09:07,385 INFO L87 Difference]: Start difference. First operand 747 states and 748 transitions. Second operand 59 states. [2018-10-15 13:09:11,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:11,287 INFO L93 Difference]: Finished difference Result 772 states and 773 transitions. [2018-10-15 13:09:11,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2018-10-15 13:09:11,288 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 746 [2018-10-15 13:09:11,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:11,290 INFO L225 Difference]: With dead ends: 772 [2018-10-15 13:09:11,291 INFO L226 Difference]: Without dead ends: 772 [2018-10-15 13:09:11,292 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 218 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 164 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8744 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=9079, Invalid=18311, Unknown=0, NotChecked=0, Total=27390 [2018-10-15 13:09:11,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-10-15 13:09:11,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 763. [2018-10-15 13:09:11,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 763 states. [2018-10-15 13:09:11,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 763 states to 763 states and 764 transitions. [2018-10-15 13:09:11,298 INFO L78 Accepts]: Start accepts. Automaton has 763 states and 764 transitions. Word has length 746 [2018-10-15 13:09:11,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:11,299 INFO L481 AbstractCegarLoop]: Abstraction has 763 states and 764 transitions. [2018-10-15 13:09:11,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 13:09:11,299 INFO L276 IsEmpty]: Start isEmpty. Operand 763 states and 764 transitions. [2018-10-15 13:09:11,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 763 [2018-10-15 13:09:11,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:11,304 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 53, 53, 53, 53, 53, 53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:11,305 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:11,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:11,305 INFO L82 PathProgramCache]: Analyzing trace with hash 402025046, now seen corresponding path program 79 times [2018-10-15 13:09:11,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:11,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:15,429 INFO L134 CoverageAnalysis]: Checked inductivity of 19296 backedges. 11236 proven. 8060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:15,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:15,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-10-15 13:09:15,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-15 13:09:15,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-15 13:09:15,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3026, Invalid=8964, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 13:09:15,431 INFO L87 Difference]: Start difference. First operand 763 states and 764 transitions. Second operand 110 states. [2018-10-15 13:09:23,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:23,616 INFO L93 Difference]: Finished difference Result 1191 states and 1192 transitions. [2018-10-15 13:09:23,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 13:09:23,621 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 762 [2018-10-15 13:09:23,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:23,623 INFO L225 Difference]: With dead ends: 1191 [2018-10-15 13:09:23,623 INFO L226 Difference]: Without dead ends: 772 [2018-10-15 13:09:23,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 214 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5669 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14580, Invalid=31860, Unknown=0, NotChecked=0, Total=46440 [2018-10-15 13:09:23,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 772 states. [2018-10-15 13:09:23,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 772 to 769. [2018-10-15 13:09:23,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 769 states. [2018-10-15 13:09:23,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 770 transitions. [2018-10-15 13:09:23,631 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 770 transitions. Word has length 762 [2018-10-15 13:09:23,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:23,632 INFO L481 AbstractCegarLoop]: Abstraction has 769 states and 770 transitions. [2018-10-15 13:09:23,632 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-15 13:09:23,632 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 770 transitions. [2018-10-15 13:09:23,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 769 [2018-10-15 13:09:23,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:23,637 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:23,637 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:23,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:23,638 INFO L82 PathProgramCache]: Analyzing trace with hash 993941628, now seen corresponding path program 80 times [2018-10-15 13:09:23,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:28,056 INFO L134 CoverageAnalysis]: Checked inductivity of 19610 backedges. 11236 proven. 8374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:28,056 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:28,056 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 13:09:28,057 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 13:09:28,057 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 13:09:28,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=9129, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 13:09:28,057 INFO L87 Difference]: Start difference. First operand 769 states and 770 transitions. Second operand 111 states. [2018-10-15 13:09:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:36,517 INFO L93 Difference]: Finished difference Result 1205 states and 1206 transitions. [2018-10-15 13:09:36,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 13:09:36,517 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 768 [2018-10-15 13:09:36,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:36,519 INFO L225 Difference]: With dead ends: 1205 [2018-10-15 13:09:36,519 INFO L226 Difference]: Without dead ends: 778 [2018-10-15 13:09:36,521 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5724 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=15069, Invalid=32673, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 13:09:36,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 778 states. [2018-10-15 13:09:36,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 778 to 775. [2018-10-15 13:09:36,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 775 states. [2018-10-15 13:09:36,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 775 states to 775 states and 776 transitions. [2018-10-15 13:09:36,527 INFO L78 Accepts]: Start accepts. Automaton has 775 states and 776 transitions. Word has length 768 [2018-10-15 13:09:36,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:36,527 INFO L481 AbstractCegarLoop]: Abstraction has 775 states and 776 transitions. [2018-10-15 13:09:36,527 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 13:09:36,527 INFO L276 IsEmpty]: Start isEmpty. Operand 775 states and 776 transitions. [2018-10-15 13:09:36,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 775 [2018-10-15 13:09:36,532 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:36,532 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:36,532 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:36,532 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:36,532 INFO L82 PathProgramCache]: Analyzing trace with hash 1921552930, now seen corresponding path program 81 times [2018-10-15 13:09:36,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:38,464 INFO L134 CoverageAnalysis]: Checked inductivity of 19930 backedges. 8694 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:38,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:38,465 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 13:09:38,465 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 13:09:38,465 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 13:09:38,466 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1946, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 13:09:38,466 INFO L87 Difference]: Start difference. First operand 775 states and 776 transitions. Second operand 61 states. [2018-10-15 13:09:42,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:42,676 INFO L93 Difference]: Finished difference Result 800 states and 801 transitions. [2018-10-15 13:09:42,677 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 169 states. [2018-10-15 13:09:42,677 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 774 [2018-10-15 13:09:42,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:42,678 INFO L225 Difference]: With dead ends: 800 [2018-10-15 13:09:42,678 INFO L226 Difference]: Without dead ends: 800 [2018-10-15 13:09:42,679 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 170 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9404 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=9751, Invalid=19661, Unknown=0, NotChecked=0, Total=29412 [2018-10-15 13:09:42,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-10-15 13:09:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 791. [2018-10-15 13:09:42,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 791 states. [2018-10-15 13:09:42,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 791 states to 791 states and 792 transitions. [2018-10-15 13:09:42,684 INFO L78 Accepts]: Start accepts. Automaton has 791 states and 792 transitions. Word has length 774 [2018-10-15 13:09:42,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:42,685 INFO L481 AbstractCegarLoop]: Abstraction has 791 states and 792 transitions. [2018-10-15 13:09:42,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 13:09:42,685 INFO L276 IsEmpty]: Start isEmpty. Operand 791 states and 792 transitions. [2018-10-15 13:09:42,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 791 [2018-10-15 13:09:42,690 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:42,691 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 55, 55, 55, 55, 55, 55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:42,691 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:42,691 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:42,691 INFO L82 PathProgramCache]: Analyzing trace with hash 991583828, now seen corresponding path program 82 times [2018-10-15 13:09:42,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:42,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:47,093 INFO L134 CoverageAnalysis]: Checked inductivity of 20794 backedges. 12100 proven. 8694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:47,094 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:47,094 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 13:09:47,094 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 13:09:47,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 13:09:47,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3250, Invalid=9632, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 13:09:47,095 INFO L87 Difference]: Start difference. First operand 791 states and 792 transitions. Second operand 114 states. [2018-10-15 13:09:55,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:09:55,098 INFO L93 Difference]: Finished difference Result 1235 states and 1236 transitions. [2018-10-15 13:09:55,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 13:09:55,099 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 790 [2018-10-15 13:09:55,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:09:55,101 INFO L225 Difference]: With dead ends: 1235 [2018-10-15 13:09:55,101 INFO L226 Difference]: Without dead ends: 800 [2018-10-15 13:09:55,103 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 222 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6103 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=15680, Invalid=34272, Unknown=0, NotChecked=0, Total=49952 [2018-10-15 13:09:55,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2018-10-15 13:09:55,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 797. [2018-10-15 13:09:55,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 797 states. [2018-10-15 13:09:55,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 797 states to 797 states and 798 transitions. [2018-10-15 13:09:55,108 INFO L78 Accepts]: Start accepts. Automaton has 797 states and 798 transitions. Word has length 790 [2018-10-15 13:09:55,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:09:55,108 INFO L481 AbstractCegarLoop]: Abstraction has 797 states and 798 transitions. [2018-10-15 13:09:55,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 13:09:55,108 INFO L276 IsEmpty]: Start isEmpty. Operand 797 states and 798 transitions. [2018-10-15 13:09:55,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 797 [2018-10-15 13:09:55,112 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:09:55,113 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:09:55,113 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:09:55,113 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:09:55,113 INFO L82 PathProgramCache]: Analyzing trace with hash -1506986118, now seen corresponding path program 83 times [2018-10-15 13:09:55,114 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:09:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:09:59,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21120 backedges. 12100 proven. 9020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:09:59,816 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:09:59,816 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 13:09:59,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 13:09:59,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 13:09:59,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3307, Invalid=9803, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 13:09:59,818 INFO L87 Difference]: Start difference. First operand 797 states and 798 transitions. Second operand 115 states. [2018-10-15 13:10:08,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:08,744 INFO L93 Difference]: Finished difference Result 1249 states and 1250 transitions. [2018-10-15 13:10:08,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 13:10:08,744 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 796 [2018-10-15 13:10:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:08,746 INFO L225 Difference]: With dead ends: 1249 [2018-10-15 13:10:08,746 INFO L226 Difference]: Without dead ends: 806 [2018-10-15 13:10:08,748 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6160 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=16187, Invalid=35115, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 13:10:08,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2018-10-15 13:10:08,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 803. [2018-10-15 13:10:08,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 803 states. [2018-10-15 13:10:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 804 transitions. [2018-10-15 13:10:08,753 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 804 transitions. Word has length 796 [2018-10-15 13:10:08,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:08,754 INFO L481 AbstractCegarLoop]: Abstraction has 803 states and 804 transitions. [2018-10-15 13:10:08,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 13:10:08,754 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 804 transitions. [2018-10-15 13:10:08,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 803 [2018-10-15 13:10:08,758 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:08,758 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:08,759 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:08,759 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:08,759 INFO L82 PathProgramCache]: Analyzing trace with hash -31056864, now seen corresponding path program 84 times [2018-10-15 13:10:08,760 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:08,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:10,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21452 backedges. 9352 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:10,801 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:10,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 13:10:10,801 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 13:10:10,802 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 13:10:10,802 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=2073, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 13:10:10,802 INFO L87 Difference]: Start difference. First operand 803 states and 804 transitions. Second operand 63 states. [2018-10-15 13:10:15,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:15,079 INFO L93 Difference]: Finished difference Result 828 states and 829 transitions. [2018-10-15 13:10:15,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 175 states. [2018-10-15 13:10:15,079 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 802 [2018-10-15 13:10:15,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:15,081 INFO L225 Difference]: With dead ends: 828 [2018-10-15 13:10:15,081 INFO L226 Difference]: Without dead ends: 828 [2018-10-15 13:10:15,083 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 176 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10088 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=10447, Invalid=21059, Unknown=0, NotChecked=0, Total=31506 [2018-10-15 13:10:15,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-10-15 13:10:15,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 819. [2018-10-15 13:10:15,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 819 states. [2018-10-15 13:10:15,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 819 states to 819 states and 820 transitions. [2018-10-15 13:10:15,088 INFO L78 Accepts]: Start accepts. Automaton has 819 states and 820 transitions. Word has length 802 [2018-10-15 13:10:15,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:15,089 INFO L481 AbstractCegarLoop]: Abstraction has 819 states and 820 transitions. [2018-10-15 13:10:15,089 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 13:10:15,089 INFO L276 IsEmpty]: Start isEmpty. Operand 819 states and 820 transitions. [2018-10-15 13:10:15,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 819 [2018-10-15 13:10:15,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:15,094 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 57, 57, 57, 57, 57, 57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:15,094 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:15,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:15,094 INFO L82 PathProgramCache]: Analyzing trace with hash -586142638, now seen corresponding path program 85 times [2018-10-15 13:10:15,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:15,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:20,136 INFO L134 CoverageAnalysis]: Checked inductivity of 22348 backedges. 12996 proven. 9352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:20,136 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:20,136 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 13:10:20,137 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 13:10:20,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 13:10:20,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3482, Invalid=10324, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 13:10:20,138 INFO L87 Difference]: Start difference. First operand 819 states and 820 transitions. Second operand 118 states. [2018-10-15 13:10:29,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:29,479 INFO L93 Difference]: Finished difference Result 1279 states and 1280 transitions. [2018-10-15 13:10:29,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 13:10:29,479 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 818 [2018-10-15 13:10:29,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:29,481 INFO L225 Difference]: With dead ends: 1279 [2018-10-15 13:10:29,481 INFO L226 Difference]: Without dead ends: 828 [2018-10-15 13:10:29,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 230 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6553 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=16820, Invalid=36772, Unknown=0, NotChecked=0, Total=53592 [2018-10-15 13:10:29,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2018-10-15 13:10:29,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 825. [2018-10-15 13:10:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 825 states. [2018-10-15 13:10:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 825 states to 825 states and 826 transitions. [2018-10-15 13:10:29,487 INFO L78 Accepts]: Start accepts. Automaton has 825 states and 826 transitions. Word has length 818 [2018-10-15 13:10:29,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:29,487 INFO L481 AbstractCegarLoop]: Abstraction has 825 states and 826 transitions. [2018-10-15 13:10:29,487 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 13:10:29,487 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 826 transitions. [2018-10-15 13:10:29,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 825 [2018-10-15 13:10:29,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:29,492 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:29,492 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:29,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:29,492 INFO L82 PathProgramCache]: Analyzing trace with hash -1280348040, now seen corresponding path program 86 times [2018-10-15 13:10:29,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:29,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 22686 backedges. 12996 proven. 9690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:34,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:34,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:10:34,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:10:34,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:10:34,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3541, Invalid=10501, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:10:34,639 INFO L87 Difference]: Start difference. First operand 825 states and 826 transitions. Second operand 119 states. [2018-10-15 13:10:44,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:44,322 INFO L93 Difference]: Finished difference Result 1293 states and 1294 transitions. [2018-10-15 13:10:44,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 13:10:44,322 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 824 [2018-10-15 13:10:44,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:44,324 INFO L225 Difference]: With dead ends: 1293 [2018-10-15 13:10:44,324 INFO L226 Difference]: Without dead ends: 834 [2018-10-15 13:10:44,325 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6612 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=17345, Invalid=37645, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 13:10:44,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 834 states. [2018-10-15 13:10:44,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 834 to 831. [2018-10-15 13:10:44,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 831 states. [2018-10-15 13:10:44,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 832 transitions. [2018-10-15 13:10:44,330 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 832 transitions. Word has length 824 [2018-10-15 13:10:44,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:44,330 INFO L481 AbstractCegarLoop]: Abstraction has 831 states and 832 transitions. [2018-10-15 13:10:44,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:10:44,330 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 832 transitions. [2018-10-15 13:10:44,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 831 [2018-10-15 13:10:44,334 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:44,335 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 58, 58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:44,335 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:44,335 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:44,335 INFO L82 PathProgramCache]: Analyzing trace with hash -654802914, now seen corresponding path program 87 times [2018-10-15 13:10:44,336 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:46,489 INFO L134 CoverageAnalysis]: Checked inductivity of 23030 backedges. 10034 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:46,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:46,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 13:10:46,490 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 13:10:46,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 13:10:46,491 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2204, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 13:10:46,491 INFO L87 Difference]: Start difference. First operand 831 states and 832 transitions. Second operand 65 states. [2018-10-15 13:10:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:10:51,288 INFO L93 Difference]: Finished difference Result 856 states and 857 transitions. [2018-10-15 13:10:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 181 states. [2018-10-15 13:10:51,289 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 830 [2018-10-15 13:10:51,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:10:51,291 INFO L225 Difference]: With dead ends: 856 [2018-10-15 13:10:51,292 INFO L226 Difference]: Without dead ends: 856 [2018-10-15 13:10:51,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 182 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10796 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=11167, Invalid=22505, Unknown=0, NotChecked=0, Total=33672 [2018-10-15 13:10:51,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-15 13:10:51,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 847. [2018-10-15 13:10:51,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 847 states. [2018-10-15 13:10:51,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 847 states to 847 states and 848 transitions. [2018-10-15 13:10:51,299 INFO L78 Accepts]: Start accepts. Automaton has 847 states and 848 transitions. Word has length 830 [2018-10-15 13:10:51,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:10:51,299 INFO L481 AbstractCegarLoop]: Abstraction has 847 states and 848 transitions. [2018-10-15 13:10:51,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 13:10:51,300 INFO L276 IsEmpty]: Start isEmpty. Operand 847 states and 848 transitions. [2018-10-15 13:10:51,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 847 [2018-10-15 13:10:51,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:10:51,306 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 59, 59, 59, 59, 59, 59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:10:51,306 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:10:51,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:10:51,307 INFO L82 PathProgramCache]: Analyzing trace with hash -1924737968, now seen corresponding path program 88 times [2018-10-15 13:10:51,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:10:51,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:10:56,677 INFO L134 CoverageAnalysis]: Checked inductivity of 23958 backedges. 13924 proven. 10034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:10:56,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:10:56,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 13:10:56,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 13:10:56,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 13:10:56,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3722, Invalid=11040, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:10:56,679 INFO L87 Difference]: Start difference. First operand 847 states and 848 transitions. Second operand 122 states. [2018-10-15 13:11:06,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:06,591 INFO L93 Difference]: Finished difference Result 1323 states and 1324 transitions. [2018-10-15 13:11:06,591 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 13:11:06,592 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 846 [2018-10-15 13:11:06,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:06,594 INFO L225 Difference]: With dead ends: 1323 [2018-10-15 13:11:06,594 INFO L226 Difference]: Without dead ends: 856 [2018-10-15 13:11:06,596 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 238 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7019 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=18000, Invalid=39360, Unknown=0, NotChecked=0, Total=57360 [2018-10-15 13:11:06,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 856 states. [2018-10-15 13:11:06,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 856 to 853. [2018-10-15 13:11:06,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2018-10-15 13:11:06,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 854 transitions. [2018-10-15 13:11:06,601 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 854 transitions. Word has length 846 [2018-10-15 13:11:06,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:06,601 INFO L481 AbstractCegarLoop]: Abstraction has 853 states and 854 transitions. [2018-10-15 13:11:06,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 13:11:06,601 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 854 transitions. [2018-10-15 13:11:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2018-10-15 13:11:06,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:06,606 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:06,606 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:06,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:06,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1443626122, now seen corresponding path program 89 times [2018-10-15 13:11:06,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:12,018 INFO L134 CoverageAnalysis]: Checked inductivity of 24308 backedges. 13924 proven. 10384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:12,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:12,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:11:12,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:11:12,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:11:12,020 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3783, Invalid=11223, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:11:12,020 INFO L87 Difference]: Start difference. First operand 853 states and 854 transitions. Second operand 123 states. [2018-10-15 13:11:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:22,289 INFO L93 Difference]: Finished difference Result 1337 states and 1338 transitions. [2018-10-15 13:11:22,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 13:11:22,289 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 852 [2018-10-15 13:11:22,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:22,291 INFO L225 Difference]: With dead ends: 1337 [2018-10-15 13:11:22,291 INFO L226 Difference]: Without dead ends: 862 [2018-10-15 13:11:22,293 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7080 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=18543, Invalid=40263, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:11:22,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2018-10-15 13:11:22,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 859. [2018-10-15 13:11:22,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 859 states. [2018-10-15 13:11:22,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 859 states to 859 states and 860 transitions. [2018-10-15 13:11:22,299 INFO L78 Accepts]: Start accepts. Automaton has 859 states and 860 transitions. Word has length 852 [2018-10-15 13:11:22,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:22,300 INFO L481 AbstractCegarLoop]: Abstraction has 859 states and 860 transitions. [2018-10-15 13:11:22,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:11:22,300 INFO L276 IsEmpty]: Start isEmpty. Operand 859 states and 860 transitions. [2018-10-15 13:11:22,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 859 [2018-10-15 13:11:22,306 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:22,307 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 60, 60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:22,307 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:22,307 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:22,308 INFO L82 PathProgramCache]: Analyzing trace with hash -269566436, now seen corresponding path program 90 times [2018-10-15 13:11:22,308 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:22,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:24,796 INFO L134 CoverageAnalysis]: Checked inductivity of 24664 backedges. 10740 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:24,796 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:24,796 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 13:11:24,797 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 13:11:24,797 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 13:11:24,797 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2339, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 13:11:24,798 INFO L87 Difference]: Start difference. First operand 859 states and 860 transitions. Second operand 67 states. [2018-10-15 13:11:29,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:29,669 INFO L93 Difference]: Finished difference Result 884 states and 885 transitions. [2018-10-15 13:11:29,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 187 states. [2018-10-15 13:11:29,670 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 858 [2018-10-15 13:11:29,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:29,672 INFO L225 Difference]: With dead ends: 884 [2018-10-15 13:11:29,672 INFO L226 Difference]: Without dead ends: 884 [2018-10-15 13:11:29,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 250 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11528 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=11911, Invalid=23999, Unknown=0, NotChecked=0, Total=35910 [2018-10-15 13:11:29,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-10-15 13:11:29,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 875. [2018-10-15 13:11:29,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 875 states. [2018-10-15 13:11:29,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 876 transitions. [2018-10-15 13:11:29,680 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 876 transitions. Word has length 858 [2018-10-15 13:11:29,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:29,680 INFO L481 AbstractCegarLoop]: Abstraction has 875 states and 876 transitions. [2018-10-15 13:11:29,680 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 13:11:29,680 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 876 transitions. [2018-10-15 13:11:29,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 875 [2018-10-15 13:11:29,685 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:29,685 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 61, 61, 61, 61, 61, 61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:29,686 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:29,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:29,686 INFO L82 PathProgramCache]: Analyzing trace with hash 2058180174, now seen corresponding path program 91 times [2018-10-15 13:11:29,686 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:29,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 25624 backedges. 14884 proven. 10740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:35,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:35,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 13:11:35,405 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 13:11:35,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 13:11:35,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3970, Invalid=11780, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 13:11:35,406 INFO L87 Difference]: Start difference. First operand 875 states and 876 transitions. Second operand 126 states. [2018-10-15 13:11:46,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:11:46,017 INFO L93 Difference]: Finished difference Result 1367 states and 1368 transitions. [2018-10-15 13:11:46,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:11:46,018 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 874 [2018-10-15 13:11:46,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:11:46,019 INFO L225 Difference]: With dead ends: 1367 [2018-10-15 13:11:46,020 INFO L226 Difference]: Without dead ends: 884 [2018-10-15 13:11:46,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 248 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 246 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7501 ImplicationChecksByTransitivity, 12.4s TimeCoverageRelationStatistics Valid=19220, Invalid=42036, Unknown=0, NotChecked=0, Total=61256 [2018-10-15 13:11:46,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 884 states. [2018-10-15 13:11:46,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 884 to 881. [2018-10-15 13:11:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 881 states. [2018-10-15 13:11:46,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 882 transitions. [2018-10-15 13:11:46,027 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 882 transitions. Word has length 874 [2018-10-15 13:11:46,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:11:46,027 INFO L481 AbstractCegarLoop]: Abstraction has 881 states and 882 transitions. [2018-10-15 13:11:46,027 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 13:11:46,027 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 882 transitions. [2018-10-15 13:11:46,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 881 [2018-10-15 13:11:46,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:11:46,033 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:11:46,033 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:11:46,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:11:46,033 INFO L82 PathProgramCache]: Analyzing trace with hash -827723660, now seen corresponding path program 92 times [2018-10-15 13:11:46,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:11:46,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:11:51,744 INFO L134 CoverageAnalysis]: Checked inductivity of 25986 backedges. 14884 proven. 11102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:11:51,744 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:11:51,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:11:51,745 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:11:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:11:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4033, Invalid=11969, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:11:51,746 INFO L87 Difference]: Start difference. First operand 881 states and 882 transitions. Second operand 127 states. [2018-10-15 13:12:02,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:02,548 INFO L93 Difference]: Finished difference Result 1381 states and 1382 transitions. [2018-10-15 13:12:02,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 13:12:02,548 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 880 [2018-10-15 13:12:02,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:02,550 INFO L225 Difference]: With dead ends: 1381 [2018-10-15 13:12:02,550 INFO L226 Difference]: Without dead ends: 890 [2018-10-15 13:12:02,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7564 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=19781, Invalid=42969, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:12:02,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 890 states. [2018-10-15 13:12:02,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 890 to 887. [2018-10-15 13:12:02,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 887 states. [2018-10-15 13:12:02,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 888 transitions. [2018-10-15 13:12:02,559 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 888 transitions. Word has length 880 [2018-10-15 13:12:02,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:02,560 INFO L481 AbstractCegarLoop]: Abstraction has 887 states and 888 transitions. [2018-10-15 13:12:02,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:12:02,560 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 888 transitions. [2018-10-15 13:12:02,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 887 [2018-10-15 13:12:02,566 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:02,567 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 62, 62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:02,567 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:02,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:02,567 INFO L82 PathProgramCache]: Analyzing trace with hash -1887971814, now seen corresponding path program 93 times [2018-10-15 13:12:02,568 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:05,041 INFO L134 CoverageAnalysis]: Checked inductivity of 26354 backedges. 11470 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:05,041 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:05,042 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 13:12:05,042 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 13:12:05,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 13:12:05,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2478, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 13:12:05,043 INFO L87 Difference]: Start difference. First operand 887 states and 888 transitions. Second operand 69 states. [2018-10-15 13:12:10,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:12:10,096 INFO L93 Difference]: Finished difference Result 912 states and 913 transitions. [2018-10-15 13:12:10,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 193 states. [2018-10-15 13:12:10,096 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 886 [2018-10-15 13:12:10,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:12:10,098 INFO L225 Difference]: With dead ends: 912 [2018-10-15 13:12:10,099 INFO L226 Difference]: Without dead ends: 912 [2018-10-15 13:12:10,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 258 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 194 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12284 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=12679, Invalid=25541, Unknown=0, NotChecked=0, Total=38220 [2018-10-15 13:12:10,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 912 states. [2018-10-15 13:12:10,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 912 to 903. [2018-10-15 13:12:10,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 903 states. [2018-10-15 13:12:10,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 903 states to 903 states and 904 transitions. [2018-10-15 13:12:10,107 INFO L78 Accepts]: Start accepts. Automaton has 903 states and 904 transitions. Word has length 886 [2018-10-15 13:12:10,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:12:10,107 INFO L481 AbstractCegarLoop]: Abstraction has 903 states and 904 transitions. [2018-10-15 13:12:10,108 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 13:12:10,108 INFO L276 IsEmpty]: Start isEmpty. Operand 903 states and 904 transitions. [2018-10-15 13:12:10,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 903 [2018-10-15 13:12:10,144 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:12:10,145 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 63, 63, 63, 63, 63, 63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:12:10,145 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:12:10,145 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:12:10,145 INFO L82 PathProgramCache]: Analyzing trace with hash 867349068, now seen corresponding path program 94 times [2018-10-15 13:12:10,146 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:12:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:12:16,839 INFO L134 CoverageAnalysis]: Checked inductivity of 27346 backedges. 15876 proven. 11470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:12:16,840 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:12:16,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-10-15 13:12:16,841 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-15 13:12:16,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-15 13:12:16,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4226, Invalid=12544, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:12:16,842 INFO L87 Difference]: Start difference. First operand 903 states and 904 transitions. Second operand 130 states.