java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:37:34,903 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:37:34,906 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:37:34,917 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:37:34,918 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:37:34,919 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:37:34,920 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:37:34,922 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:37:34,925 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:37:34,926 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:37:34,927 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:37:34,927 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:37:34,932 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:37:34,934 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:37:34,936 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:37:34,940 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:37:34,941 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:37:34,942 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:37:34,944 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:37:34,946 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:37:34,947 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:37:34,948 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:37:34,951 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:37:34,951 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:37:34,951 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:37:34,952 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:37:34,953 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:37:34,954 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:37:34,955 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:37:34,956 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:37:34,956 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:37:34,957 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:37:34,957 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:37:34,957 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:37:34,959 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:37:34,959 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:37:34,960 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 12:37:34,971 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:37:34,972 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:37:34,973 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:37:34,973 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:37:34,973 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:37:34,974 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:37:34,974 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:37:34,975 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:37:34,975 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:37:34,975 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:37:34,975 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:37:34,976 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:37:34,976 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:37:34,977 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:37:34,978 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:37:35,026 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:37:35,038 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:37:35,043 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:37:35,047 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:37:35,048 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:37:35,049 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl [2018-10-15 12:37:35,049 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/phases_false-unreach-call1.i_3.bpl' [2018-10-15 12:37:35,114 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:37:35,116 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:37:35,117 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:37:35,117 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:37:35,117 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:37:35,148 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,149 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,160 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,163 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,165 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,166 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/1) ... [2018-10-15 12:37:35,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:37:35,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:37:35,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:37:35,169 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:37:35,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (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 12:37:35,247 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:37:35,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:37:35,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:37:35,545 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:37:35,546 INFO L202 PluginConnector]: Adding new model phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:37:35 BoogieIcfgContainer [2018-10-15 12:37:35,546 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:37:35,547 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:37:35,547 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:37:35,551 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:37:35,551 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:37:35" (1/2) ... [2018-10-15 12:37:35,553 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cf33d30 and model type phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:37:35, skipping insertion in model container [2018-10-15 12:37:35,553 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "phases_false-unreach-call1.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:37:35" (2/2) ... [2018-10-15 12:37:35,555 INFO L112 eAbstractionObserver]: Analyzing ICFG phases_false-unreach-call1.i_3.bpl [2018-10-15 12:37:35,566 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:37:35,574 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:37:35,594 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:37:35,624 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:37:35,625 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:37:35,625 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:37:35,626 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:37:35,626 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:37:35,626 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:37:35,626 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:37:35,626 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:37:35,626 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:37:35,646 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2018-10-15 12:37:35,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:37:35,662 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:35,664 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:35,668 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:35,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:35,681 INFO L82 PathProgramCache]: Analyzing trace with hash 2036427089, now seen corresponding path program 1 times [2018-10-15 12:37:35,748 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:35,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:36,005 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 12:37:36,008 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:37:36,008 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:37:36,013 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:37:36,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:37:36,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:37:36,036 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2018-10-15 12:37:36,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:36,134 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-10-15 12:37:36,135 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:37:36,136 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:37:36,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:36,149 INFO L225 Difference]: With dead ends: 19 [2018-10-15 12:37:36,149 INFO L226 Difference]: Without dead ends: 19 [2018-10-15 12:37:36,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:37:36,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-10-15 12:37:36,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 16. [2018-10-15 12:37:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-10-15 12:37:36,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-10-15 12:37:36,187 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-10-15 12:37:36,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:36,188 INFO L481 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-10-15 12:37:36,188 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:37:36,189 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-10-15 12:37:36,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-10-15 12:37:36,189 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:36,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:36,190 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:36,190 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:36,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1325351039, now seen corresponding path program 1 times [2018-10-15 12:37:36,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:36,346 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:36,347 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:36,347 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:37:36,349 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:37:36,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:37:36,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:37:36,350 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 5 states. [2018-10-15 12:37:36,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:36,587 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:37:36,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:37:36,588 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 15 [2018-10-15 12:37:36,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:36,589 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:37:36,589 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:37:36,591 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:37:36,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:37:36,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2018-10-15 12:37:36,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:37:36,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 12:37:36,595 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 15 [2018-10-15 12:37:36,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:36,595 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 12:37:36,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:37:36,596 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 12:37:36,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:37:36,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:36,597 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:36,597 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:36,598 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:36,598 INFO L82 PathProgramCache]: Analyzing trace with hash 2003814225, now seen corresponding path program 2 times [2018-10-15 12:37:36,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:36,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:36,919 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:36,920 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:36,920 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:37:36,920 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:37:36,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:37:36,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:37:36,922 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 7 states. [2018-10-15 12:37:37,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:37,295 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:37:37,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:37:37,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 20 [2018-10-15 12:37:37,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:37,298 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:37:37,298 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:37:37,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:37:37,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:37:37,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2018-10-15 12:37:37,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-10-15 12:37:37,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-10-15 12:37:37,305 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 20 [2018-10-15 12:37:37,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:37,305 INFO L481 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-10-15 12:37:37,305 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:37:37,306 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-10-15 12:37:37,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-10-15 12:37:37,307 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:37,307 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:37,308 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:37,308 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:37,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1287839359, now seen corresponding path program 3 times [2018-10-15 12:37:37,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:37,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:37,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:37,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:37:37,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:37:37,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:37:37,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:37:37,553 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 9 states. [2018-10-15 12:37:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:38,267 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 12:37:38,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:37:38,273 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 25 [2018-10-15 12:37:38,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:38,274 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:37:38,274 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:37:38,275 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:37:38,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:37:38,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-10-15 12:37:38,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:37:38,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:37:38,281 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 25 [2018-10-15 12:37:38,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:38,282 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:37:38,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:37:38,282 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:37:38,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:37:38,283 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:38,283 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:38,284 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:38,284 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:38,284 INFO L82 PathProgramCache]: Analyzing trace with hash -1247763119, now seen corresponding path program 4 times [2018-10-15 12:37:38,285 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:38,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:38,540 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:38,540 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:38,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:37:38,541 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:37:38,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:37:38,542 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:37:38,542 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 11 states. [2018-10-15 12:37:38,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:38,989 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-15 12:37:38,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:37:38,990 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 30 [2018-10-15 12:37:38,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:38,991 INFO L225 Difference]: With dead ends: 39 [2018-10-15 12:37:38,991 INFO L226 Difference]: Without dead ends: 39 [2018-10-15 12:37:38,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:37:38,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-15 12:37:38,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 36. [2018-10-15 12:37:38,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 12:37:38,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-10-15 12:37:38,998 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 30 [2018-10-15 12:37:38,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:38,999 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-10-15 12:37:38,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:37:38,999 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-10-15 12:37:39,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 12:37:39,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:39,000 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:39,001 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:39,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:39,001 INFO L82 PathProgramCache]: Analyzing trace with hash -1494809727, now seen corresponding path program 5 times [2018-10-15 12:37:39,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:39,239 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:39,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:39,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:37:39,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:37:39,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:37:39,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:37:39,241 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 13 states. [2018-10-15 12:37:40,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:40,039 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 12:37:40,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:37:40,040 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 35 [2018-10-15 12:37:40,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:40,041 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:37:40,042 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:37:40,043 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=63, Invalid=443, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:37:40,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:37:40,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 41. [2018-10-15 12:37:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:37:40,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 12:37:40,048 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 35 [2018-10-15 12:37:40,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:40,048 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 12:37:40,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:37:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 12:37:40,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:37:40,050 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:40,050 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:40,050 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:40,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:40,051 INFO L82 PathProgramCache]: Analyzing trace with hash 1255408465, now seen corresponding path program 6 times [2018-10-15 12:37:40,052 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:40,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:40,530 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:40,531 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:40,531 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:37:40,531 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:37:40,532 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:37:40,532 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:37:40,532 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 15 states. [2018-10-15 12:37:41,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:41,130 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:37:41,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:37:41,130 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 40 [2018-10-15 12:37:41,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:41,132 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:37:41,132 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:37:41,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:37:41,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:37:41,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 46. [2018-10-15 12:37:41,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-15 12:37:41,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-15 12:37:41,141 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 40 [2018-10-15 12:37:41,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:41,141 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-15 12:37:41,142 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:37:41,142 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-15 12:37:41,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-15 12:37:41,143 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:41,143 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:41,144 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:41,144 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:41,144 INFO L82 PathProgramCache]: Analyzing trace with hash -1054972543, now seen corresponding path program 7 times [2018-10-15 12:37:41,145 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:41,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:41,965 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 0 proven. 112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:41,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:41,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:37:41,966 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:37:41,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:37:41,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:37:41,968 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 17 states. [2018-10-15 12:37:42,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:42,949 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:37:42,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:37:42,949 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 45 [2018-10-15 12:37:42,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:42,950 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:37:42,950 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:37:42,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:37:42,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:37:42,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2018-10-15 12:37:42,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:37:42,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:37:42,956 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 45 [2018-10-15 12:37:42,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:42,957 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:37:42,957 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:37:42,957 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:37:42,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:37:42,958 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:42,958 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:42,959 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:42,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:42,959 INFO L82 PathProgramCache]: Analyzing trace with hash 904520017, now seen corresponding path program 8 times [2018-10-15 12:37:42,960 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:42,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:43,458 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 148 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:43,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:43,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:37:43,459 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:37:43,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:37:43,459 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:37:43,460 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 19 states. [2018-10-15 12:37:44,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:44,276 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-15 12:37:44,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:37:44,277 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 50 [2018-10-15 12:37:44,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:44,278 INFO L225 Difference]: With dead ends: 59 [2018-10-15 12:37:44,279 INFO L226 Difference]: Without dead ends: 59 [2018-10-15 12:37:44,280 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:37:44,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-15 12:37:44,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 56. [2018-10-15 12:37:44,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:37:44,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:37:44,286 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 50 [2018-10-15 12:37:44,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:44,286 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:37:44,286 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:37:44,286 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:37:44,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:37:44,287 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:44,288 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:44,288 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:44,288 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:44,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1325614977, now seen corresponding path program 9 times [2018-10-15 12:37:44,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:44,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:44,698 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:44,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:44,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:37:44,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:37:44,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:37:44,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:37:44,700 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 21 states. [2018-10-15 12:37:45,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:45,708 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 12:37:45,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:37:45,709 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 55 [2018-10-15 12:37:45,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:45,710 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:37:45,710 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:37:45,711 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=1371, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:37:45,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:37:45,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 61. [2018-10-15 12:37:45,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:37:45,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:37:45,716 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 55 [2018-10-15 12:37:45,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:45,716 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:37:45,716 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:37:45,717 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:37:45,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:37:45,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:45,718 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:45,718 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:45,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:45,719 INFO L82 PathProgramCache]: Analyzing trace with hash 1573011281, now seen corresponding path program 10 times [2018-10-15 12:37:45,719 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:45,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:46,099 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 0 proven. 235 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:46,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:46,100 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:37:46,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:37:46,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:37:46,101 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:37:46,101 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 23 states. [2018-10-15 12:37:47,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:47,877 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-15 12:37:47,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:37:47,885 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 60 [2018-10-15 12:37:47,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:47,886 INFO L225 Difference]: With dead ends: 69 [2018-10-15 12:37:47,886 INFO L226 Difference]: Without dead ends: 69 [2018-10-15 12:37:47,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:37:47,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-15 12:37:47,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 66. [2018-10-15 12:37:47,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 12:37:47,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-15 12:37:47,893 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 60 [2018-10-15 12:37:47,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:47,893 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-15 12:37:47,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:37:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-15 12:37:47,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:37:47,895 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:47,895 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:47,895 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:47,896 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:47,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1246385791, now seen corresponding path program 11 times [2018-10-15 12:37:47,897 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:47,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:48,470 INFO L134 CoverageAnalysis]: Checked inductivity of 286 backedges. 0 proven. 286 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:48,470 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:48,470 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:37:48,470 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:37:48,471 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:37:48,471 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:37:48,471 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 25 states. [2018-10-15 12:37:49,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:49,836 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 12:37:49,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:37:49,836 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 65 [2018-10-15 12:37:49,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:49,838 INFO L225 Difference]: With dead ends: 74 [2018-10-15 12:37:49,838 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:37:49,839 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=135, Invalid=2027, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:37:49,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:37:49,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2018-10-15 12:37:49,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:37:49,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 12:37:49,847 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 65 [2018-10-15 12:37:49,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:49,848 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 12:37:49,848 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:37:49,848 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 12:37:49,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:37:49,851 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:49,852 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:49,852 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:49,852 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:49,852 INFO L82 PathProgramCache]: Analyzing trace with hash -1858265775, now seen corresponding path program 12 times [2018-10-15 12:37:49,853 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:49,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:50,560 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:50,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:50,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:37:50,561 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:37:50,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:37:50,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:37:50,561 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 27 states. [2018-10-15 12:37:52,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:52,361 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-15 12:37:52,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:37:52,362 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 70 [2018-10-15 12:37:52,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:52,363 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:37:52,363 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:37:52,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:37:52,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:37:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 76. [2018-10-15 12:37:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-15 12:37:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-15 12:37:52,370 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 70 [2018-10-15 12:37:52,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:52,371 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-15 12:37:52,371 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:37:52,371 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-15 12:37:52,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-15 12:37:52,372 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:52,372 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:52,373 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:52,373 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:52,373 INFO L82 PathProgramCache]: Analyzing trace with hash 1918208897, now seen corresponding path program 13 times [2018-10-15 12:37:52,374 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:52,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:53,000 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 0 proven. 403 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:53,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:53,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:37:53,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:37:53,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:37:53,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:37:53,002 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 29 states. [2018-10-15 12:37:54,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:54,734 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 12:37:54,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:37:54,735 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 75 [2018-10-15 12:37:54,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:54,736 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:37:54,736 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:37:54,738 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=159, Invalid=2811, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:37:54,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:37:54,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-10-15 12:37:54,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:37:54,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 12:37:54,743 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 75 [2018-10-15 12:37:54,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:54,743 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 12:37:54,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:37:54,743 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 12:37:54,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:37:54,744 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:54,745 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:54,745 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:54,745 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:54,745 INFO L82 PathProgramCache]: Analyzing trace with hash -2026210479, now seen corresponding path program 14 times [2018-10-15 12:37:54,746 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:54,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:55,681 INFO L134 CoverageAnalysis]: Checked inductivity of 469 backedges. 0 proven. 469 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:55,681 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:55,681 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:37:55,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:37:55,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:37:55,682 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:37:55,682 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 31 states. [2018-10-15 12:37:57,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:37:57,931 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-15 12:37:57,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:37:57,935 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 80 [2018-10-15 12:37:57,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:37:57,936 INFO L225 Difference]: With dead ends: 89 [2018-10-15 12:37:57,936 INFO L226 Difference]: Without dead ends: 89 [2018-10-15 12:37:57,937 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:37:57,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-15 12:37:57,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 86. [2018-10-15 12:37:57,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-15 12:37:57,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-15 12:37:57,941 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 80 [2018-10-15 12:37:57,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:37:57,941 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-15 12:37:57,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:37:57,941 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-15 12:37:57,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-15 12:37:57,942 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:37:57,943 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:37:57,943 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:37:57,943 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:37:57,943 INFO L82 PathProgramCache]: Analyzing trace with hash 436399489, now seen corresponding path program 15 times [2018-10-15 12:37:57,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:37:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:37:58,734 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 0 proven. 540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:37:58,734 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:37:58,734 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:37:58,735 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:37:58,735 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:37:58,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:37:58,736 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 33 states. [2018-10-15 12:38:00,797 WARN L179 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2018-10-15 12:38:01,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:01,197 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 12:38:01,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:38:01,208 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 85 [2018-10-15 12:38:01,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:01,209 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:38:01,209 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:38:01,210 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=183, Invalid=3723, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:38:01,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:38:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 91. [2018-10-15 12:38:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:38:01,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:38:01,215 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 85 [2018-10-15 12:38:01,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:01,216 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:38:01,216 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:38:01,216 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:38:01,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:38:01,221 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:01,221 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:01,222 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:01,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:01,222 INFO L82 PathProgramCache]: Analyzing trace with hash -560309935, now seen corresponding path program 16 times [2018-10-15 12:38:01,223 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:01,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:02,697 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 0 proven. 616 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:02,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:02,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:38:02,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:38:02,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:38:02,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:38:02,700 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 35 states. [2018-10-15 12:38:04,825 WARN L179 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:38:05,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:05,860 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-15 12:38:05,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:38:05,861 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 90 [2018-10-15 12:38:05,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:05,862 INFO L225 Difference]: With dead ends: 99 [2018-10-15 12:38:05,862 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:38:05,865 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:38:05,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:38:05,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 96. [2018-10-15 12:38:05,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 12:38:05,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-15 12:38:05,868 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 90 [2018-10-15 12:38:05,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:05,868 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-15 12:38:05,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:38:05,868 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-15 12:38:05,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 12:38:05,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:05,870 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:05,871 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:05,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:05,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1507708801, now seen corresponding path program 17 times [2018-10-15 12:38:05,872 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:05,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:06,735 INFO L134 CoverageAnalysis]: Checked inductivity of 697 backedges. 0 proven. 697 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:06,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:06,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:38:06,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:38:06,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:38:06,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:38:06,737 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 37 states. [2018-10-15 12:38:09,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:09,659 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 12:38:09,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:38:09,660 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 95 [2018-10-15 12:38:09,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:09,661 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:38:09,662 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:38:09,663 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=207, Invalid=4763, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:38:09,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:38:09,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2018-10-15 12:38:09,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:38:09,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:38:09,665 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 95 [2018-10-15 12:38:09,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:09,666 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:38:09,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:38:09,666 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:38:09,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:38:09,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:09,667 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:09,667 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:09,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:09,667 INFO L82 PathProgramCache]: Analyzing trace with hash 507295569, now seen corresponding path program 18 times [2018-10-15 12:38:09,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:09,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:11,071 INFO L134 CoverageAnalysis]: Checked inductivity of 783 backedges. 0 proven. 783 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:38:11,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:38:11,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:38:11,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:38:11,073 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 39 states. [2018-10-15 12:38:14,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:14,353 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-15 12:38:14,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:38:14,354 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 100 [2018-10-15 12:38:14,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:14,355 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:38:14,355 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 12:38:14,358 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:38:14,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 12:38:14,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2018-10-15 12:38:14,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-15 12:38:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-15 12:38:14,361 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 100 [2018-10-15 12:38:14,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:14,362 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-15 12:38:14,362 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:38:14,362 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-15 12:38:14,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-15 12:38:14,363 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:14,363 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:14,363 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:14,363 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:14,364 INFO L82 PathProgramCache]: Analyzing trace with hash -150589055, now seen corresponding path program 19 times [2018-10-15 12:38:14,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:14,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:15,283 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 0 proven. 874 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:15,284 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:15,284 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:38:15,284 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:38:15,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:38:15,285 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:38:15,285 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 41 states. [2018-10-15 12:38:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:18,894 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 12:38:18,894 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:38:18,895 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 105 [2018-10-15 12:38:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:18,896 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:38:18,896 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:38:18,899 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=231, Invalid=5931, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:38:18,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:38:18,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2018-10-15 12:38:18,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:38:18,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 12:38:18,902 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 105 [2018-10-15 12:38:18,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:18,903 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 12:38:18,903 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:38:18,903 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 12:38:18,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:38:18,903 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:18,904 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:18,904 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:18,904 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:18,904 INFO L82 PathProgramCache]: Analyzing trace with hash -1258187439, now seen corresponding path program 20 times [2018-10-15 12:38:18,905 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:20,109 INFO L134 CoverageAnalysis]: Checked inductivity of 970 backedges. 0 proven. 970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:20,110 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:20,110 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:38:20,110 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:38:20,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:38:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:38:20,111 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 43 states. [2018-10-15 12:38:24,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:24,003 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-15 12:38:24,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:38:24,004 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 110 [2018-10-15 12:38:24,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:24,006 INFO L225 Difference]: With dead ends: 119 [2018-10-15 12:38:24,006 INFO L226 Difference]: Without dead ends: 119 [2018-10-15 12:38:24,009 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:38:24,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-15 12:38:24,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2018-10-15 12:38:24,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-15 12:38:24,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-15 12:38:24,012 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 110 [2018-10-15 12:38:24,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:24,012 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-15 12:38:24,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:38:24,012 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-15 12:38:24,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-15 12:38:24,013 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:24,013 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:24,013 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:24,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:24,014 INFO L82 PathProgramCache]: Analyzing trace with hash -828632191, now seen corresponding path program 21 times [2018-10-15 12:38:24,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:25,363 INFO L134 CoverageAnalysis]: Checked inductivity of 1071 backedges. 0 proven. 1071 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:25,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:25,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:38:25,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:38:25,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:38:25,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:38:25,364 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 45 states. [2018-10-15 12:38:29,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:29,672 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 12:38:29,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:38:29,675 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 115 [2018-10-15 12:38:29,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:29,677 INFO L225 Difference]: With dead ends: 124 [2018-10-15 12:38:29,677 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:38:29,678 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=255, Invalid=7227, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:38:29,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:38:29,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 121. [2018-10-15 12:38:29,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:38:29,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:38:29,681 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 115 [2018-10-15 12:38:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:29,682 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:38:29,682 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:38:29,682 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:38:29,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:38:29,682 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:29,683 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:29,683 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:29,683 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:29,683 INFO L82 PathProgramCache]: Analyzing trace with hash -104271023, now seen corresponding path program 22 times [2018-10-15 12:38:29,684 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:29,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:31,079 INFO L134 CoverageAnalysis]: Checked inductivity of 1177 backedges. 0 proven. 1177 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:31,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:31,080 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:38:31,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:38:31,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:38:31,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:38:31,081 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 47 states. [2018-10-15 12:38:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:35,720 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-15 12:38:35,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:38:35,721 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 120 [2018-10-15 12:38:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:35,722 INFO L225 Difference]: With dead ends: 129 [2018-10-15 12:38:35,722 INFO L226 Difference]: Without dead ends: 129 [2018-10-15 12:38:35,723 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:38:35,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-15 12:38:35,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 126. [2018-10-15 12:38:35,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 12:38:35,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-15 12:38:35,727 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 120 [2018-10-15 12:38:35,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:35,728 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-15 12:38:35,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:38:35,728 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-15 12:38:35,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 12:38:35,728 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:35,729 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:35,729 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:35,729 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:35,729 INFO L82 PathProgramCache]: Analyzing trace with hash -708872831, now seen corresponding path program 23 times [2018-10-15 12:38:35,730 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:35,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:38,420 INFO L134 CoverageAnalysis]: Checked inductivity of 1288 backedges. 0 proven. 1288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:38,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:38,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:38:38,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:38:38,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:38:38,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:38:38,422 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 49 states. [2018-10-15 12:38:43,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:43,483 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 12:38:43,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:38:43,484 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 125 [2018-10-15 12:38:43,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:43,485 INFO L225 Difference]: With dead ends: 134 [2018-10-15 12:38:43,485 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:38:43,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=279, Invalid=8651, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:38:43,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:38:43,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2018-10-15 12:38:43,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:38:43,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:38:43,490 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 125 [2018-10-15 12:38:43,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:43,490 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:38:43,490 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:38:43,490 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:38:43,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:38:43,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:43,491 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:43,492 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:43,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:43,492 INFO L82 PathProgramCache]: Analyzing trace with hash 728944977, now seen corresponding path program 24 times [2018-10-15 12:38:43,493 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:45,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1404 backedges. 0 proven. 1404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:45,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:45,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:38:45,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:38:45,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:38:45,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:38:45,010 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 51 states. [2018-10-15 12:38:50,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:50,406 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 12:38:50,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:38:50,406 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 130 [2018-10-15 12:38:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:50,408 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:38:50,408 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:38:50,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:38:50,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:38:50,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 136. [2018-10-15 12:38:50,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-15 12:38:50,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-15 12:38:50,413 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 130 [2018-10-15 12:38:50,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:50,413 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-15 12:38:50,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:38:50,413 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-15 12:38:50,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-15 12:38:50,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:50,414 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:50,415 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:50,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:50,415 INFO L82 PathProgramCache]: Analyzing trace with hash 428889985, now seen corresponding path program 25 times [2018-10-15 12:38:50,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:50,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:38:52,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 0 proven. 1525 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:38:52,712 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:38:52,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:38:52,713 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:38:52,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:38:52,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:38:52,714 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 53 states. [2018-10-15 12:38:58,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:38:58,547 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:38:58,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:38:58,548 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 135 [2018-10-15 12:38:58,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:38:58,549 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:38:58,549 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:38:58,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=303, Invalid=10203, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:38:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:38:58,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2018-10-15 12:38:58,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 12:38:58,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 12:38:58,553 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 135 [2018-10-15 12:38:58,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:38:58,554 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 12:38:58,554 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:38:58,554 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 12:38:58,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 12:38:58,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:38:58,555 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:38:58,555 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:38:58,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:38:58,555 INFO L82 PathProgramCache]: Analyzing trace with hash 1893674833, now seen corresponding path program 26 times [2018-10-15 12:38:58,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:38:58,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:00,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1651 backedges. 0 proven. 1651 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:00,108 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:00,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:39:00,109 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:39:00,109 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:39:00,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:39:00,110 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 55 states. [2018-10-15 12:39:06,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:06,323 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-15 12:39:06,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:39:06,324 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 140 [2018-10-15 12:39:06,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:06,326 INFO L225 Difference]: With dead ends: 149 [2018-10-15 12:39:06,326 INFO L226 Difference]: Without dead ends: 149 [2018-10-15 12:39:06,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:39:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-15 12:39:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2018-10-15 12:39:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:39:06,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:39:06,330 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 140 [2018-10-15 12:39:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:06,330 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:39:06,330 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:39:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:39:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:39:06,331 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:06,331 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:06,331 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:06,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:06,332 INFO L82 PathProgramCache]: Analyzing trace with hash -1087456895, now seen corresponding path program 27 times [2018-10-15 12:39:06,332 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:06,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:07,973 INFO L134 CoverageAnalysis]: Checked inductivity of 1782 backedges. 0 proven. 1782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:07,973 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:07,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:39:07,974 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:39:07,974 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:39:07,974 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:39:07,975 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 57 states. [2018-10-15 12:39:14,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:14,840 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 12:39:14,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:39:14,841 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 145 [2018-10-15 12:39:14,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:14,842 INFO L225 Difference]: With dead ends: 154 [2018-10-15 12:39:14,842 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 12:39:14,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=327, Invalid=11883, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:39:14,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 12:39:14,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 151. [2018-10-15 12:39:14,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:39:14,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:39:14,847 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 145 [2018-10-15 12:39:14,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:14,847 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:39:14,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:39:14,847 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:39:14,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:39:14,848 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:14,848 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:14,849 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:14,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:14,849 INFO L82 PathProgramCache]: Analyzing trace with hash -655487663, now seen corresponding path program 28 times [2018-10-15 12:39:14,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:14,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:17,146 INFO L134 CoverageAnalysis]: Checked inductivity of 1918 backedges. 0 proven. 1918 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:17,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:17,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:39:17,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:39:17,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:39:17,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:39:17,147 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 59 states. [2018-10-15 12:39:24,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:24,513 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-15 12:39:24,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:39:24,514 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 150 [2018-10-15 12:39:24,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:24,515 INFO L225 Difference]: With dead ends: 159 [2018-10-15 12:39:24,515 INFO L226 Difference]: Without dead ends: 159 [2018-10-15 12:39:24,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:39:24,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-15 12:39:24,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 156. [2018-10-15 12:39:24,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 12:39:24,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-15 12:39:24,520 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 150 [2018-10-15 12:39:24,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:24,520 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-15 12:39:24,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:39:24,520 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-15 12:39:24,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 12:39:24,521 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:24,521 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:24,522 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:24,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:24,522 INFO L82 PathProgramCache]: Analyzing trace with hash 62561153, now seen corresponding path program 29 times [2018-10-15 12:39:24,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:26,887 INFO L134 CoverageAnalysis]: Checked inductivity of 2059 backedges. 0 proven. 2059 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:26,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:26,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:39:26,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:39:26,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:39:26,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:39:26,889 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 61 states. [2018-10-15 12:39:34,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:34,510 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 12:39:34,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:39:34,510 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 155 [2018-10-15 12:39:34,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:34,512 INFO L225 Difference]: With dead ends: 164 [2018-10-15 12:39:34,512 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 12:39:34,513 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=351, Invalid=13691, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:39:34,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 12:39:34,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 161. [2018-10-15 12:39:34,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:39:34,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 12:39:34,516 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 155 [2018-10-15 12:39:34,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:34,517 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 12:39:34,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:39:34,517 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 12:39:34,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:39:34,517 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:34,517 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:34,518 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:34,518 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:34,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1518299985, now seen corresponding path program 30 times [2018-10-15 12:39:34,518 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:34,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:36,446 INFO L134 CoverageAnalysis]: Checked inductivity of 2205 backedges. 0 proven. 2205 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:36,446 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:36,446 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:39:36,447 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:39:36,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:39:36,447 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:39:36,448 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 63 states. [2018-10-15 12:39:44,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:44,611 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-15 12:39:44,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:39:44,611 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 160 [2018-10-15 12:39:44,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:44,613 INFO L225 Difference]: With dead ends: 169 [2018-10-15 12:39:44,614 INFO L226 Difference]: Without dead ends: 169 [2018-10-15 12:39:44,615 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:39:44,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-15 12:39:44,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 166. [2018-10-15 12:39:44,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-15 12:39:44,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-15 12:39:44,618 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 160 [2018-10-15 12:39:44,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:44,618 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-15 12:39:44,618 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:39:44,619 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-15 12:39:44,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-15 12:39:44,619 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:44,620 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:44,620 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:44,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:44,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1012137345, now seen corresponding path program 31 times [2018-10-15 12:39:44,621 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:44,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:46,732 INFO L134 CoverageAnalysis]: Checked inductivity of 2356 backedges. 0 proven. 2356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:46,733 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:46,733 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:39:46,733 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:39:46,734 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:39:46,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:39:46,734 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 65 states. [2018-10-15 12:39:55,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:39:55,405 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 12:39:55,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:39:55,406 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 165 [2018-10-15 12:39:55,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:39:55,407 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:39:55,408 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:39:55,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=375, Invalid=15627, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:39:55,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:39:55,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 171. [2018-10-15 12:39:55,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:39:55,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:39:55,413 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 165 [2018-10-15 12:39:55,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:39:55,413 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:39:55,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:39:55,414 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:39:55,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:39:55,414 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:39:55,415 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:39:55,415 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:39:55,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:39:55,415 INFO L82 PathProgramCache]: Analyzing trace with hash -730642095, now seen corresponding path program 32 times [2018-10-15 12:39:55,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:39:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:39:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 2512 backedges. 0 proven. 2512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:39:57,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:39:57,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:39:57,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:39:57,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:39:57,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:39:57,987 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 67 states. [2018-10-15 12:40:07,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:07,331 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-15 12:40:07,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:40:07,331 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 170 [2018-10-15 12:40:07,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:07,333 INFO L225 Difference]: With dead ends: 179 [2018-10-15 12:40:07,333 INFO L226 Difference]: Without dead ends: 179 [2018-10-15 12:40:07,334 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:40:07,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-15 12:40:07,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2018-10-15 12:40:07,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-15 12:40:07,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-15 12:40:07,337 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 170 [2018-10-15 12:40:07,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:07,338 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-15 12:40:07,338 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:40:07,338 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-15 12:40:07,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-15 12:40:07,339 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:07,339 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:07,340 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:07,340 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:07,340 INFO L82 PathProgramCache]: Analyzing trace with hash -702881919, now seen corresponding path program 33 times [2018-10-15 12:40:07,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:07,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:10,414 INFO L134 CoverageAnalysis]: Checked inductivity of 2673 backedges. 0 proven. 2673 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:10,415 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:10,415 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:40:10,415 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:40:10,416 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:40:10,416 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:40:10,416 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 69 states. [2018-10-15 12:40:20,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:20,169 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 12:40:20,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:40:20,170 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 175 [2018-10-15 12:40:20,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:20,171 INFO L225 Difference]: With dead ends: 184 [2018-10-15 12:40:20,172 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:40:20,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=399, Invalid=17691, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:40:20,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:40:20,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2018-10-15 12:40:20,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 12:40:20,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 12:40:20,178 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 175 [2018-10-15 12:40:20,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:20,179 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 12:40:20,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:40:20,179 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 12:40:20,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 12:40:20,180 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:20,180 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:20,180 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:20,181 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:20,181 INFO L82 PathProgramCache]: Analyzing trace with hash 229222225, now seen corresponding path program 34 times [2018-10-15 12:40:20,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:20,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:22,871 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 0 proven. 2839 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:22,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:22,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:40:22,872 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:40:22,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:40:22,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:40:22,872 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 71 states. [2018-10-15 12:40:33,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:33,949 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-15 12:40:33,950 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:40:33,950 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 180 [2018-10-15 12:40:33,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:33,951 INFO L225 Difference]: With dead ends: 189 [2018-10-15 12:40:33,951 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:40:33,952 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:40:33,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:40:33,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 186. [2018-10-15 12:40:33,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-15 12:40:33,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-15 12:40:33,955 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 180 [2018-10-15 12:40:33,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:33,955 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-15 12:40:33,956 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:40:33,956 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-15 12:40:33,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-15 12:40:33,957 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:33,957 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:33,957 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:33,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:33,957 INFO L82 PathProgramCache]: Analyzing trace with hash 1445937537, now seen corresponding path program 35 times [2018-10-15 12:40:33,958 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:36,933 INFO L134 CoverageAnalysis]: Checked inductivity of 3010 backedges. 0 proven. 3010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:36,933 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:36,933 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:40:36,934 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:40:36,934 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:40:36,934 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:40:36,935 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 73 states. [2018-10-15 12:40:47,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:40:47,826 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 12:40:47,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:40:47,827 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 185 [2018-10-15 12:40:47,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:40:47,828 INFO L225 Difference]: With dead ends: 194 [2018-10-15 12:40:47,828 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 12:40:47,829 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=423, Invalid=19883, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:40:47,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 12:40:47,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 191. [2018-10-15 12:40:47,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:40:47,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:40:47,832 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 185 [2018-10-15 12:40:47,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:40:47,832 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:40:47,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:40:47,832 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:40:47,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:40:47,833 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:40:47,833 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:40:47,834 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:40:47,834 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:40:47,834 INFO L82 PathProgramCache]: Analyzing trace with hash -1258125999, now seen corresponding path program 36 times [2018-10-15 12:40:47,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:40:47,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:40:50,585 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:40:50,586 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:40:50,586 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:40:50,586 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:40:50,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:40:50,587 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:40:50,587 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 75 states. [2018-10-15 12:41:02,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:02,456 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-10-15 12:41:02,456 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:41:02,456 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 190 [2018-10-15 12:41:02,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:02,458 INFO L225 Difference]: With dead ends: 199 [2018-10-15 12:41:02,458 INFO L226 Difference]: Without dead ends: 199 [2018-10-15 12:41:02,459 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:41:02,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-10-15 12:41:02,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 196. [2018-10-15 12:41:02,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-15 12:41:02,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-15 12:41:02,463 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 190 [2018-10-15 12:41:02,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:02,463 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-15 12:41:02,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:41:02,464 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-15 12:41:02,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-15 12:41:02,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:02,465 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:02,465 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:02,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:02,465 INFO L82 PathProgramCache]: Analyzing trace with hash 1504781185, now seen corresponding path program 37 times [2018-10-15 12:41:02,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:02,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 3367 backedges. 0 proven. 3367 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:05,707 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:05,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:41:05,708 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:41:05,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:41:05,708 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:41:05,708 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 77 states. [2018-10-15 12:41:17,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:17,893 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 12:41:17,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:41:17,893 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 195 [2018-10-15 12:41:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:17,895 INFO L225 Difference]: With dead ends: 204 [2018-10-15 12:41:17,895 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 12:41:17,896 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=447, Invalid=22203, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:41:17,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 12:41:17,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 201. [2018-10-15 12:41:17,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 12:41:17,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 12:41:17,901 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 195 [2018-10-15 12:41:17,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:17,901 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 12:41:17,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:41:17,902 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 12:41:17,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 12:41:17,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:17,903 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:17,903 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:17,903 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:17,903 INFO L82 PathProgramCache]: Analyzing trace with hash 1633542993, now seen corresponding path program 38 times [2018-10-15 12:41:17,904 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:17,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:20,863 INFO L134 CoverageAnalysis]: Checked inductivity of 3553 backedges. 0 proven. 3553 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:20,864 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:20,864 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:41:20,864 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:41:20,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:41:20,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:41:20,865 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 79 states. [2018-10-15 12:41:33,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:33,721 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-10-15 12:41:33,722 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:41:33,722 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 200 [2018-10-15 12:41:33,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:33,723 INFO L225 Difference]: With dead ends: 209 [2018-10-15 12:41:33,723 INFO L226 Difference]: Without dead ends: 209 [2018-10-15 12:41:33,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=459, Invalid=23411, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:41:33,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-10-15 12:41:33,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 206. [2018-10-15 12:41:33,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 206 states. [2018-10-15 12:41:33,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 206 transitions. [2018-10-15 12:41:33,728 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 206 transitions. Word has length 200 [2018-10-15 12:41:33,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:33,728 INFO L481 AbstractCegarLoop]: Abstraction has 206 states and 206 transitions. [2018-10-15 12:41:33,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:41:33,728 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 206 transitions. [2018-10-15 12:41:33,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2018-10-15 12:41:33,729 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:33,730 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:33,730 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:33,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:33,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1782545023, now seen corresponding path program 39 times [2018-10-15 12:41:33,731 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:33,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:37,009 INFO L134 CoverageAnalysis]: Checked inductivity of 3744 backedges. 0 proven. 3744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:37,010 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:37,010 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:41:37,010 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:41:37,011 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:41:37,011 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:41:37,011 INFO L87 Difference]: Start difference. First operand 206 states and 206 transitions. Second operand 81 states. [2018-10-15 12:41:50,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:41:50,542 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 12:41:50,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 12:41:50,542 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 205 [2018-10-15 12:41:50,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:41:50,544 INFO L225 Difference]: With dead ends: 214 [2018-10-15 12:41:50,544 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 12:41:50,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=471, Invalid=24651, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:41:50,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 12:41:50,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 211. [2018-10-15 12:41:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:41:50,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:41:50,548 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 205 [2018-10-15 12:41:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:41:50,549 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:41:50,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:41:50,549 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:41:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:41:50,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:41:50,550 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:41:50,550 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:41:50,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:41:50,551 INFO L82 PathProgramCache]: Analyzing trace with hash -1852063407, now seen corresponding path program 40 times [2018-10-15 12:41:50,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:41:50,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:41:54,105 INFO L134 CoverageAnalysis]: Checked inductivity of 3940 backedges. 0 proven. 3940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:41:54,105 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:41:54,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:41:54,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:41:54,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:41:54,106 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:41:54,107 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 83 states. [2018-10-15 12:42:08,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:08,311 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-10-15 12:42:08,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 12:42:08,312 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 210 [2018-10-15 12:42:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:08,313 INFO L225 Difference]: With dead ends: 219 [2018-10-15 12:42:08,313 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 12:42:08,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:42:08,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 12:42:08,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 216. [2018-10-15 12:42:08,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 216 states. [2018-10-15 12:42:08,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 216 transitions. [2018-10-15 12:42:08,317 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 216 transitions. Word has length 210 [2018-10-15 12:42:08,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:08,317 INFO L481 AbstractCegarLoop]: Abstraction has 216 states and 216 transitions. [2018-10-15 12:42:08,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:42:08,317 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 216 transitions. [2018-10-15 12:42:08,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2018-10-15 12:42:08,318 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:08,318 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:08,319 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:08,319 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:08,319 INFO L82 PathProgramCache]: Analyzing trace with hash -679647359, now seen corresponding path program 41 times [2018-10-15 12:42:08,320 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:08,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:11,924 INFO L134 CoverageAnalysis]: Checked inductivity of 4141 backedges. 0 proven. 4141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:11,924 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:11,924 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:42:11,924 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:42:11,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:42:11,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:42:11,925 INFO L87 Difference]: Start difference. First operand 216 states and 216 transitions. Second operand 85 states. [2018-10-15 12:42:26,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:26,777 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 12:42:26,777 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 12:42:26,777 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 215 [2018-10-15 12:42:26,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:26,779 INFO L225 Difference]: With dead ends: 224 [2018-10-15 12:42:26,779 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 12:42:26,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3321 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=495, Invalid=27227, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:42:26,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 12:42:26,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 221. [2018-10-15 12:42:26,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-15 12:42:26,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-15 12:42:26,784 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 215 [2018-10-15 12:42:26,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:26,784 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-15 12:42:26,784 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:42:26,784 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-15 12:42:26,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 12:42:26,785 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:26,786 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:26,786 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:26,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:26,786 INFO L82 PathProgramCache]: Analyzing trace with hash -1399054511, now seen corresponding path program 42 times [2018-10-15 12:42:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:26,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:30,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4347 backedges. 0 proven. 4347 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:30,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:30,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:42:30,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:42:30,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:42:30,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:42:30,923 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 87 states. [2018-10-15 12:42:46,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:42:46,586 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 12:42:46,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 12:42:46,587 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 220 [2018-10-15 12:42:46,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:42:46,588 INFO L225 Difference]: With dead ends: 229 [2018-10-15 12:42:46,588 INFO L226 Difference]: Without dead ends: 229 [2018-10-15 12:42:46,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 172 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3486 ImplicationChecksByTransitivity, 8.1s TimeCoverageRelationStatistics Valid=507, Invalid=28563, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:42:46,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-10-15 12:42:46,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 226. [2018-10-15 12:42:46,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-10-15 12:42:46,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 226 transitions. [2018-10-15 12:42:46,593 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 226 transitions. Word has length 220 [2018-10-15 12:42:46,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:42:46,594 INFO L481 AbstractCegarLoop]: Abstraction has 226 states and 226 transitions. [2018-10-15 12:42:46,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:42:46,594 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 226 transitions. [2018-10-15 12:42:46,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2018-10-15 12:42:46,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:42:46,595 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:42:46,595 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:42:46,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:42:46,596 INFO L82 PathProgramCache]: Analyzing trace with hash 67619201, now seen corresponding path program 43 times [2018-10-15 12:42:46,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:42:46,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:42:51,621 INFO L134 CoverageAnalysis]: Checked inductivity of 4558 backedges. 0 proven. 4558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:42:51,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:42:51,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:42:51,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:42:51,622 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:42:51,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:42:51,623 INFO L87 Difference]: Start difference. First operand 226 states and 226 transitions. Second operand 89 states. [2018-10-15 12:43:07,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:07,973 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 12:43:07,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 12:43:07,973 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 225 [2018-10-15 12:43:07,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:07,975 INFO L225 Difference]: With dead ends: 234 [2018-10-15 12:43:07,976 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:43:07,977 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3655 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=519, Invalid=29931, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:43:07,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:43:07,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 231. [2018-10-15 12:43:07,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 12:43:07,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 12:43:07,981 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 225 [2018-10-15 12:43:07,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:07,981 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 12:43:07,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:43:07,981 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 12:43:07,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 12:43:07,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:07,983 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:07,983 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:07,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:07,983 INFO L82 PathProgramCache]: Analyzing trace with hash 20905297, now seen corresponding path program 44 times [2018-10-15 12:43:07,984 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:07,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:12,687 INFO L134 CoverageAnalysis]: Checked inductivity of 4774 backedges. 0 proven. 4774 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:12,687 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:12,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:43:12,688 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:43:12,688 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:43:12,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:43:12,689 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 91 states. [2018-10-15 12:43:30,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:30,426 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-10-15 12:43:30,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 12:43:30,427 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 230 [2018-10-15 12:43:30,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:30,429 INFO L225 Difference]: With dead ends: 239 [2018-10-15 12:43:30,429 INFO L226 Difference]: Without dead ends: 239 [2018-10-15 12:43:30,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3828 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:43:30,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-10-15 12:43:30,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 236. [2018-10-15 12:43:30,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 12:43:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 12:43:30,434 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 230 [2018-10-15 12:43:30,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:30,434 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 12:43:30,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:43:30,435 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 12:43:30,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 12:43:30,436 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:30,436 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:30,436 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:30,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:30,437 INFO L82 PathProgramCache]: Analyzing trace with hash 411020161, now seen corresponding path program 45 times [2018-10-15 12:43:30,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:34,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4995 backedges. 0 proven. 4995 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:34,500 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:34,500 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:43:34,500 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:43:34,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:43:34,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:43:34,501 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 93 states. [2018-10-15 12:43:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:43:52,788 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 12:43:52,788 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 12:43:52,789 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 235 [2018-10-15 12:43:52,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:43:52,790 INFO L225 Difference]: With dead ends: 244 [2018-10-15 12:43:52,790 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 12:43:52,791 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4005 ImplicationChecksByTransitivity, 8.8s TimeCoverageRelationStatistics Valid=543, Invalid=32763, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:43:52,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 12:43:52,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 241. [2018-10-15 12:43:52,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:43:52,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 12:43:52,795 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 235 [2018-10-15 12:43:52,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:43:52,796 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 12:43:52,796 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:43:52,796 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 12:43:52,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:43:52,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:43:52,797 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:43:52,798 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:43:52,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:43:52,798 INFO L82 PathProgramCache]: Analyzing trace with hash -966501551, now seen corresponding path program 46 times [2018-10-15 12:43:52,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:43:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:43:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 5221 backedges. 0 proven. 5221 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:43:57,233 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:43:57,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:43:57,234 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:43:57,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:43:57,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:43:57,234 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 95 states. [2018-10-15 12:44:11,876 WARN L179 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2018-10-15 12:44:16,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:16,236 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-10-15 12:44:16,236 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 12:44:16,237 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 240 [2018-10-15 12:44:16,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:16,238 INFO L225 Difference]: With dead ends: 249 [2018-10-15 12:44:16,239 INFO L226 Difference]: Without dead ends: 249 [2018-10-15 12:44:16,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4186 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=555, Invalid=34227, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:44:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-10-15 12:44:16,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 246. [2018-10-15 12:44:16,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 246 states. [2018-10-15 12:44:16,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 246 transitions. [2018-10-15 12:44:16,243 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 246 transitions. Word has length 240 [2018-10-15 12:44:16,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:16,244 INFO L481 AbstractCegarLoop]: Abstraction has 246 states and 246 transitions. [2018-10-15 12:44:16,244 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:44:16,244 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 246 transitions. [2018-10-15 12:44:16,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2018-10-15 12:44:16,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:16,245 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:16,246 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:16,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:16,246 INFO L82 PathProgramCache]: Analyzing trace with hash 704974209, now seen corresponding path program 47 times [2018-10-15 12:44:16,246 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:20,602 INFO L134 CoverageAnalysis]: Checked inductivity of 5452 backedges. 0 proven. 5452 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:20,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:20,603 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:44:20,603 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:44:20,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:44:20,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:44:20,603 INFO L87 Difference]: Start difference. First operand 246 states and 246 transitions. Second operand 97 states. [2018-10-15 12:44:40,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:44:40,108 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 12:44:40,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 12:44:40,108 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 245 [2018-10-15 12:44:40,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:44:40,109 INFO L225 Difference]: With dead ends: 254 [2018-10-15 12:44:40,109 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 12:44:40,110 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4371 ImplicationChecksByTransitivity, 9.3s TimeCoverageRelationStatistics Valid=567, Invalid=35723, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:44:40,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 12:44:40,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 251. [2018-10-15 12:44:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 12:44:40,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 12:44:40,113 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 245 [2018-10-15 12:44:40,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:44:40,114 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 12:44:40,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:44:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 12:44:40,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 12:44:40,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:44:40,115 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:44:40,115 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:44:40,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:44:40,115 INFO L82 PathProgramCache]: Analyzing trace with hash 451688785, now seen corresponding path program 48 times [2018-10-15 12:44:40,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:44:40,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:44:44,896 INFO L134 CoverageAnalysis]: Checked inductivity of 5688 backedges. 0 proven. 5688 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:44:44,896 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:44:44,896 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:44:44,897 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:44:44,897 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:44:44,897 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:44:44,897 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 99 states. [2018-10-15 12:45:04,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:04,961 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-10-15 12:45:04,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 12:45:04,961 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 250 [2018-10-15 12:45:04,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:04,963 INFO L225 Difference]: With dead ends: 259 [2018-10-15 12:45:04,963 INFO L226 Difference]: Without dead ends: 259 [2018-10-15 12:45:04,965 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4560 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=579, Invalid=37251, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:45:04,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-10-15 12:45:04,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 256. [2018-10-15 12:45:04,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2018-10-15 12:45:04,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 256 transitions. [2018-10-15 12:45:04,968 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 256 transitions. Word has length 250 [2018-10-15 12:45:04,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:04,968 INFO L481 AbstractCegarLoop]: Abstraction has 256 states and 256 transitions. [2018-10-15 12:45:04,969 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:45:04,969 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 256 transitions. [2018-10-15 12:45:04,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2018-10-15 12:45:04,970 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:04,970 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:04,970 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:04,970 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:04,971 INFO L82 PathProgramCache]: Analyzing trace with hash 1706553217, now seen corresponding path program 49 times [2018-10-15 12:45:04,971 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:04,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:09,969 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:09,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:09,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:45:09,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:45:09,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:45:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:45:09,971 INFO L87 Difference]: Start difference. First operand 256 states and 256 transitions. Second operand 101 states. [2018-10-15 12:45:31,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:31,058 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 12:45:31,059 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 150 states. [2018-10-15 12:45:31,059 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 255 [2018-10-15 12:45:31,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:31,060 INFO L225 Difference]: With dead ends: 264 [2018-10-15 12:45:31,061 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 12:45:31,062 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4753 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=591, Invalid=38811, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:45:31,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 12:45:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 261. [2018-10-15 12:45:31,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 12:45:31,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 12:45:31,066 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 255 [2018-10-15 12:45:31,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:31,066 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 12:45:31,066 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:45:31,067 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 12:45:31,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 12:45:31,068 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:31,068 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:31,068 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:31,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:31,069 INFO L82 PathProgramCache]: Analyzing trace with hash 95852369, now seen corresponding path program 50 times [2018-10-15 12:45:31,069 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:31,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:45:36,298 INFO L134 CoverageAnalysis]: Checked inductivity of 6175 backedges. 0 proven. 6175 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:45:36,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:45:36,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:45:36,299 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:45:36,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:45:36,300 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:45:36,300 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 103 states. [2018-10-15 12:45:57,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:45:57,940 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-10-15 12:45:57,940 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 153 states. [2018-10-15 12:45:57,941 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 260 [2018-10-15 12:45:57,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:45:57,943 INFO L225 Difference]: With dead ends: 269 [2018-10-15 12:45:57,943 INFO L226 Difference]: Without dead ends: 269 [2018-10-15 12:45:57,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4950 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=603, Invalid=40403, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:45:57,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-10-15 12:45:57,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 266. [2018-10-15 12:45:57,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-10-15 12:45:57,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 266 transitions. [2018-10-15 12:45:57,947 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 266 transitions. Word has length 260 [2018-10-15 12:45:57,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:45:57,947 INFO L481 AbstractCegarLoop]: Abstraction has 266 states and 266 transitions. [2018-10-15 12:45:57,948 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:45:57,948 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 266 transitions. [2018-10-15 12:45:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2018-10-15 12:45:57,949 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:45:57,949 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:45:57,949 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:45:57,950 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:45:57,950 INFO L82 PathProgramCache]: Analyzing trace with hash 280514945, now seen corresponding path program 51 times [2018-10-15 12:45:57,950 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:45:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:46:03,235 INFO L134 CoverageAnalysis]: Checked inductivity of 6426 backedges. 0 proven. 6426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:46:03,235 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:46:03,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:46:03,235 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:46:03,236 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:46:03,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:46:03,236 INFO L87 Difference]: Start difference. First operand 266 states and 266 transitions. Second operand 105 states.