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/20170304-DifficultPathPrograms/array1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 15:23:32,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 15:23:32,672 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 15:23:32,683 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 15:23:32,683 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 15:23:32,685 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 15:23:32,686 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 15:23:32,688 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 15:23:32,689 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 15:23:32,690 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 15:23:32,691 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 15:23:32,692 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 15:23:32,693 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 15:23:32,694 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 15:23:32,695 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 15:23:32,696 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 15:23:32,697 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 15:23:32,699 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 15:23:32,701 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 15:23:32,703 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 15:23:32,704 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 15:23:32,705 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 15:23:32,708 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 15:23:32,708 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 15:23:32,708 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 15:23:32,709 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 15:23:32,710 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 15:23:32,711 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 15:23:32,712 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 15:23:32,713 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 15:23:32,713 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 15:23:32,714 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 15:23:32,714 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 15:23:32,714 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 15:23:32,716 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 15:23:32,716 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 15:23:32,717 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 15:23:32,726 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 15:23:32,726 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 15:23:32,727 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 15:23:32,727 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 15:23:32,728 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 15:23:32,728 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 15:23:32,729 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 15:23:32,729 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 15:23:32,729 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 15:23:32,729 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 15:23:32,729 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 15:23:32,730 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 15:23:32,730 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 15:23:32,731 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 15:23:32,731 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 15:23:32,774 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 15:23:32,788 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 15:23:32,792 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 15:23:32,793 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 15:23:32,794 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 15:23:32,795 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl [2018-10-15 15:23:32,795 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/array1.i_3.bpl' [2018-10-15 15:23:32,848 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 15:23:32,849 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 15:23:32,850 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,850 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 15:23:32,850 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 15:23:32,874 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,876 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,892 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,894 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,895 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... [2018-10-15 15:23:32,897 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 15:23:32,898 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 15:23:32,898 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 15:23:32,898 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 15:23:32,899 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 15:23:32,975 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 15:23:32,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 15:23:33,335 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 15:23:33,336 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33 BoogieIcfgContainer [2018-10-15 15:23:33,336 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 15:23:33,337 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 15:23:33,337 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 15:23:33,338 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 15:23:33,341 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (1/1) ... [2018-10-15 15:23:33,345 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 15:23:33,358 INFO L202 PluginConnector]: Adding new model array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33 BasicIcfg [2018-10-15 15:23:33,359 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 15:23:33,360 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 15:23:33,360 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 15:23:33,363 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 15:23:33,363 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 03:23:32" (1/3) ... [2018-10-15 15:23:33,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff8060 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 03:23:33" (2/3) ... [2018-10-15 15:23:33,369 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ff8060 and model type array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 03:23:33, skipping insertion in model container [2018-10-15 15:23:33,369 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "array1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 03:23:33" (3/3) ... [2018-10-15 15:23:33,372 INFO L112 eAbstractionObserver]: Analyzing ICFG array1.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 15:23:33,384 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 15:23:33,395 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 15:23:33,413 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 15:23:33,451 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 15:23:33,452 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 15:23:33,452 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 15:23:33,452 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 15:23:33,453 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 15:23:33,453 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 15:23:33,453 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 15:23:33,453 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 15:23:33,454 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 15:23:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2018-10-15 15:23:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-15 15:23:33,493 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,495 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,497 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1386147999, now seen corresponding path program 1 times [2018-10-15 15:23:33,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:33,701 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 15:23:33,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 15:23:33,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 15:23:33,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 15:23:33,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 15:23:33,753 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:33,756 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 3 states. [2018-10-15 15:23:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:33,857 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-10-15 15:23:33,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 15:23:33,860 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-10-15 15:23:33,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:33,871 INFO L225 Difference]: With dead ends: 23 [2018-10-15 15:23:33,872 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 15:23:33,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 15:23:33,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 15:23:33,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 20. [2018-10-15 15:23:33,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 15:23:33,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 15:23:33,905 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 13 [2018-10-15 15:23:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:33,906 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 15:23:33,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 15:23:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 15:23:33,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 15:23:33,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:33,907 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:33,908 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:33,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:33,908 INFO L82 PathProgramCache]: Analyzing trace with hash 2088631495, now seen corresponding path program 1 times [2018-10-15 15:23:33,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:33,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:34,027 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 15:23:34,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 15:23:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 15:23:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 15:23:34,031 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2018-10-15 15:23:34,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,181 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 15:23:34,182 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 15:23:34,182 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 15:23:34,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,183 INFO L225 Difference]: With dead ends: 29 [2018-10-15 15:23:34,183 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 15:23:34,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 15:23:34,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 15:23:34,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 15:23:34,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 15:23:34,189 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2018-10-15 15:23:34,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,190 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 15:23:34,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 15:23:34,190 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 15:23:34,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 15:23:34,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,191 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,192 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,192 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,192 INFO L82 PathProgramCache]: Analyzing trace with hash -1087322707, now seen corresponding path program 2 times [2018-10-15 15:23:34,193 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:34,371 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:34,371 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:34,371 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 15:23:34,372 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 15:23:34,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 15:23:34,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 15:23:34,373 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 7 states. [2018-10-15 15:23:34,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:34,746 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-10-15 15:23:34,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 15:23:34,749 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 25 [2018-10-15 15:23:34,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:34,751 INFO L225 Difference]: With dead ends: 35 [2018-10-15 15:23:34,751 INFO L226 Difference]: Without dead ends: 35 [2018-10-15 15:23:34,752 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=67, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:34,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-10-15 15:23:34,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2018-10-15 15:23:34,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-10-15 15:23:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 32 transitions. [2018-10-15 15:23:34,761 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 32 transitions. Word has length 25 [2018-10-15 15:23:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:34,762 INFO L481 AbstractCegarLoop]: Abstraction has 32 states and 32 transitions. [2018-10-15 15:23:34,763 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 15:23:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 32 transitions. [2018-10-15 15:23:34,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-10-15 15:23:34,764 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:34,764 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:34,764 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:34,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:34,766 INFO L82 PathProgramCache]: Analyzing trace with hash 428263955, now seen corresponding path program 3 times [2018-10-15 15:23:34,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:34,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,047 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:35,048 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,048 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 15:23:35,049 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 15:23:35,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 15:23:35,049 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2018-10-15 15:23:35,050 INFO L87 Difference]: Start difference. First operand 32 states and 32 transitions. Second operand 9 states. [2018-10-15 15:23:35,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,276 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-15 15:23:35,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 15:23:35,277 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2018-10-15 15:23:35,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,278 INFO L225 Difference]: With dead ends: 41 [2018-10-15 15:23:35,278 INFO L226 Difference]: Without dead ends: 41 [2018-10-15 15:23:35,283 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=132, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:35,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-15 15:23:35,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2018-10-15 15:23:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 15:23:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 15:23:35,293 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 31 [2018-10-15 15:23:35,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,294 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 15:23:35,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 15:23:35,294 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 15:23:35,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 15:23:35,298 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,298 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,298 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,299 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,299 INFO L82 PathProgramCache]: Analyzing trace with hash -2012911111, now seen corresponding path program 4 times [2018-10-15 15:23:35,300 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:35,505 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:35,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:35,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 15:23:35,507 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 15:23:35,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 15:23:35,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2018-10-15 15:23:35,510 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-10-15 15:23:35,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:35,975 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-15 15:23:35,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 15:23:35,980 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-15 15:23:35,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:35,981 INFO L225 Difference]: With dead ends: 47 [2018-10-15 15:23:35,981 INFO L226 Difference]: Without dead ends: 47 [2018-10-15 15:23:35,982 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=219, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:35,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-15 15:23:35,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 44. [2018-10-15 15:23:35,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-15 15:23:35,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-15 15:23:35,988 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 37 [2018-10-15 15:23:35,988 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:35,988 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-15 15:23:35,988 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 15:23:35,988 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-15 15:23:35,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-15 15:23:35,990 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:35,990 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:35,990 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:35,991 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:35,991 INFO L82 PathProgramCache]: Analyzing trace with hash 631899487, now seen corresponding path program 5 times [2018-10-15 15:23:35,992 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:36,218 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:36,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:36,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 15:23:36,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 15:23:36,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 15:23:36,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2018-10-15 15:23:36,220 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 13 states. [2018-10-15 15:23:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:36,887 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-15 15:23:36,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 15:23:36,889 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 43 [2018-10-15 15:23:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:36,890 INFO L225 Difference]: With dead ends: 53 [2018-10-15 15:23:36,890 INFO L226 Difference]: Without dead ends: 53 [2018-10-15 15:23:36,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=328, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:36,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-15 15:23:36,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 50. [2018-10-15 15:23:36,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-15 15:23:36,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-15 15:23:36,897 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 43 [2018-10-15 15:23:36,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:36,898 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-15 15:23:36,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 15:23:36,898 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-15 15:23:36,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-15 15:23:36,899 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:36,899 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:36,899 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:36,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:36,900 INFO L82 PathProgramCache]: Analyzing trace with hash 1911159877, now seen corresponding path program 6 times [2018-10-15 15:23:36,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:37,104 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 0 proven. 102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:37,104 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:37,104 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 15:23:37,105 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 15:23:37,105 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 15:23:37,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2018-10-15 15:23:37,106 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 15 states. [2018-10-15 15:23:37,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:37,436 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 15:23:37,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 15:23:37,436 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 49 [2018-10-15 15:23:37,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:37,438 INFO L225 Difference]: With dead ends: 59 [2018-10-15 15:23:37,438 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 15:23:37,440 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 96 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=459, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:37,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 15:23:37,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 15:23:37,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 15:23:37,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 15:23:37,445 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 49 [2018-10-15 15:23:37,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:37,446 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 15:23:37,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 15:23:37,446 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 15:23:37,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 15:23:37,447 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:37,447 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:37,448 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:37,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:37,448 INFO L82 PathProgramCache]: Analyzing trace with hash 380808875, now seen corresponding path program 7 times [2018-10-15 15:23:37,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:37,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:37,794 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:37,795 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:37,795 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 15:23:37,795 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 15:23:37,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 15:23:37,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2018-10-15 15:23:37,796 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 17 states. [2018-10-15 15:23:38,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:38,120 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-15 15:23:38,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 15:23:38,121 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 55 [2018-10-15 15:23:38,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:38,122 INFO L225 Difference]: With dead ends: 65 [2018-10-15 15:23:38,123 INFO L226 Difference]: Without dead ends: 65 [2018-10-15 15:23:38,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=318, Invalid=612, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:38,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-15 15:23:38,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2018-10-15 15:23:38,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-15 15:23:38,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-15 15:23:38,128 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 55 [2018-10-15 15:23:38,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:38,129 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-15 15:23:38,129 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 15:23:38,129 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-15 15:23:38,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-15 15:23:38,130 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:38,130 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:38,131 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:38,131 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:38,131 INFO L82 PathProgramCache]: Analyzing trace with hash 778665105, now seen corresponding path program 8 times [2018-10-15 15:23:38,132 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:38,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:38,477 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 0 proven. 184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:38,478 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:38,478 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 15:23:38,478 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 15:23:38,479 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 15:23:38,479 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2018-10-15 15:23:38,479 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 19 states. [2018-10-15 15:23:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:39,021 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-15 15:23:39,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 15:23:39,022 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 61 [2018-10-15 15:23:39,022 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:39,023 INFO L225 Difference]: With dead ends: 71 [2018-10-15 15:23:39,024 INFO L226 Difference]: Without dead ends: 71 [2018-10-15 15:23:39,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=403, Invalid=787, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:39,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-15 15:23:39,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 68. [2018-10-15 15:23:39,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-15 15:23:39,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-15 15:23:39,031 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 61 [2018-10-15 15:23:39,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:39,034 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-15 15:23:39,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 15:23:39,034 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-15 15:23:39,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-15 15:23:39,040 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,041 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:39,041 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,041 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,041 INFO L82 PathProgramCache]: Analyzing trace with hash 166446583, now seen corresponding path program 9 times [2018-10-15 15:23:39,042 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:39,458 INFO L134 CoverageAnalysis]: Checked inductivity of 234 backedges. 0 proven. 234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:39,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:39,458 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 15:23:39,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 15:23:39,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 15:23:39,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2018-10-15 15:23:39,460 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 21 states. [2018-10-15 15:23:39,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:39,865 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-15 15:23:39,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 15:23:39,873 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 67 [2018-10-15 15:23:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:39,874 INFO L225 Difference]: With dead ends: 77 [2018-10-15 15:23:39,874 INFO L226 Difference]: Without dead ends: 77 [2018-10-15 15:23:39,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 225 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=498, Invalid=984, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-15 15:23:39,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2018-10-15 15:23:39,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 15:23:39,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 15:23:39,903 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 67 [2018-10-15 15:23:39,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:39,903 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 15:23:39,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 15:23:39,903 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 15:23:39,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 15:23:39,904 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:39,904 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:39,906 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:39,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:39,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1989077725, now seen corresponding path program 10 times [2018-10-15 15:23:39,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:39,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:40,291 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:40,292 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:40,292 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 15:23:40,292 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 15:23:40,293 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 15:23:40,293 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2018-10-15 15:23:40,293 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 23 states. [2018-10-15 15:23:40,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:40,727 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-15 15:23:40,728 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 15:23:40,728 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-15 15:23:40,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:40,729 INFO L225 Difference]: With dead ends: 83 [2018-10-15 15:23:40,729 INFO L226 Difference]: Without dead ends: 83 [2018-10-15 15:23:40,731 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 280 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=603, Invalid=1203, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:40,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-15 15:23:40,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2018-10-15 15:23:40,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-15 15:23:40,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-15 15:23:40,736 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 73 [2018-10-15 15:23:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:40,737 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-15 15:23:40,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 15:23:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-15 15:23:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-15 15:23:40,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:40,738 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:40,739 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:40,739 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:40,739 INFO L82 PathProgramCache]: Analyzing trace with hash -2078258365, now seen corresponding path program 11 times [2018-10-15 15:23:40,740 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:40,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:41,032 INFO L134 CoverageAnalysis]: Checked inductivity of 352 backedges. 0 proven. 352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:41,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:41,033 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 15:23:41,033 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 15:23:41,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 15:23:41,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=168, Invalid=432, Unknown=0, NotChecked=0, Total=600 [2018-10-15 15:23:41,034 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 25 states. [2018-10-15 15:23:41,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:41,668 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 15:23:41,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 15:23:41,669 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 79 [2018-10-15 15:23:41,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:41,670 INFO L225 Difference]: With dead ends: 89 [2018-10-15 15:23:41,670 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 15:23:41,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=718, Invalid=1444, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:23:41,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 15:23:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 15:23:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 15:23:41,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 15:23:41,677 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 79 [2018-10-15 15:23:41,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:41,677 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 15:23:41,678 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 15:23:41,678 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 15:23:41,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 15:23:41,679 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:41,679 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:41,679 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:41,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:41,679 INFO L82 PathProgramCache]: Analyzing trace with hash -890943703, now seen corresponding path program 12 times [2018-10-15 15:23:41,680 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:41,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:42,021 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:42,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:42,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 15:23:42,022 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 15:23:42,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 15:23:42,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=507, Unknown=0, NotChecked=0, Total=702 [2018-10-15 15:23:42,023 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 27 states. [2018-10-15 15:23:42,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:42,521 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-15 15:23:42,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 15:23:42,521 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 85 [2018-10-15 15:23:42,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:42,523 INFO L225 Difference]: With dead ends: 95 [2018-10-15 15:23:42,523 INFO L226 Difference]: Without dead ends: 95 [2018-10-15 15:23:42,524 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=843, Invalid=1707, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:23:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-15 15:23:42,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 92. [2018-10-15 15:23:42,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 15:23:42,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 15:23:42,532 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 85 [2018-10-15 15:23:42,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:42,532 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 15:23:42,532 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 15:23:42,533 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 15:23:42,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 15:23:42,534 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:42,534 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:42,534 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:42,534 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:42,534 INFO L82 PathProgramCache]: Analyzing trace with hash 832257679, now seen corresponding path program 13 times [2018-10-15 15:23:42,535 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 0 proven. 494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:43,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 15:23:43,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 15:23:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 15:23:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=224, Invalid=588, Unknown=0, NotChecked=0, Total=812 [2018-10-15 15:23:43,371 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 29 states. [2018-10-15 15:23:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:44,605 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-15 15:23:44,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 15:23:44,606 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 91 [2018-10-15 15:23:44,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:44,607 INFO L225 Difference]: With dead ends: 101 [2018-10-15 15:23:44,607 INFO L226 Difference]: Without dead ends: 101 [2018-10-15 15:23:44,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=978, Invalid=1992, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:23:44,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-15 15:23:44,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2018-10-15 15:23:44,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-15 15:23:44,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-15 15:23:44,614 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 91 [2018-10-15 15:23:44,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:44,614 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-15 15:23:44,615 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 15:23:44,615 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-15 15:23:44,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-15 15:23:44,616 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:44,616 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:44,616 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:44,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:44,617 INFO L82 PathProgramCache]: Analyzing trace with hash 863474037, now seen corresponding path program 14 times [2018-10-15 15:23:44,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:44,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:45,033 INFO L134 CoverageAnalysis]: Checked inductivity of 574 backedges. 0 proven. 574 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:45,034 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:45,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 15:23:45,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 15:23:45,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 15:23:45,035 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=675, Unknown=0, NotChecked=0, Total=930 [2018-10-15 15:23:45,035 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 31 states. [2018-10-15 15:23:45,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:45,661 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-15 15:23:45,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 15:23:45,662 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 97 [2018-10-15 15:23:45,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:45,662 INFO L225 Difference]: With dead ends: 107 [2018-10-15 15:23:45,663 INFO L226 Difference]: Without dead ends: 107 [2018-10-15 15:23:45,664 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 560 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1123, Invalid=2299, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:23:45,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-15 15:23:45,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2018-10-15 15:23:45,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-15 15:23:45,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-15 15:23:45,669 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 97 [2018-10-15 15:23:45,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:45,670 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-15 15:23:45,670 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 15:23:45,670 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-15 15:23:45,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-15 15:23:45,671 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:45,671 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:45,671 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:45,671 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:45,671 INFO L82 PathProgramCache]: Analyzing trace with hash -1507352613, now seen corresponding path program 15 times [2018-10-15 15:23:45,672 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:46,083 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 0 proven. 660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:46,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:46,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 15:23:46,084 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 15:23:46,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 15:23:46,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=288, Invalid=768, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 15:23:46,085 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 33 states. [2018-10-15 15:23:46,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:46,772 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-15 15:23:46,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 15:23:46,773 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 103 [2018-10-15 15:23:46,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:46,775 INFO L225 Difference]: With dead ends: 113 [2018-10-15 15:23:46,775 INFO L226 Difference]: Without dead ends: 113 [2018-10-15 15:23:46,776 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 645 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1278, Invalid=2628, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:23:46,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-15 15:23:46,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 110. [2018-10-15 15:23:46,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 15:23:46,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 15:23:46,779 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 103 [2018-10-15 15:23:46,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:46,779 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 15:23:46,779 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 15:23:46,779 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 15:23:46,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 15:23:46,780 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:46,780 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:46,781 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:46,781 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:46,781 INFO L82 PathProgramCache]: Analyzing trace with hash -3094079, now seen corresponding path program 16 times [2018-10-15 15:23:46,782 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:46,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:47,233 INFO L134 CoverageAnalysis]: Checked inductivity of 752 backedges. 0 proven. 752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:47,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:47,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 15:23:47,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 15:23:47,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 15:23:47,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=323, Invalid=867, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 15:23:47,235 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 35 states. [2018-10-15 15:23:48,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:48,262 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 15:23:48,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 15:23:48,263 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 109 [2018-10-15 15:23:48,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:48,265 INFO L225 Difference]: With dead ends: 119 [2018-10-15 15:23:48,265 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 15:23:48,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 736 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1443, Invalid=2979, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:23:48,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 15:23:48,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 15:23:48,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 15:23:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 15:23:48,272 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 109 [2018-10-15 15:23:48,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:48,274 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 15:23:48,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 15:23:48,274 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 15:23:48,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 15:23:48,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:48,275 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:48,275 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:48,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:48,276 INFO L82 PathProgramCache]: Analyzing trace with hash 487616295, now seen corresponding path program 17 times [2018-10-15 15:23:48,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:48,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:49,690 INFO L134 CoverageAnalysis]: Checked inductivity of 850 backedges. 0 proven. 850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:49,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:49,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 15:23:49,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 15:23:49,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 15:23:49,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=360, Invalid=972, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 15:23:49,691 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 37 states. [2018-10-15 15:23:50,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:50,552 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-15 15:23:50,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 15:23:50,552 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 115 [2018-10-15 15:23:50,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:50,554 INFO L225 Difference]: With dead ends: 125 [2018-10-15 15:23:50,554 INFO L226 Difference]: Without dead ends: 125 [2018-10-15 15:23:50,556 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 833 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1618, Invalid=3352, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:23:50,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-15 15:23:50,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 122. [2018-10-15 15:23:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-15 15:23:50,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-15 15:23:50,559 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 115 [2018-10-15 15:23:50,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:50,559 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-15 15:23:50,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 15:23:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-15 15:23:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-15 15:23:50,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:50,560 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:50,560 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:50,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:50,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2030309363, now seen corresponding path program 18 times [2018-10-15 15:23:50,561 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:50,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:51,115 INFO L134 CoverageAnalysis]: Checked inductivity of 954 backedges. 0 proven. 954 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:51,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:51,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 15:23:51,116 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 15:23:51,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 15:23:51,117 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=399, Invalid=1083, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 15:23:51,117 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 39 states. [2018-10-15 15:23:52,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:52,072 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-15 15:23:52,079 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 15:23:52,079 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 121 [2018-10-15 15:23:52,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:52,080 INFO L225 Difference]: With dead ends: 131 [2018-10-15 15:23:52,080 INFO L226 Difference]: Without dead ends: 131 [2018-10-15 15:23:52,082 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1803, Invalid=3747, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:23:52,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-15 15:23:52,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 128. [2018-10-15 15:23:52,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 15:23:52,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 15:23:52,085 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 121 [2018-10-15 15:23:52,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:52,085 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 15:23:52,085 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 15:23:52,086 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 15:23:52,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 15:23:52,086 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:52,086 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:52,087 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:52,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:52,087 INFO L82 PathProgramCache]: Analyzing trace with hash 958442611, now seen corresponding path program 19 times [2018-10-15 15:23:52,088 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:52,624 INFO L134 CoverageAnalysis]: Checked inductivity of 1064 backedges. 0 proven. 1064 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:52,624 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:52,624 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 15:23:52,625 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 15:23:52,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 15:23:52,626 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=1200, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 15:23:52,626 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 41 states. [2018-10-15 15:23:54,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:54,035 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-15 15:23:54,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 15:23:54,036 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 127 [2018-10-15 15:23:54,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:54,037 INFO L225 Difference]: With dead ends: 137 [2018-10-15 15:23:54,037 INFO L226 Difference]: Without dead ends: 137 [2018-10-15 15:23:54,040 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1045 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1998, Invalid=4164, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:23:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-15 15:23:54,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 134. [2018-10-15 15:23:54,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-15 15:23:54,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-15 15:23:54,043 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 127 [2018-10-15 15:23:54,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:54,044 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-15 15:23:54,044 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 15:23:54,044 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-15 15:23:54,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-15 15:23:54,045 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:54,045 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:54,045 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:54,045 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:54,045 INFO L82 PathProgramCache]: Analyzing trace with hash -410778535, now seen corresponding path program 20 times [2018-10-15 15:23:54,046 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:54,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:54,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1180 backedges. 0 proven. 1180 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:54,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:54,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 15:23:54,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 15:23:54,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 15:23:54,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=1323, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 15:23:54,835 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 43 states. [2018-10-15 15:23:55,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:55,897 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-15 15:23:55,897 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 15:23:55,898 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 133 [2018-10-15 15:23:55,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:55,899 INFO L225 Difference]: With dead ends: 143 [2018-10-15 15:23:55,899 INFO L226 Difference]: Without dead ends: 143 [2018-10-15 15:23:55,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1160 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2203, Invalid=4603, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:23:55,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-15 15:23:55,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 140. [2018-10-15 15:23:55,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-15 15:23:55,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-15 15:23:55,906 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 133 [2018-10-15 15:23:55,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:55,906 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-15 15:23:55,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 15:23:55,906 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-15 15:23:55,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-15 15:23:55,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:55,907 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:55,908 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:55,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:55,908 INFO L82 PathProgramCache]: Analyzing trace with hash -995928129, now seen corresponding path program 21 times [2018-10-15 15:23:55,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:55,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:56,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1302 backedges. 0 proven. 1302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:56,639 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:56,640 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 15:23:56,640 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 15:23:56,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 15:23:56,641 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=1452, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 15:23:56,641 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 45 states. [2018-10-15 15:23:58,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:23:58,016 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 15:23:58,017 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 15:23:58,018 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 139 [2018-10-15 15:23:58,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:23:58,019 INFO L225 Difference]: With dead ends: 149 [2018-10-15 15:23:58,019 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 15:23:58,021 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1281 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2418, Invalid=5064, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:23:58,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 15:23:58,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 15:23:58,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 15:23:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 15:23:58,025 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 139 [2018-10-15 15:23:58,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:23:58,025 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 15:23:58,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 15:23:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 15:23:58,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 15:23:58,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:23:58,027 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:23:58,027 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:23:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:23:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash -948697435, now seen corresponding path program 22 times [2018-10-15 15:23:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:23:58,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:23:58,919 INFO L134 CoverageAnalysis]: Checked inductivity of 1430 backedges. 0 proven. 1430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:23:58,919 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:23:58,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 15:23:58,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 15:23:58,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 15:23:58,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=575, Invalid=1587, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 15:23:58,920 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 47 states. [2018-10-15 15:24:00,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:00,364 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-15 15:24:00,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 15:24:00,365 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 145 [2018-10-15 15:24:00,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:00,366 INFO L225 Difference]: With dead ends: 155 [2018-10-15 15:24:00,367 INFO L226 Difference]: Without dead ends: 155 [2018-10-15 15:24:00,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1408 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2643, Invalid=5547, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:24:00,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-15 15:24:00,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 152. [2018-10-15 15:24:00,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-15 15:24:00,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-15 15:24:00,372 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 145 [2018-10-15 15:24:00,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:00,373 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-15 15:24:00,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 15:24:00,373 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-15 15:24:00,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-15 15:24:00,373 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:00,373 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:00,374 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:00,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:00,374 INFO L82 PathProgramCache]: Analyzing trace with hash 1902342411, now seen corresponding path program 23 times [2018-10-15 15:24:00,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:01,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1564 backedges. 0 proven. 1564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:01,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:01,407 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 15:24:01,407 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 15:24:01,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 15:24:01,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=624, Invalid=1728, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 15:24:01,408 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 49 states. [2018-10-15 15:24:02,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:02,758 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-15 15:24:02,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 15:24:02,759 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 151 [2018-10-15 15:24:02,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:02,760 INFO L225 Difference]: With dead ends: 161 [2018-10-15 15:24:02,760 INFO L226 Difference]: Without dead ends: 161 [2018-10-15 15:24:02,762 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1541 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2878, Invalid=6052, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:24:02,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-15 15:24:02,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 158. [2018-10-15 15:24:02,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-15 15:24:02,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-15 15:24:02,765 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 151 [2018-10-15 15:24:02,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:02,765 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-15 15:24:02,765 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 15:24:02,765 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-15 15:24:02,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-15 15:24:02,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:02,766 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:02,767 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:02,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:02,767 INFO L82 PathProgramCache]: Analyzing trace with hash 341243633, now seen corresponding path program 24 times [2018-10-15 15:24:02,768 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:04,260 INFO L134 CoverageAnalysis]: Checked inductivity of 1704 backedges. 0 proven. 1704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:04,261 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:04,261 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 15:24:04,261 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 15:24:04,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 15:24:04,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=675, Invalid=1875, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 15:24:04,262 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 51 states. [2018-10-15 15:24:05,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:05,855 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-15 15:24:05,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 15:24:05,856 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 157 [2018-10-15 15:24:05,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:05,857 INFO L225 Difference]: With dead ends: 167 [2018-10-15 15:24:05,858 INFO L226 Difference]: Without dead ends: 167 [2018-10-15 15:24:05,859 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1680 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3123, Invalid=6579, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:24:05,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-15 15:24:05,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 164. [2018-10-15 15:24:05,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 15:24:05,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 15:24:05,863 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 157 [2018-10-15 15:24:05,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:05,863 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 15:24:05,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 15:24:05,863 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 15:24:05,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 15:24:05,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:05,864 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:05,865 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:05,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:05,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1733560233, now seen corresponding path program 25 times [2018-10-15 15:24:05,866 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1850 backedges. 0 proven. 1850 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:06,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 15:24:06,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 15:24:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 15:24:06,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=728, Invalid=2028, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 15:24:06,799 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 53 states. [2018-10-15 15:24:08,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:08,667 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-15 15:24:08,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 15:24:08,667 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 163 [2018-10-15 15:24:08,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:08,669 INFO L225 Difference]: With dead ends: 173 [2018-10-15 15:24:08,669 INFO L226 Difference]: Without dead ends: 173 [2018-10-15 15:24:08,671 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1825 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3378, Invalid=7128, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:24:08,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-15 15:24:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 170. [2018-10-15 15:24:08,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-15 15:24:08,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-15 15:24:08,675 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 163 [2018-10-15 15:24:08,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:08,675 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-15 15:24:08,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 15:24:08,676 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-15 15:24:08,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-15 15:24:08,676 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:08,677 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:08,677 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:08,677 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:08,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1019751107, now seen corresponding path program 26 times [2018-10-15 15:24:08,678 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:09,789 INFO L134 CoverageAnalysis]: Checked inductivity of 2002 backedges. 0 proven. 2002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:09,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:09,790 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 15:24:09,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 15:24:09,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 15:24:09,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=2187, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 15:24:09,791 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 55 states. [2018-10-15 15:24:11,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:11,685 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 15:24:11,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 15:24:11,685 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 169 [2018-10-15 15:24:11,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:11,687 INFO L225 Difference]: With dead ends: 179 [2018-10-15 15:24:11,687 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 15:24:11,688 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1976 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3643, Invalid=7699, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:24:11,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 15:24:11,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 15:24:11,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 15:24:11,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 15:24:11,692 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 169 [2018-10-15 15:24:11,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:11,692 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 15:24:11,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 15:24:11,693 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 15:24:11,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 15:24:11,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:11,694 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:11,694 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:11,694 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:11,694 INFO L82 PathProgramCache]: Analyzing trace with hash -79172189, now seen corresponding path program 27 times [2018-10-15 15:24:11,695 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:11,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:12,677 INFO L134 CoverageAnalysis]: Checked inductivity of 2160 backedges. 0 proven. 2160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:12,677 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:12,677 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 15:24:12,678 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 15:24:12,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 15:24:12,678 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=840, Invalid=2352, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 15:24:12,678 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 57 states. [2018-10-15 15:24:14,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:14,854 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-15 15:24:14,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 15:24:14,855 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 175 [2018-10-15 15:24:14,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:14,857 INFO L225 Difference]: With dead ends: 185 [2018-10-15 15:24:14,857 INFO L226 Difference]: Without dead ends: 185 [2018-10-15 15:24:14,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2133 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3918, Invalid=8292, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:24:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-15 15:24:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2018-10-15 15:24:14,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 15:24:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 15:24:14,862 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 175 [2018-10-15 15:24:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:14,862 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 15:24:14,862 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 15:24:14,862 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 15:24:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 15:24:14,863 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:14,863 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:14,864 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:14,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:14,864 INFO L82 PathProgramCache]: Analyzing trace with hash -1868455543, now seen corresponding path program 28 times [2018-10-15 15:24:14,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:14,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:16,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2324 backedges. 0 proven. 2324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:16,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:16,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 15:24:16,332 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 15:24:16,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 15:24:16,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=899, Invalid=2523, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 15:24:16,333 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 59 states. [2018-10-15 15:24:19,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:19,838 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-15 15:24:19,838 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 15:24:19,838 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 181 [2018-10-15 15:24:19,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:19,841 INFO L225 Difference]: With dead ends: 191 [2018-10-15 15:24:19,841 INFO L226 Difference]: Without dead ends: 191 [2018-10-15 15:24:19,842 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2296 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=4203, Invalid=8907, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:24:19,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-15 15:24:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 188. [2018-10-15 15:24:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-15 15:24:19,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-15 15:24:19,846 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 181 [2018-10-15 15:24:19,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:19,847 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-15 15:24:19,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 15:24:19,847 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-15 15:24:19,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-15 15:24:19,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:19,848 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:19,848 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:19,848 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:19,849 INFO L82 PathProgramCache]: Analyzing trace with hash -2122166033, now seen corresponding path program 29 times [2018-10-15 15:24:19,849 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:19,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:21,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2494 backedges. 0 proven. 2494 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:21,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:21,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 15:24:21,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 15:24:21,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 15:24:21,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=960, Invalid=2700, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 15:24:21,156 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 61 states. [2018-10-15 15:24:23,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:23,180 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-10-15 15:24:23,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 15:24:23,180 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 187 [2018-10-15 15:24:23,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:23,182 INFO L225 Difference]: With dead ends: 197 [2018-10-15 15:24:23,183 INFO L226 Difference]: Without dead ends: 197 [2018-10-15 15:24:23,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2465 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4498, Invalid=9544, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:24:23,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-10-15 15:24:23,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 194. [2018-10-15 15:24:23,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-15 15:24:23,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-15 15:24:23,188 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 187 [2018-10-15 15:24:23,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:23,188 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-15 15:24:23,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 15:24:23,188 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-15 15:24:23,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-15 15:24:23,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:23,189 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:23,190 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:23,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:23,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1063298091, now seen corresponding path program 30 times [2018-10-15 15:24:23,191 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:23,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:24,737 INFO L134 CoverageAnalysis]: Checked inductivity of 2670 backedges. 0 proven. 2670 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:24,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:24,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 15:24:24,738 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 15:24:24,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 15:24:24,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1023, Invalid=2883, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 15:24:24,739 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 63 states. [2018-10-15 15:24:27,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:27,080 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-10-15 15:24:27,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 15:24:27,081 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 193 [2018-10-15 15:24:27,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:27,083 INFO L225 Difference]: With dead ends: 203 [2018-10-15 15:24:27,083 INFO L226 Difference]: Without dead ends: 203 [2018-10-15 15:24:27,084 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2640 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4803, Invalid=10203, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:24:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-10-15 15:24:27,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2018-10-15 15:24:27,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 15:24:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 15:24:27,087 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 193 [2018-10-15 15:24:27,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:27,088 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 15:24:27,088 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 15:24:27,088 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 15:24:27,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 15:24:27,089 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:27,089 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:27,089 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:27,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:27,090 INFO L82 PathProgramCache]: Analyzing trace with hash -81386949, now seen corresponding path program 31 times [2018-10-15 15:24:27,090 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:27,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:28,474 INFO L134 CoverageAnalysis]: Checked inductivity of 2852 backedges. 0 proven. 2852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:28,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:28,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 15:24:28,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 15:24:28,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 15:24:28,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1088, Invalid=3072, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 15:24:28,476 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 65 states. [2018-10-15 15:24:31,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:31,239 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 15:24:31,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 15:24:31,241 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 199 [2018-10-15 15:24:31,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:31,242 INFO L225 Difference]: With dead ends: 209 [2018-10-15 15:24:31,243 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 15:24:31,244 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2821 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5118, Invalid=10884, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:24:31,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 15:24:31,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 15:24:31,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 15:24:31,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 15:24:31,247 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 199 [2018-10-15 15:24:31,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:31,248 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 15:24:31,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 15:24:31,248 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 15:24:31,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 15:24:31,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:31,249 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:31,249 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:31,250 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:31,250 INFO L82 PathProgramCache]: Analyzing trace with hash -558103519, now seen corresponding path program 32 times [2018-10-15 15:24:31,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:32,578 INFO L134 CoverageAnalysis]: Checked inductivity of 3040 backedges. 0 proven. 3040 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:32,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:32,579 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 15:24:32,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 15:24:32,580 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 15:24:32,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1155, Invalid=3267, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 15:24:32,580 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 67 states. [2018-10-15 15:24:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:35,250 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-10-15 15:24:35,251 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 15:24:35,251 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 205 [2018-10-15 15:24:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:35,253 INFO L225 Difference]: With dead ends: 215 [2018-10-15 15:24:35,253 INFO L226 Difference]: Without dead ends: 215 [2018-10-15 15:24:35,255 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3008 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5443, Invalid=11587, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:24:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-10-15 15:24:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 212. [2018-10-15 15:24:35,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 212 states. [2018-10-15 15:24:35,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 212 states to 212 states and 212 transitions. [2018-10-15 15:24:35,259 INFO L78 Accepts]: Start accepts. Automaton has 212 states and 212 transitions. Word has length 205 [2018-10-15 15:24:35,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:35,259 INFO L481 AbstractCegarLoop]: Abstraction has 212 states and 212 transitions. [2018-10-15 15:24:35,259 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 15:24:35,259 INFO L276 IsEmpty]: Start isEmpty. Operand 212 states and 212 transitions. [2018-10-15 15:24:35,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2018-10-15 15:24:35,260 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:35,260 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:35,261 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:35,261 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:35,261 INFO L82 PathProgramCache]: Analyzing trace with hash -545365625, now seen corresponding path program 33 times [2018-10-15 15:24:35,262 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:35,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:36,700 INFO L134 CoverageAnalysis]: Checked inductivity of 3234 backedges. 0 proven. 3234 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:36,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:36,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 15:24:36,701 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 15:24:36,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 15:24:36,702 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1224, Invalid=3468, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 15:24:36,702 INFO L87 Difference]: Start difference. First operand 212 states and 212 transitions. Second operand 69 states. [2018-10-15 15:24:39,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:39,535 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-10-15 15:24:39,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 15:24:39,535 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 211 [2018-10-15 15:24:39,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:39,537 INFO L225 Difference]: With dead ends: 221 [2018-10-15 15:24:39,537 INFO L226 Difference]: Without dead ends: 221 [2018-10-15 15:24:39,538 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3201 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5778, Invalid=12312, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:24:39,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-10-15 15:24:39,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 218. [2018-10-15 15:24:39,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 15:24:39,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 15:24:39,542 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 211 [2018-10-15 15:24:39,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:39,542 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 15:24:39,543 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 15:24:39,543 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 15:24:39,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 15:24:39,544 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:39,544 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:39,544 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:39,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:39,545 INFO L82 PathProgramCache]: Analyzing trace with hash 2114099821, now seen corresponding path program 34 times [2018-10-15 15:24:39,545 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:41,449 INFO L134 CoverageAnalysis]: Checked inductivity of 3434 backedges. 0 proven. 3434 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:41,449 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:41,449 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 15:24:41,449 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 15:24:41,450 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 15:24:41,450 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1295, Invalid=3675, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 15:24:41,450 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 71 states. [2018-10-15 15:24:44,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:44,137 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-10-15 15:24:44,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 15:24:44,138 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 217 [2018-10-15 15:24:44,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:44,140 INFO L225 Difference]: With dead ends: 227 [2018-10-15 15:24:44,140 INFO L226 Difference]: Without dead ends: 227 [2018-10-15 15:24:44,141 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3400 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6123, Invalid=13059, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:24:44,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-10-15 15:24:44,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 224. [2018-10-15 15:24:44,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 224 states. [2018-10-15 15:24:44,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 224 transitions. [2018-10-15 15:24:44,145 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 224 transitions. Word has length 217 [2018-10-15 15:24:44,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:44,145 INFO L481 AbstractCegarLoop]: Abstraction has 224 states and 224 transitions. [2018-10-15 15:24:44,145 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 15:24:44,146 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 224 transitions. [2018-10-15 15:24:44,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2018-10-15 15:24:44,147 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:44,147 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:44,147 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:44,147 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:44,147 INFO L82 PathProgramCache]: Analyzing trace with hash 223743699, now seen corresponding path program 35 times [2018-10-15 15:24:44,148 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:44,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 3640 backedges. 0 proven. 3640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:46,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:46,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 15:24:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 15:24:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 15:24:46,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1368, Invalid=3888, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 15:24:46,101 INFO L87 Difference]: Start difference. First operand 224 states and 224 transitions. Second operand 73 states. [2018-10-15 15:24:48,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:48,899 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-10-15 15:24:48,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 15:24:48,900 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 223 [2018-10-15 15:24:48,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:48,901 INFO L225 Difference]: With dead ends: 233 [2018-10-15 15:24:48,901 INFO L226 Difference]: Without dead ends: 233 [2018-10-15 15:24:48,903 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3605 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6478, Invalid=13828, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:24:48,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-10-15 15:24:48,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 230. [2018-10-15 15:24:48,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 230 states. [2018-10-15 15:24:48,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 230 transitions. [2018-10-15 15:24:48,906 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 230 transitions. Word has length 223 [2018-10-15 15:24:48,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:48,906 INFO L481 AbstractCegarLoop]: Abstraction has 230 states and 230 transitions. [2018-10-15 15:24:48,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 15:24:48,907 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 230 transitions. [2018-10-15 15:24:48,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2018-10-15 15:24:48,908 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:48,908 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:48,908 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:48,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:48,909 INFO L82 PathProgramCache]: Analyzing trace with hash -117563719, now seen corresponding path program 36 times [2018-10-15 15:24:48,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:48,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:52,621 INFO L134 CoverageAnalysis]: Checked inductivity of 3852 backedges. 0 proven. 3852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:52,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:52,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 15:24:52,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 15:24:52,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 15:24:52,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1443, Invalid=4107, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 15:24:52,623 INFO L87 Difference]: Start difference. First operand 230 states and 230 transitions. Second operand 75 states. [2018-10-15 15:24:55,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:24:55,702 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 15:24:55,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 15:24:55,702 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 229 [2018-10-15 15:24:55,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:24:55,704 INFO L225 Difference]: With dead ends: 239 [2018-10-15 15:24:55,704 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 15:24:55,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3816 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=6843, Invalid=14619, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:24:55,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 15:24:55,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 15:24:55,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 15:24:55,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 15:24:55,709 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 229 [2018-10-15 15:24:55,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:24:55,709 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 15:24:55,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 15:24:55,710 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 15:24:55,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 15:24:55,711 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:24:55,711 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:24:55,711 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:24:55,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:24:55,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1963447777, now seen corresponding path program 37 times [2018-10-15 15:24:55,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:24:55,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:24:58,679 INFO L134 CoverageAnalysis]: Checked inductivity of 4070 backedges. 0 proven. 4070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:24:58,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:24:58,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 15:24:58,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 15:24:58,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 15:24:58,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1520, Invalid=4332, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 15:24:58,681 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 77 states. [2018-10-15 15:25:01,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:01,945 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-10-15 15:25:01,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 15:25:01,945 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 235 [2018-10-15 15:25:01,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:01,946 INFO L225 Difference]: With dead ends: 245 [2018-10-15 15:25:01,946 INFO L226 Difference]: Without dead ends: 245 [2018-10-15 15:25:01,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4033 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7218, Invalid=15432, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:25:01,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-10-15 15:25:01,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 242. [2018-10-15 15:25:01,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 242 states. [2018-10-15 15:25:01,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 242 transitions. [2018-10-15 15:25:01,950 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 242 transitions. Word has length 235 [2018-10-15 15:25:01,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:01,950 INFO L481 AbstractCegarLoop]: Abstraction has 242 states and 242 transitions. [2018-10-15 15:25:01,950 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 15:25:01,950 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 242 transitions. [2018-10-15 15:25:01,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2018-10-15 15:25:01,951 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:01,951 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:01,952 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:01,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:01,952 INFO L82 PathProgramCache]: Analyzing trace with hash 834244869, now seen corresponding path program 38 times [2018-10-15 15:25:01,952 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:03,816 INFO L134 CoverageAnalysis]: Checked inductivity of 4294 backedges. 0 proven. 4294 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:03,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:03,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 15:25:03,817 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 15:25:03,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 15:25:03,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=4563, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 15:25:03,819 INFO L87 Difference]: Start difference. First operand 242 states and 242 transitions. Second operand 79 states. [2018-10-15 15:25:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:07,207 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-10-15 15:25:07,207 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 15:25:07,207 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 241 [2018-10-15 15:25:07,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:07,209 INFO L225 Difference]: With dead ends: 251 [2018-10-15 15:25:07,209 INFO L226 Difference]: Without dead ends: 251 [2018-10-15 15:25:07,211 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4256 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=7603, Invalid=16267, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 15:25:07,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-10-15 15:25:07,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 248. [2018-10-15 15:25:07,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 248 states. [2018-10-15 15:25:07,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 248 transitions. [2018-10-15 15:25:07,214 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 248 transitions. Word has length 241 [2018-10-15 15:25:07,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:07,214 INFO L481 AbstractCegarLoop]: Abstraction has 248 states and 248 transitions. [2018-10-15 15:25:07,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 15:25:07,214 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 248 transitions. [2018-10-15 15:25:07,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2018-10-15 15:25:07,216 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:07,216 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:07,216 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:07,216 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:07,216 INFO L82 PathProgramCache]: Analyzing trace with hash 1177531243, now seen corresponding path program 39 times [2018-10-15 15:25:07,217 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:07,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:10,129 INFO L134 CoverageAnalysis]: Checked inductivity of 4524 backedges. 0 proven. 4524 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:10,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:10,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 15:25:10,130 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 15:25:10,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 15:25:10,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1680, Invalid=4800, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 15:25:10,132 INFO L87 Difference]: Start difference. First operand 248 states and 248 transitions. Second operand 81 states. [2018-10-15 15:25:13,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:13,359 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-10-15 15:25:13,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 15:25:13,360 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 247 [2018-10-15 15:25:13,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:13,362 INFO L225 Difference]: With dead ends: 257 [2018-10-15 15:25:13,362 INFO L226 Difference]: Without dead ends: 257 [2018-10-15 15:25:13,364 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4485 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7998, Invalid=17124, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 15:25:13,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-10-15 15:25:13,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 254. [2018-10-15 15:25:13,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 15:25:13,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 15:25:13,367 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 247 [2018-10-15 15:25:13,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:13,368 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 15:25:13,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 15:25:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 15:25:13,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 15:25:13,369 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:13,369 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:13,370 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:13,370 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:13,370 INFO L82 PathProgramCache]: Analyzing trace with hash 1371533649, now seen corresponding path program 40 times [2018-10-15 15:25:13,370 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:13,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:16,008 INFO L134 CoverageAnalysis]: Checked inductivity of 4760 backedges. 0 proven. 4760 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:16,008 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:16,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 15:25:16,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 15:25:16,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 15:25:16,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1763, Invalid=5043, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 15:25:16,010 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 83 states. [2018-10-15 15:25:19,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:19,535 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-10-15 15:25:19,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 15:25:19,536 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 253 [2018-10-15 15:25:19,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:19,538 INFO L225 Difference]: With dead ends: 263 [2018-10-15 15:25:19,538 INFO L226 Difference]: Without dead ends: 263 [2018-10-15 15:25:19,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4720 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8403, Invalid=18003, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 15:25:19,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-10-15 15:25:19,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 260. [2018-10-15 15:25:19,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2018-10-15 15:25:19,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2018-10-15 15:25:19,544 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 253 [2018-10-15 15:25:19,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:19,544 INFO L481 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2018-10-15 15:25:19,544 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 15:25:19,544 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2018-10-15 15:25:19,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2018-10-15 15:25:19,545 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:19,546 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:19,546 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:19,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:19,546 INFO L82 PathProgramCache]: Analyzing trace with hash -733500745, now seen corresponding path program 41 times [2018-10-15 15:25:19,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 5002 backedges. 0 proven. 5002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:21,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:21,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 15:25:21,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 15:25:21,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 15:25:21,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1848, Invalid=5292, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 15:25:21,922 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 85 states. [2018-10-15 15:25:25,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:25,746 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 15:25:25,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 15:25:25,746 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 259 [2018-10-15 15:25:25,747 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:25,748 INFO L225 Difference]: With dead ends: 269 [2018-10-15 15:25:25,748 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 15:25:25,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4961 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8818, Invalid=18904, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 15:25:25,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 15:25:25,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 15:25:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 15:25:25,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 15:25:25,753 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 259 [2018-10-15 15:25:25,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:25,753 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 15:25:25,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 15:25:25,753 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 15:25:25,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 15:25:25,754 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:25,754 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:25,754 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:25,755 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:25,755 INFO L82 PathProgramCache]: Analyzing trace with hash -1977860195, now seen corresponding path program 42 times [2018-10-15 15:25:25,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:25,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:27,956 INFO L134 CoverageAnalysis]: Checked inductivity of 5250 backedges. 0 proven. 5250 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:27,956 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:27,956 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 15:25:27,957 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 15:25:27,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 15:25:27,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1935, Invalid=5547, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 15:25:27,958 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 87 states. [2018-10-15 15:25:32,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:32,138 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-10-15 15:25:32,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 15:25:32,139 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 265 [2018-10-15 15:25:32,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:32,141 INFO L225 Difference]: With dead ends: 275 [2018-10-15 15:25:32,141 INFO L226 Difference]: Without dead ends: 275 [2018-10-15 15:25:32,142 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5208 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9243, Invalid=19827, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 15:25:32,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-10-15 15:25:32,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 272. [2018-10-15 15:25:32,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 15:25:32,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 15:25:32,146 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 265 [2018-10-15 15:25:32,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:32,146 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 15:25:32,146 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 15:25:32,147 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 15:25:32,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 15:25:32,148 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:32,148 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:32,148 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:32,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:32,149 INFO L82 PathProgramCache]: Analyzing trace with hash 839585795, now seen corresponding path program 43 times [2018-10-15 15:25:32,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 5504 backedges. 0 proven. 5504 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:34,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:34,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 15:25:34,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 15:25:34,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 15:25:34,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2024, Invalid=5808, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 15:25:34,389 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 89 states. [2018-10-15 15:25:38,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:38,444 INFO L93 Difference]: Finished difference Result 281 states and 281 transitions. [2018-10-15 15:25:38,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 15:25:38,445 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 271 [2018-10-15 15:25:38,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:38,446 INFO L225 Difference]: With dead ends: 281 [2018-10-15 15:25:38,446 INFO L226 Difference]: Without dead ends: 281 [2018-10-15 15:25:38,448 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5461 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=9678, Invalid=20772, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 15:25:38,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 281 states. [2018-10-15 15:25:38,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 281 to 278. [2018-10-15 15:25:38,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 278 states. [2018-10-15 15:25:38,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 278 transitions. [2018-10-15 15:25:38,452 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 278 transitions. Word has length 271 [2018-10-15 15:25:38,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:38,452 INFO L481 AbstractCegarLoop]: Abstraction has 278 states and 278 transitions. [2018-10-15 15:25:38,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 15:25:38,452 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 278 transitions. [2018-10-15 15:25:38,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2018-10-15 15:25:38,454 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:38,454 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:38,454 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:38,454 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:38,454 INFO L82 PathProgramCache]: Analyzing trace with hash -749110295, now seen corresponding path program 44 times [2018-10-15 15:25:38,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:41,068 INFO L134 CoverageAnalysis]: Checked inductivity of 5764 backedges. 0 proven. 5764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:41,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:41,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 15:25:41,069 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 15:25:41,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 15:25:41,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2115, Invalid=6075, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 15:25:41,070 INFO L87 Difference]: Start difference. First operand 278 states and 278 transitions. Second operand 91 states. [2018-10-15 15:25:45,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:45,193 INFO L93 Difference]: Finished difference Result 287 states and 287 transitions. [2018-10-15 15:25:45,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 15:25:45,193 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 277 [2018-10-15 15:25:45,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:45,194 INFO L225 Difference]: With dead ends: 287 [2018-10-15 15:25:45,194 INFO L226 Difference]: Without dead ends: 287 [2018-10-15 15:25:45,195 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5720 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=10123, Invalid=21739, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 15:25:45,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2018-10-15 15:25:45,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 284. [2018-10-15 15:25:45,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 284 states. [2018-10-15 15:25:45,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 284 states to 284 states and 284 transitions. [2018-10-15 15:25:45,198 INFO L78 Accepts]: Start accepts. Automaton has 284 states and 284 transitions. Word has length 277 [2018-10-15 15:25:45,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:45,199 INFO L481 AbstractCegarLoop]: Abstraction has 284 states and 284 transitions. [2018-10-15 15:25:45,199 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 15:25:45,199 INFO L276 IsEmpty]: Start isEmpty. Operand 284 states and 284 transitions. [2018-10-15 15:25:45,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2018-10-15 15:25:45,200 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:45,200 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:45,201 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:45,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:45,201 INFO L82 PathProgramCache]: Analyzing trace with hash -2084248753, now seen corresponding path program 45 times [2018-10-15 15:25:45,202 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:45,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:47,855 INFO L134 CoverageAnalysis]: Checked inductivity of 6030 backedges. 0 proven. 6030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:47,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:47,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 15:25:47,856 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 15:25:47,857 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 15:25:47,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2208, Invalid=6348, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 15:25:47,857 INFO L87 Difference]: Start difference. First operand 284 states and 284 transitions. Second operand 93 states. [2018-10-15 15:25:52,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:52,381 INFO L93 Difference]: Finished difference Result 293 states and 293 transitions. [2018-10-15 15:25:52,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 15:25:52,382 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 283 [2018-10-15 15:25:52,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:52,384 INFO L225 Difference]: With dead ends: 293 [2018-10-15 15:25:52,384 INFO L226 Difference]: Without dead ends: 293 [2018-10-15 15:25:52,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5985 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=10578, Invalid=22728, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 15:25:52,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 293 states. [2018-10-15 15:25:52,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 293 to 290. [2018-10-15 15:25:52,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 15:25:52,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 15:25:52,389 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 283 [2018-10-15 15:25:52,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:52,389 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 15:25:52,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 15:25:52,390 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 15:25:52,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 15:25:52,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:52,391 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:52,391 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:52,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:52,391 INFO L82 PathProgramCache]: Analyzing trace with hash -1383946699, now seen corresponding path program 46 times [2018-10-15 15:25:52,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:52,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:25:55,179 INFO L134 CoverageAnalysis]: Checked inductivity of 6302 backedges. 0 proven. 6302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:25:55,179 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:25:55,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 15:25:55,180 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 15:25:55,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 15:25:55,181 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2303, Invalid=6627, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 15:25:55,181 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 95 states. [2018-10-15 15:25:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:25:59,917 INFO L93 Difference]: Finished difference Result 299 states and 299 transitions. [2018-10-15 15:25:59,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 15:25:59,918 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 289 [2018-10-15 15:25:59,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:25:59,919 INFO L225 Difference]: With dead ends: 299 [2018-10-15 15:25:59,919 INFO L226 Difference]: Without dead ends: 299 [2018-10-15 15:25:59,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6256 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=11043, Invalid=23739, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 15:25:59,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2018-10-15 15:25:59,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 296. [2018-10-15 15:25:59,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 296 states. [2018-10-15 15:25:59,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 296 states to 296 states and 296 transitions. [2018-10-15 15:25:59,924 INFO L78 Accepts]: Start accepts. Automaton has 296 states and 296 transitions. Word has length 289 [2018-10-15 15:25:59,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:25:59,924 INFO L481 AbstractCegarLoop]: Abstraction has 296 states and 296 transitions. [2018-10-15 15:25:59,924 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 15:25:59,925 INFO L276 IsEmpty]: Start isEmpty. Operand 296 states and 296 transitions. [2018-10-15 15:25:59,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2018-10-15 15:25:59,926 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:25:59,926 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:25:59,926 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:25:59,927 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:25:59,927 INFO L82 PathProgramCache]: Analyzing trace with hash -717216613, now seen corresponding path program 47 times [2018-10-15 15:25:59,927 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:25:59,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:02,936 INFO L134 CoverageAnalysis]: Checked inductivity of 6580 backedges. 0 proven. 6580 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:02,937 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:02,937 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 15:26:02,937 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 15:26:02,938 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 15:26:02,938 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2400, Invalid=6912, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 15:26:02,939 INFO L87 Difference]: Start difference. First operand 296 states and 296 transitions. Second operand 97 states. [2018-10-15 15:26:08,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:08,269 INFO L93 Difference]: Finished difference Result 305 states and 305 transitions. [2018-10-15 15:26:08,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 15:26:08,269 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 295 [2018-10-15 15:26:08,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:08,270 INFO L225 Difference]: With dead ends: 305 [2018-10-15 15:26:08,270 INFO L226 Difference]: Without dead ends: 305 [2018-10-15 15:26:08,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6533 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11518, Invalid=24772, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:26:08,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2018-10-15 15:26:08,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2018-10-15 15:26:08,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 302 states. [2018-10-15 15:26:08,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 302 transitions. [2018-10-15 15:26:08,276 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 302 transitions. Word has length 295 [2018-10-15 15:26:08,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:08,277 INFO L481 AbstractCegarLoop]: Abstraction has 302 states and 302 transitions. [2018-10-15 15:26:08,277 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:26:08,277 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 302 transitions. [2018-10-15 15:26:08,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2018-10-15 15:26:08,278 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:08,279 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:08,279 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:08,279 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:08,279 INFO L82 PathProgramCache]: Analyzing trace with hash -534593919, now seen corresponding path program 48 times [2018-10-15 15:26:08,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:08,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 6864 backedges. 0 proven. 6864 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:11,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:11,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:26:11,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:26:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:26:11,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2499, Invalid=7203, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:26:11,186 INFO L87 Difference]: Start difference. First operand 302 states and 302 transitions. Second operand 99 states. [2018-10-15 15:26:16,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:16,178 INFO L93 Difference]: Finished difference Result 311 states and 311 transitions. [2018-10-15 15:26:16,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 15:26:16,179 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 301 [2018-10-15 15:26:16,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:16,181 INFO L225 Difference]: With dead ends: 311 [2018-10-15 15:26:16,181 INFO L226 Difference]: Without dead ends: 311 [2018-10-15 15:26:16,183 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6816 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=12003, Invalid=25827, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:26:16,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2018-10-15 15:26:16,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 308. [2018-10-15 15:26:16,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 15:26:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-15 15:26:16,186 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 301 [2018-10-15 15:26:16,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:16,187 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-15 15:26:16,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:26:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-15 15:26:16,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 15:26:16,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:16,188 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:16,188 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:16,188 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:16,189 INFO L82 PathProgramCache]: Analyzing trace with hash -641215513, now seen corresponding path program 49 times [2018-10-15 15:26:16,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:16,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7154 backedges. 0 proven. 7154 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:19,100 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:19,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:26:19,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:26:19,101 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:26:19,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2600, Invalid=7500, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:26:19,101 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 101 states. [2018-10-15 15:26:24,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:24,426 INFO L93 Difference]: Finished difference Result 317 states and 317 transitions. [2018-10-15 15:26:24,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 15:26:24,427 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 307 [2018-10-15 15:26:24,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:24,428 INFO L225 Difference]: With dead ends: 317 [2018-10-15 15:26:24,428 INFO L226 Difference]: Without dead ends: 317 [2018-10-15 15:26:24,429 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7105 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=12498, Invalid=26904, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:26:24,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2018-10-15 15:26:24,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 314. [2018-10-15 15:26:24,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 314 states. [2018-10-15 15:26:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 314 states to 314 states and 314 transitions. [2018-10-15 15:26:24,433 INFO L78 Accepts]: Start accepts. Automaton has 314 states and 314 transitions. Word has length 307 [2018-10-15 15:26:24,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:24,434 INFO L481 AbstractCegarLoop]: Abstraction has 314 states and 314 transitions. [2018-10-15 15:26:24,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:26:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 314 states and 314 transitions. [2018-10-15 15:26:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 314 [2018-10-15 15:26:24,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:24,436 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:24,436 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:24,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:24,436 INFO L82 PathProgramCache]: Analyzing trace with hash 977585357, now seen corresponding path program 50 times [2018-10-15 15:26:24,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:28,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7450 backedges. 0 proven. 7450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:28,043 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:28,043 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:26:28,043 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:26:28,044 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:26:28,044 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2703, Invalid=7803, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:26:28,045 INFO L87 Difference]: Start difference. First operand 314 states and 314 transitions. Second operand 103 states. [2018-10-15 15:26:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:33,590 INFO L93 Difference]: Finished difference Result 323 states and 323 transitions. [2018-10-15 15:26:33,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 15:26:33,590 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 313 [2018-10-15 15:26:33,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:33,592 INFO L225 Difference]: With dead ends: 323 [2018-10-15 15:26:33,592 INFO L226 Difference]: Without dead ends: 323 [2018-10-15 15:26:33,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7400 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13003, Invalid=28003, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:26:33,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2018-10-15 15:26:33,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 320. [2018-10-15 15:26:33,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 320 states. [2018-10-15 15:26:33,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 320 states and 320 transitions. [2018-10-15 15:26:33,598 INFO L78 Accepts]: Start accepts. Automaton has 320 states and 320 transitions. Word has length 313 [2018-10-15 15:26:33,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:33,598 INFO L481 AbstractCegarLoop]: Abstraction has 320 states and 320 transitions. [2018-10-15 15:26:33,598 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:26:33,598 INFO L276 IsEmpty]: Start isEmpty. Operand 320 states and 320 transitions. [2018-10-15 15:26:33,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 320 [2018-10-15 15:26:33,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:33,600 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:33,600 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:33,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:33,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1406734029, now seen corresponding path program 51 times [2018-10-15 15:26:33,601 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:33,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:37,293 INFO L134 CoverageAnalysis]: Checked inductivity of 7752 backedges. 0 proven. 7752 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:37,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:37,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:26:37,294 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:26:37,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:26:37,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2808, Invalid=8112, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:26:37,295 INFO L87 Difference]: Start difference. First operand 320 states and 320 transitions. Second operand 105 states. [2018-10-15 15:26:42,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:42,785 INFO L93 Difference]: Finished difference Result 329 states and 329 transitions. [2018-10-15 15:26:42,785 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 156 states. [2018-10-15 15:26:42,785 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 319 [2018-10-15 15:26:42,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:42,786 INFO L225 Difference]: With dead ends: 329 [2018-10-15 15:26:42,786 INFO L226 Difference]: Without dead ends: 329 [2018-10-15 15:26:42,788 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7701 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13518, Invalid=29124, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:26:42,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states. [2018-10-15 15:26:42,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 326. [2018-10-15 15:26:42,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 15:26:42,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 15:26:42,792 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 319 [2018-10-15 15:26:42,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:42,793 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 15:26:42,793 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:26:42,793 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 15:26:42,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 15:26:42,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:42,795 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:42,795 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:42,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1383315737, now seen corresponding path program 52 times [2018-10-15 15:26:42,796 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:42,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:46,064 INFO L134 CoverageAnalysis]: Checked inductivity of 8060 backedges. 0 proven. 8060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:46,065 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:46,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:26:46,065 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:26:46,065 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:26:46,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2915, Invalid=8427, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:26:46,066 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 107 states. [2018-10-15 15:26:52,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:26:52,022 INFO L93 Difference]: Finished difference Result 335 states and 335 transitions. [2018-10-15 15:26:52,022 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 159 states. [2018-10-15 15:26:52,022 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 325 [2018-10-15 15:26:52,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:26:52,024 INFO L225 Difference]: With dead ends: 335 [2018-10-15 15:26:52,024 INFO L226 Difference]: Without dead ends: 335 [2018-10-15 15:26:52,026 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8008 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=14043, Invalid=30267, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:26:52,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 335 states. [2018-10-15 15:26:52,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 335 to 332. [2018-10-15 15:26:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 332 states. [2018-10-15 15:26:52,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 332 transitions. [2018-10-15 15:26:52,029 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 332 transitions. Word has length 325 [2018-10-15 15:26:52,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:26:52,030 INFO L481 AbstractCegarLoop]: Abstraction has 332 states and 332 transitions. [2018-10-15 15:26:52,030 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:26:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 332 transitions. [2018-10-15 15:26:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2018-10-15 15:26:52,031 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:26:52,032 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:26:52,032 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:26:52,032 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:26:52,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1901560705, now seen corresponding path program 53 times [2018-10-15 15:26:52,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:26:52,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:26:55,397 INFO L134 CoverageAnalysis]: Checked inductivity of 8374 backedges. 0 proven. 8374 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:26:55,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:26:55,398 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:26:55,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:26:55,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:26:55,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3024, Invalid=8748, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:26:55,399 INFO L87 Difference]: Start difference. First operand 332 states and 332 transitions. Second operand 109 states. [2018-10-15 15:27:01,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:01,538 INFO L93 Difference]: Finished difference Result 341 states and 341 transitions. [2018-10-15 15:27:01,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 162 states. [2018-10-15 15:27:01,538 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 331 [2018-10-15 15:27:01,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:01,540 INFO L225 Difference]: With dead ends: 341 [2018-10-15 15:27:01,540 INFO L226 Difference]: Without dead ends: 341 [2018-10-15 15:27:01,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8321 ImplicationChecksByTransitivity, 8.6s TimeCoverageRelationStatistics Valid=14578, Invalid=31432, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 15:27:01,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 341 states. [2018-10-15 15:27:01,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 341 to 338. [2018-10-15 15:27:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 338 states. [2018-10-15 15:27:01,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 338 states to 338 states and 338 transitions. [2018-10-15 15:27:01,545 INFO L78 Accepts]: Start accepts. Automaton has 338 states and 338 transitions. Word has length 331 [2018-10-15 15:27:01,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:01,546 INFO L481 AbstractCegarLoop]: Abstraction has 338 states and 338 transitions. [2018-10-15 15:27:01,546 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:27:01,546 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 338 transitions. [2018-10-15 15:27:01,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 338 [2018-10-15 15:27:01,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:01,548 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:01,548 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:01,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:01,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1186634597, now seen corresponding path program 54 times [2018-10-15 15:27:01,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:05,218 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 8694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:05,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:05,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:27:05,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:27:05,220 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:27:05,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3135, Invalid=9075, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:27:05,220 INFO L87 Difference]: Start difference. First operand 338 states and 338 transitions. Second operand 111 states. [2018-10-15 15:27:11,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:11,541 INFO L93 Difference]: Finished difference Result 347 states and 347 transitions. [2018-10-15 15:27:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 165 states. [2018-10-15 15:27:11,542 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 337 [2018-10-15 15:27:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:11,543 INFO L225 Difference]: With dead ends: 347 [2018-10-15 15:27:11,543 INFO L226 Difference]: Without dead ends: 347 [2018-10-15 15:27:11,544 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8640 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15123, Invalid=32619, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:27:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2018-10-15 15:27:11,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 344. [2018-10-15 15:27:11,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 15:27:11,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-15 15:27:11,548 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 337 [2018-10-15 15:27:11,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:11,548 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-15 15:27:11,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:27:11,549 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-15 15:27:11,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-15 15:27:11,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:11,551 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:11,551 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:11,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:11,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1424525877, now seen corresponding path program 55 times [2018-10-15 15:27:11,552 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:11,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:15,391 INFO L134 CoverageAnalysis]: Checked inductivity of 9020 backedges. 0 proven. 9020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:15,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:15,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:27:15,391 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:27:15,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:27:15,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3248, Invalid=9408, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:27:15,392 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 113 states. [2018-10-15 15:27:21,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:21,897 INFO L93 Difference]: Finished difference Result 353 states and 353 transitions. [2018-10-15 15:27:21,898 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 168 states. [2018-10-15 15:27:21,898 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 343 [2018-10-15 15:27:21,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:21,899 INFO L225 Difference]: With dead ends: 353 [2018-10-15 15:27:21,899 INFO L226 Difference]: Without dead ends: 353 [2018-10-15 15:27:21,900 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8965 ImplicationChecksByTransitivity, 9.4s TimeCoverageRelationStatistics Valid=15678, Invalid=33828, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:27:21,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 353 states. [2018-10-15 15:27:21,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 353 to 350. [2018-10-15 15:27:21,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 350 states. [2018-10-15 15:27:21,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 350 states to 350 states and 350 transitions. [2018-10-15 15:27:21,903 INFO L78 Accepts]: Start accepts. Automaton has 350 states and 350 transitions. Word has length 343 [2018-10-15 15:27:21,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:21,903 INFO L481 AbstractCegarLoop]: Abstraction has 350 states and 350 transitions. [2018-10-15 15:27:21,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:27:21,903 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 350 transitions. [2018-10-15 15:27:21,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2018-10-15 15:27:21,905 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:21,905 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:21,905 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:21,905 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:21,905 INFO L82 PathProgramCache]: Analyzing trace with hash 2091150257, now seen corresponding path program 56 times [2018-10-15 15:27:21,906 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:25,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9352 backedges. 0 proven. 9352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:25,834 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:25,835 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:27:25,835 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:27:25,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:27:25,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3363, Invalid=9747, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:27:25,836 INFO L87 Difference]: Start difference. First operand 350 states and 350 transitions. Second operand 115 states. [2018-10-15 15:27:32,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:32,696 INFO L93 Difference]: Finished difference Result 359 states and 359 transitions. [2018-10-15 15:27:32,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 171 states. [2018-10-15 15:27:32,696 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 349 [2018-10-15 15:27:32,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:32,698 INFO L225 Difference]: With dead ends: 359 [2018-10-15 15:27:32,698 INFO L226 Difference]: Without dead ends: 359 [2018-10-15 15:27:32,699 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9296 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16243, Invalid=35059, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:27:32,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2018-10-15 15:27:32,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2018-10-15 15:27:32,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 356 states. [2018-10-15 15:27:32,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 356 transitions. [2018-10-15 15:27:32,702 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 356 transitions. Word has length 349 [2018-10-15 15:27:32,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:32,702 INFO L481 AbstractCegarLoop]: Abstraction has 356 states and 356 transitions. [2018-10-15 15:27:32,702 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:27:32,702 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 356 transitions. [2018-10-15 15:27:32,704 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 356 [2018-10-15 15:27:32,704 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:32,704 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:32,704 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:32,704 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:32,705 INFO L82 PathProgramCache]: Analyzing trace with hash -759243497, now seen corresponding path program 57 times [2018-10-15 15:27:32,705 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:36,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9690 backedges. 0 proven. 9690 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:36,769 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:36,769 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:27:36,770 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:27:36,770 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:27:36,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3480, Invalid=10092, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:27:36,771 INFO L87 Difference]: Start difference. First operand 356 states and 356 transitions. Second operand 117 states. [2018-10-15 15:27:43,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:43,751 INFO L93 Difference]: Finished difference Result 365 states and 365 transitions. [2018-10-15 15:27:43,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 174 states. [2018-10-15 15:27:43,751 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 355 [2018-10-15 15:27:43,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:43,753 INFO L225 Difference]: With dead ends: 365 [2018-10-15 15:27:43,753 INFO L226 Difference]: Without dead ends: 365 [2018-10-15 15:27:43,756 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9633 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=16818, Invalid=36312, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:27:43,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2018-10-15 15:27:43,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 362. [2018-10-15 15:27:43,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-15 15:27:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-15 15:27:43,758 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 355 [2018-10-15 15:27:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:43,759 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-15 15:27:43,759 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:27:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-15 15:27:43,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-15 15:27:43,761 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:43,761 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:43,761 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:43,761 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:43,762 INFO L82 PathProgramCache]: Analyzing trace with hash 1631332861, now seen corresponding path program 58 times [2018-10-15 15:27:43,762 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:47,808 INFO L134 CoverageAnalysis]: Checked inductivity of 10034 backedges. 0 proven. 10034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:47,809 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:47,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:27:47,809 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:27:47,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:27:47,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3599, Invalid=10443, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:27:47,810 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 119 states. [2018-10-15 15:27:55,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:27:55,127 INFO L93 Difference]: Finished difference Result 371 states and 371 transitions. [2018-10-15 15:27:55,128 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 177 states. [2018-10-15 15:27:55,128 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 361 [2018-10-15 15:27:55,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:27:55,129 INFO L225 Difference]: With dead ends: 371 [2018-10-15 15:27:55,129 INFO L226 Difference]: Without dead ends: 371 [2018-10-15 15:27:55,131 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9976 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=17403, Invalid=37587, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:27:55,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 371 states. [2018-10-15 15:27:55,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 371 to 368. [2018-10-15 15:27:55,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 368 states. [2018-10-15 15:27:55,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 368 transitions. [2018-10-15 15:27:55,134 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 368 transitions. Word has length 361 [2018-10-15 15:27:55,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:27:55,134 INFO L481 AbstractCegarLoop]: Abstraction has 368 states and 368 transitions. [2018-10-15 15:27:55,134 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:27:55,134 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 368 transitions. [2018-10-15 15:27:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2018-10-15 15:27:55,135 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:27:55,136 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:27:55,136 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:27:55,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:27:55,136 INFO L82 PathProgramCache]: Analyzing trace with hash 1047114339, now seen corresponding path program 59 times [2018-10-15 15:27:55,137 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:27:55,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:27:59,437 INFO L134 CoverageAnalysis]: Checked inductivity of 10384 backedges. 0 proven. 10384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:27:59,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:27:59,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:27:59,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:27:59,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:27:59,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3720, Invalid=10800, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:27:59,439 INFO L87 Difference]: Start difference. First operand 368 states and 368 transitions. Second operand 121 states. [2018-10-15 15:28:07,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:07,003 INFO L93 Difference]: Finished difference Result 377 states and 377 transitions. [2018-10-15 15:28:07,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 180 states. [2018-10-15 15:28:07,003 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 367 [2018-10-15 15:28:07,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:07,005 INFO L225 Difference]: With dead ends: 377 [2018-10-15 15:28:07,005 INFO L226 Difference]: Without dead ends: 377 [2018-10-15 15:28:07,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10325 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=17998, Invalid=38884, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:28:07,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2018-10-15 15:28:07,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 374. [2018-10-15 15:28:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 374 states. [2018-10-15 15:28:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 374 states to 374 states and 374 transitions. [2018-10-15 15:28:07,010 INFO L78 Accepts]: Start accepts. Automaton has 374 states and 374 transitions. Word has length 367 [2018-10-15 15:28:07,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:07,010 INFO L481 AbstractCegarLoop]: Abstraction has 374 states and 374 transitions. [2018-10-15 15:28:07,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:28:07,010 INFO L276 IsEmpty]: Start isEmpty. Operand 374 states and 374 transitions. [2018-10-15 15:28:07,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2018-10-15 15:28:07,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:07,012 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:07,013 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:07,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:07,013 INFO L82 PathProgramCache]: Analyzing trace with hash 688707145, now seen corresponding path program 60 times [2018-10-15 15:28:07,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:07,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:11,411 INFO L134 CoverageAnalysis]: Checked inductivity of 10740 backedges. 0 proven. 10740 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:11,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:11,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:28:11,412 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:28:11,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:28:11,414 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3843, Invalid=11163, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:28:11,414 INFO L87 Difference]: Start difference. First operand 374 states and 374 transitions. Second operand 123 states. [2018-10-15 15:28:19,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:19,118 INFO L93 Difference]: Finished difference Result 383 states and 383 transitions. [2018-10-15 15:28:19,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 183 states. [2018-10-15 15:28:19,118 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 373 [2018-10-15 15:28:19,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:19,119 INFO L225 Difference]: With dead ends: 383 [2018-10-15 15:28:19,120 INFO L226 Difference]: Without dead ends: 383 [2018-10-15 15:28:19,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10680 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=18603, Invalid=40203, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:28:19,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2018-10-15 15:28:19,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2018-10-15 15:28:19,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 15:28:19,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 15:28:19,125 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 373 [2018-10-15 15:28:19,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:19,125 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 15:28:19,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:28:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 15:28:19,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 15:28:19,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:19,128 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:19,128 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:19,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:19,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1315108271, now seen corresponding path program 61 times [2018-10-15 15:28:19,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:23,555 INFO L134 CoverageAnalysis]: Checked inductivity of 11102 backedges. 0 proven. 11102 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:23,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:23,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:28:23,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:28:23,556 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:28:23,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3968, Invalid=11532, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:28:23,557 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 125 states. [2018-10-15 15:28:31,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:31,518 INFO L93 Difference]: Finished difference Result 389 states and 389 transitions. [2018-10-15 15:28:31,519 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 186 states. [2018-10-15 15:28:31,519 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 379 [2018-10-15 15:28:31,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:31,520 INFO L225 Difference]: With dead ends: 389 [2018-10-15 15:28:31,520 INFO L226 Difference]: Without dead ends: 389 [2018-10-15 15:28:31,522 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11041 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19218, Invalid=41544, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 15:28:31,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2018-10-15 15:28:31,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 386. [2018-10-15 15:28:31,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 386 states. [2018-10-15 15:28:31,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 386 states and 386 transitions. [2018-10-15 15:28:31,526 INFO L78 Accepts]: Start accepts. Automaton has 386 states and 386 transitions. Word has length 379 [2018-10-15 15:28:31,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:31,526 INFO L481 AbstractCegarLoop]: Abstraction has 386 states and 386 transitions. [2018-10-15 15:28:31,526 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:28:31,526 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 386 transitions. [2018-10-15 15:28:31,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 386 [2018-10-15 15:28:31,527 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:31,528 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:31,528 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:31,528 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:31,528 INFO L82 PathProgramCache]: Analyzing trace with hash -1876856683, now seen corresponding path program 62 times [2018-10-15 15:28:31,529 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:31,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:36,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11470 backedges. 0 proven. 11470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:36,205 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:36,205 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:28:36,205 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:28:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:28:36,207 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=11907, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:28:36,207 INFO L87 Difference]: Start difference. First operand 386 states and 386 transitions. Second operand 127 states. [2018-10-15 15:28:44,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:44,366 INFO L93 Difference]: Finished difference Result 395 states and 395 transitions. [2018-10-15 15:28:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 189 states. [2018-10-15 15:28:44,366 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 385 [2018-10-15 15:28:44,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:44,368 INFO L225 Difference]: With dead ends: 395 [2018-10-15 15:28:44,368 INFO L226 Difference]: Without dead ends: 395 [2018-10-15 15:28:44,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11408 ImplicationChecksByTransitivity, 11.8s TimeCoverageRelationStatistics Valid=19843, Invalid=42907, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:28:44,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2018-10-15 15:28:44,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 392. [2018-10-15 15:28:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 392 states. [2018-10-15 15:28:44,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 392 states and 392 transitions. [2018-10-15 15:28:44,372 INFO L78 Accepts]: Start accepts. Automaton has 392 states and 392 transitions. Word has length 385 [2018-10-15 15:28:44,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:44,372 INFO L481 AbstractCegarLoop]: Abstraction has 392 states and 392 transitions. [2018-10-15 15:28:44,372 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:28:44,372 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 392 transitions. [2018-10-15 15:28:44,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2018-10-15 15:28:44,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:44,374 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:44,374 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:44,374 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:44,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1249224443, now seen corresponding path program 63 times [2018-10-15 15:28:44,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:44,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:28:49,172 INFO L134 CoverageAnalysis]: Checked inductivity of 11844 backedges. 0 proven. 11844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:28:49,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:28:49,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:28:49,173 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:28:49,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:28:49,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4224, Invalid=12288, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:28:49,175 INFO L87 Difference]: Start difference. First operand 392 states and 392 transitions. Second operand 129 states. [2018-10-15 15:28:57,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:28:57,666 INFO L93 Difference]: Finished difference Result 401 states and 401 transitions. [2018-10-15 15:28:57,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 192 states. [2018-10-15 15:28:57,666 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 391 [2018-10-15 15:28:57,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:28:57,668 INFO L225 Difference]: With dead ends: 401 [2018-10-15 15:28:57,668 INFO L226 Difference]: Without dead ends: 401 [2018-10-15 15:28:57,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11781 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20478, Invalid=44292, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 15:28:57,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2018-10-15 15:28:57,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 398. [2018-10-15 15:28:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 15:28:57,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-15 15:28:57,673 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 391 [2018-10-15 15:28:57,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:28:57,673 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-15 15:28:57,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:28:57,673 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-15 15:28:57,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-15 15:28:57,675 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:28:57,675 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:28:57,675 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:28:57,676 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:28:57,676 INFO L82 PathProgramCache]: Analyzing trace with hash -1710950175, now seen corresponding path program 64 times [2018-10-15 15:28:57,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:28:57,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:02,618 INFO L134 CoverageAnalysis]: Checked inductivity of 12224 backedges. 0 proven. 12224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:02,618 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:02,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:29:02,619 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:29:02,619 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:29:02,620 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4355, Invalid=12675, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:29:02,620 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 131 states. [2018-10-15 15:29:11,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:11,382 INFO L93 Difference]: Finished difference Result 407 states and 407 transitions. [2018-10-15 15:29:11,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 195 states. [2018-10-15 15:29:11,383 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 397 [2018-10-15 15:29:11,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:11,384 INFO L225 Difference]: With dead ends: 407 [2018-10-15 15:29:11,384 INFO L226 Difference]: Without dead ends: 407 [2018-10-15 15:29:11,386 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12160 ImplicationChecksByTransitivity, 12.5s TimeCoverageRelationStatistics Valid=21123, Invalid=45699, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:29:11,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2018-10-15 15:29:11,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 404. [2018-10-15 15:29:11,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 404 states. [2018-10-15 15:29:11,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 404 transitions. [2018-10-15 15:29:11,390 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 404 transitions. Word has length 397 [2018-10-15 15:29:11,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:11,391 INFO L481 AbstractCegarLoop]: Abstraction has 404 states and 404 transitions. [2018-10-15 15:29:11,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:29:11,391 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 404 transitions. [2018-10-15 15:29:11,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 404 [2018-10-15 15:29:11,393 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:11,393 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:11,393 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:11,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:11,393 INFO L82 PathProgramCache]: Analyzing trace with hash 569165383, now seen corresponding path program 65 times [2018-10-15 15:29:11,394 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:11,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:16,414 INFO L134 CoverageAnalysis]: Checked inductivity of 12610 backedges. 0 proven. 12610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:16,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:16,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:29:16,414 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:29:16,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:29:16,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4488, Invalid=13068, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:29:16,416 INFO L87 Difference]: Start difference. First operand 404 states and 404 transitions. Second operand 133 states. [2018-10-15 15:29:25,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:25,285 INFO L93 Difference]: Finished difference Result 413 states and 413 transitions. [2018-10-15 15:29:25,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 198 states. [2018-10-15 15:29:25,285 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 403 [2018-10-15 15:29:25,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:25,287 INFO L225 Difference]: With dead ends: 413 [2018-10-15 15:29:25,287 INFO L226 Difference]: Without dead ends: 413 [2018-10-15 15:29:25,289 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12545 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21778, Invalid=47128, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:29:25,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2018-10-15 15:29:25,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 410. [2018-10-15 15:29:25,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 410 states. [2018-10-15 15:29:25,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 410 transitions. [2018-10-15 15:29:25,292 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 410 transitions. Word has length 403 [2018-10-15 15:29:25,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:25,292 INFO L481 AbstractCegarLoop]: Abstraction has 410 states and 410 transitions. [2018-10-15 15:29:25,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:29:25,292 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 410 transitions. [2018-10-15 15:29:25,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2018-10-15 15:29:25,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:25,294 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:25,294 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:25,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:25,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1371696941, now seen corresponding path program 66 times [2018-10-15 15:29:25,295 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:25,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:30,699 INFO L134 CoverageAnalysis]: Checked inductivity of 13002 backedges. 0 proven. 13002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:30,700 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:30,700 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:29:30,700 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:29:30,701 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:29:30,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4623, Invalid=13467, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:29:30,701 INFO L87 Difference]: Start difference. First operand 410 states and 410 transitions. Second operand 135 states. [2018-10-15 15:29:39,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:39,829 INFO L93 Difference]: Finished difference Result 419 states and 419 transitions. [2018-10-15 15:29:39,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 201 states. [2018-10-15 15:29:39,829 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 409 [2018-10-15 15:29:39,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:39,830 INFO L225 Difference]: With dead ends: 419 [2018-10-15 15:29:39,831 INFO L226 Difference]: Without dead ends: 419 [2018-10-15 15:29:39,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12936 ImplicationChecksByTransitivity, 13.3s TimeCoverageRelationStatistics Valid=22443, Invalid=48579, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 15:29:39,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2018-10-15 15:29:39,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 416. [2018-10-15 15:29:39,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 15:29:39,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-15 15:29:39,836 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 409 [2018-10-15 15:29:39,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:39,836 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-15 15:29:39,836 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:29:39,836 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-15 15:29:39,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 15:29:39,838 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:39,838 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:39,838 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:39,838 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:39,839 INFO L82 PathProgramCache]: Analyzing trace with hash 731075475, now seen corresponding path program 67 times [2018-10-15 15:29:39,839 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:39,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:29:45,201 INFO L134 CoverageAnalysis]: Checked inductivity of 13400 backedges. 0 proven. 13400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:29:45,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:29:45,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:29:45,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:29:45,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:29:45,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4760, Invalid=13872, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:29:45,203 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 137 states. [2018-10-15 15:29:54,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:29:54,542 INFO L93 Difference]: Finished difference Result 425 states and 425 transitions. [2018-10-15 15:29:54,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 204 states. [2018-10-15 15:29:54,543 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 415 [2018-10-15 15:29:54,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:29:54,545 INFO L225 Difference]: With dead ends: 425 [2018-10-15 15:29:54,545 INFO L226 Difference]: Without dead ends: 425 [2018-10-15 15:29:54,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13333 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=23118, Invalid=50052, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:29:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 425 states. [2018-10-15 15:29:54,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 425 to 422. [2018-10-15 15:29:54,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 422 states. [2018-10-15 15:29:54,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 422 transitions. [2018-10-15 15:29:54,551 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 422 transitions. Word has length 415 [2018-10-15 15:29:54,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:29:54,551 INFO L481 AbstractCegarLoop]: Abstraction has 422 states and 422 transitions. [2018-10-15 15:29:54,551 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:29:54,552 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 422 transitions. [2018-10-15 15:29:54,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2018-10-15 15:29:54,580 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:29:54,581 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:29:54,581 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:29:54,581 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:29:54,581 INFO L82 PathProgramCache]: Analyzing trace with hash -1981492359, now seen corresponding path program 68 times [2018-10-15 15:29:54,582 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:29:54,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:00,087 INFO L134 CoverageAnalysis]: Checked inductivity of 13804 backedges. 0 proven. 13804 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:00,087 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:00,087 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:30:00,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:30:00,088 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:30:00,088 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4899, Invalid=14283, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:30:00,089 INFO L87 Difference]: Start difference. First operand 422 states and 422 transitions. Second operand 139 states. [2018-10-15 15:30:09,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:09,954 INFO L93 Difference]: Finished difference Result 431 states and 431 transitions. [2018-10-15 15:30:09,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 207 states. [2018-10-15 15:30:09,954 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 421 [2018-10-15 15:30:09,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:09,957 INFO L225 Difference]: With dead ends: 431 [2018-10-15 15:30:09,957 INFO L226 Difference]: Without dead ends: 431 [2018-10-15 15:30:09,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13736 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23803, Invalid=51547, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:30:09,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 431 states. [2018-10-15 15:30:09,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 431 to 428. [2018-10-15 15:30:09,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 428 states. [2018-10-15 15:30:09,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 428 transitions. [2018-10-15 15:30:09,962 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 428 transitions. Word has length 421 [2018-10-15 15:30:09,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:09,962 INFO L481 AbstractCegarLoop]: Abstraction has 428 states and 428 transitions. [2018-10-15 15:30:09,962 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:30:09,962 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 428 transitions. [2018-10-15 15:30:09,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2018-10-15 15:30:09,964 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:09,964 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:09,964 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:09,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash -441168161, now seen corresponding path program 69 times [2018-10-15 15:30:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:09,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:15,793 INFO L134 CoverageAnalysis]: Checked inductivity of 14214 backedges. 0 proven. 14214 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:15,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:15,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:30:15,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:30:15,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:30:15,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5040, Invalid=14700, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:30:15,795 INFO L87 Difference]: Start difference. First operand 428 states and 428 transitions. Second operand 141 states. [2018-10-15 15:30:26,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:26,102 INFO L93 Difference]: Finished difference Result 437 states and 437 transitions. [2018-10-15 15:30:26,102 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 210 states. [2018-10-15 15:30:26,103 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 427 [2018-10-15 15:30:26,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:26,104 INFO L225 Difference]: With dead ends: 437 [2018-10-15 15:30:26,104 INFO L226 Difference]: Without dead ends: 437 [2018-10-15 15:30:26,106 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14145 ImplicationChecksByTransitivity, 14.7s TimeCoverageRelationStatistics Valid=24498, Invalid=53064, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 15:30:26,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 437 states. [2018-10-15 15:30:26,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 437 to 434. [2018-10-15 15:30:26,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 15:30:26,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-10-15 15:30:26,109 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 427 [2018-10-15 15:30:26,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:26,109 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-10-15 15:30:26,109 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:30:26,109 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-10-15 15:30:26,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 15:30:26,111 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:26,111 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:26,111 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:26,111 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:26,111 INFO L82 PathProgramCache]: Analyzing trace with hash -1669913147, now seen corresponding path program 70 times [2018-10-15 15:30:26,112 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:31,966 INFO L134 CoverageAnalysis]: Checked inductivity of 14630 backedges. 0 proven. 14630 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:31,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:31,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:30:31,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:30:31,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:30:31,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5183, Invalid=15123, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:30:31,968 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 143 states. [2018-10-15 15:30:42,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:42,129 INFO L93 Difference]: Finished difference Result 443 states and 443 transitions. [2018-10-15 15:30:42,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 213 states. [2018-10-15 15:30:42,129 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 433 [2018-10-15 15:30:42,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:42,132 INFO L225 Difference]: With dead ends: 443 [2018-10-15 15:30:42,132 INFO L226 Difference]: Without dead ends: 443 [2018-10-15 15:30:42,134 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14560 ImplicationChecksByTransitivity, 14.8s TimeCoverageRelationStatistics Valid=25203, Invalid=54603, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 15:30:42,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2018-10-15 15:30:42,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 440. [2018-10-15 15:30:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 440 states. [2018-10-15 15:30:42,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 440 transitions. [2018-10-15 15:30:42,138 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 440 transitions. Word has length 433 [2018-10-15 15:30:42,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:42,138 INFO L481 AbstractCegarLoop]: Abstraction has 440 states and 440 transitions. [2018-10-15 15:30:42,138 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 15:30:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 440 transitions. [2018-10-15 15:30:42,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2018-10-15 15:30:42,140 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:42,141 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:42,141 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:42,141 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:42,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1239762901, now seen corresponding path program 71 times [2018-10-15 15:30:42,142 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:30:48,398 INFO L134 CoverageAnalysis]: Checked inductivity of 15052 backedges. 0 proven. 15052 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:30:48,398 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:30:48,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:30:48,399 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:30:48,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:30:48,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5328, Invalid=15552, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:30:48,400 INFO L87 Difference]: Start difference. First operand 440 states and 440 transitions. Second operand 145 states. [2018-10-15 15:30:58,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:30:58,759 INFO L93 Difference]: Finished difference Result 449 states and 449 transitions. [2018-10-15 15:30:58,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 216 states. [2018-10-15 15:30:58,760 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 439 [2018-10-15 15:30:58,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:30:58,762 INFO L225 Difference]: With dead ends: 449 [2018-10-15 15:30:58,762 INFO L226 Difference]: Without dead ends: 449 [2018-10-15 15:30:58,764 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14981 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=25918, Invalid=56164, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 15:30:58,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 449 states. [2018-10-15 15:30:58,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 449 to 446. [2018-10-15 15:30:58,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 446 states. [2018-10-15 15:30:58,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 446 transitions. [2018-10-15 15:30:58,767 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 446 transitions. Word has length 439 [2018-10-15 15:30:58,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:30:58,767 INFO L481 AbstractCegarLoop]: Abstraction has 446 states and 446 transitions. [2018-10-15 15:30:58,767 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:30:58,767 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 446 transitions. [2018-10-15 15:30:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 446 [2018-10-15 15:30:58,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:30:58,769 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:30:58,769 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:30:58,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:30:58,770 INFO L82 PathProgramCache]: Analyzing trace with hash 721708561, now seen corresponding path program 72 times [2018-10-15 15:30:58,770 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:30:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:04,894 INFO L134 CoverageAnalysis]: Checked inductivity of 15480 backedges. 0 proven. 15480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:04,895 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:04,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 15:31:04,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 15:31:04,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 15:31:04,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5475, Invalid=15987, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:31:04,897 INFO L87 Difference]: Start difference. First operand 446 states and 446 transitions. Second operand 147 states. [2018-10-15 15:31:15,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:15,757 INFO L93 Difference]: Finished difference Result 455 states and 455 transitions. [2018-10-15 15:31:15,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 219 states. [2018-10-15 15:31:15,757 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 445 [2018-10-15 15:31:15,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:15,758 INFO L225 Difference]: With dead ends: 455 [2018-10-15 15:31:15,758 INFO L226 Difference]: Without dead ends: 455 [2018-10-15 15:31:15,760 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15408 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=26643, Invalid=57747, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 15:31:15,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2018-10-15 15:31:15,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 452. [2018-10-15 15:31:15,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-10-15 15:31:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-10-15 15:31:15,764 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 445 [2018-10-15 15:31:15,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:15,764 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-10-15 15:31:15,764 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 15:31:15,764 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-10-15 15:31:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-15 15:31:15,766 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:15,766 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:15,766 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:15,767 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:15,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1441689737, now seen corresponding path program 73 times [2018-10-15 15:31:15,767 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:22,079 INFO L134 CoverageAnalysis]: Checked inductivity of 15914 backedges. 0 proven. 15914 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:22,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:22,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:31:22,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:31:22,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:31:22,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5624, Invalid=16428, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:31:22,081 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 149 states. [2018-10-15 15:31:33,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:33,492 INFO L93 Difference]: Finished difference Result 461 states and 461 transitions. [2018-10-15 15:31:33,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 222 states. [2018-10-15 15:31:33,492 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 451 [2018-10-15 15:31:33,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:33,494 INFO L225 Difference]: With dead ends: 461 [2018-10-15 15:31:33,494 INFO L226 Difference]: Without dead ends: 461 [2018-10-15 15:31:33,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15841 ImplicationChecksByTransitivity, 16.2s TimeCoverageRelationStatistics Valid=27378, Invalid=59352, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:31:33,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 461 states. [2018-10-15 15:31:33,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 461 to 458. [2018-10-15 15:31:33,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 458 states. [2018-10-15 15:31:33,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 458 states to 458 states and 458 transitions. [2018-10-15 15:31:33,499 INFO L78 Accepts]: Start accepts. Automaton has 458 states and 458 transitions. Word has length 451 [2018-10-15 15:31:33,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:33,500 INFO L481 AbstractCegarLoop]: Abstraction has 458 states and 458 transitions. [2018-10-15 15:31:33,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 15:31:33,500 INFO L276 IsEmpty]: Start isEmpty. Operand 458 states and 458 transitions. [2018-10-15 15:31:33,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 458 [2018-10-15 15:31:33,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:33,502 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:33,502 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:33,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:33,502 INFO L82 PathProgramCache]: Analyzing trace with hash -560491427, now seen corresponding path program 74 times [2018-10-15 15:31:33,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:33,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:31:40,154 INFO L134 CoverageAnalysis]: Checked inductivity of 16354 backedges. 0 proven. 16354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:31:40,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:31:40,154 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 15:31:40,155 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 15:31:40,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 15:31:40,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5775, Invalid=16875, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:31:40,156 INFO L87 Difference]: Start difference. First operand 458 states and 458 transitions. Second operand 151 states. [2018-10-15 15:31:51,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:31:51,733 INFO L93 Difference]: Finished difference Result 467 states and 467 transitions. [2018-10-15 15:31:51,733 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 225 states. [2018-10-15 15:31:51,733 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 457 [2018-10-15 15:31:51,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:31:51,735 INFO L225 Difference]: With dead ends: 467 [2018-10-15 15:31:51,735 INFO L226 Difference]: Without dead ends: 467 [2018-10-15 15:31:51,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16280 ImplicationChecksByTransitivity, 16.8s TimeCoverageRelationStatistics Valid=28123, Invalid=60979, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 15:31:51,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2018-10-15 15:31:51,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 464. [2018-10-15 15:31:51,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 464 states. [2018-10-15 15:31:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 464 transitions. [2018-10-15 15:31:51,740 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 464 transitions. Word has length 457 [2018-10-15 15:31:51,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:31:51,740 INFO L481 AbstractCegarLoop]: Abstraction has 464 states and 464 transitions. [2018-10-15 15:31:51,740 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 15:31:51,740 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 464 transitions. [2018-10-15 15:31:51,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 464 [2018-10-15 15:31:51,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:31:51,742 INFO L375 BasicCegarLoop]: trace histogram [76, 75, 75, 75, 75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:31:51,742 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:31:51,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:31:51,743 INFO L82 PathProgramCache]: Analyzing trace with hash 912512195, now seen corresponding path program 75 times [2018-10-15 15:31:51,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:31:51,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat