java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBplTransformed.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_2_true-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:35,359 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:35,361 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:35,380 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:35,381 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:35,384 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:35,386 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:35,388 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:35,393 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:35,394 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:35,396 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:35,397 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:35,398 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:35,399 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:35,401 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:35,410 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:35,414 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:35,416 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:35,421 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:35,422 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:35,426 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:35,427 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:35,430 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:35,430 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:35,430 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:35,434 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:35,435 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:35,436 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:35,437 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:35,441 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:35,441 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:35,442 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:35,442 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:35,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:35,444 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:35,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:35,445 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:55:35,454 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:35,454 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:35,455 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:35,455 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:35,456 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:35,456 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:35,457 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:35,457 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:35,457 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:35,457 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:35,458 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:35,458 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:35,458 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:35,459 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:35,459 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:35,502 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:35,515 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:35,519 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:35,520 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:35,521 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:35,522 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_2_true-unreach-call_true-termination.i_3.bpl [2018-10-15 12:55:35,522 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_2_true-unreach-call_true-termination.i_3.bpl' [2018-10-15 12:55:35,573 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:35,574 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:35,575 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:35,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:35,576 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:35,605 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,617 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,617 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,619 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,621 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,622 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,623 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:35,624 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:35,625 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:35,625 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:35,626 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55: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:55:35,700 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:35,700 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:35,701 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:35,895 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:35,896 INFO L202 PluginConnector]: Adding new model count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:35 BoogieIcfgContainer [2018-10-15 12:55:35,896 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:35,896 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:35,897 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:35,898 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:35,901 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:35" (1/1) ... [2018-10-15 12:55:35,906 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 12:55:35,922 INFO L202 PluginConnector]: Adding new model count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:35 BasicIcfg [2018-10-15 12:55:35,923 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:35,924 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:35,924 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:35,927 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:35,928 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:35" (1/3) ... [2018-10-15 12:55:35,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384371c6 and model type count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:35, skipping insertion in model container [2018-10-15 12:55:35,929 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:35" (2/3) ... [2018-10-15 12:55:35,929 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384371c6 and model type count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:35, skipping insertion in model container [2018-10-15 12:55:35,930 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_2_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:35" (3/3) ... [2018-10-15 12:55:35,931 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_2_true-unreach-call_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 12:55:35,941 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:35,950 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:35,968 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:35,997 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:35,998 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:35,998 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:35,998 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:35,998 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:35,999 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:35,999 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:35,999 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:35,999 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:36,018 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states. [2018-10-15 12:55:36,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:55:36,034 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,035 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,036 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,042 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,043 INFO L82 PathProgramCache]: Analyzing trace with hash -1397248185, now seen corresponding path program 1 times [2018-10-15 12:55:36,098 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,184 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:55:36,186 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:36,187 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:36,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:36,206 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:36,206 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:36,209 INFO L87 Difference]: Start difference. First operand 14 states. Second operand 3 states. [2018-10-15 12:55:36,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,342 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2018-10-15 12:55:36,343 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:36,345 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:55:36,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,362 INFO L225 Difference]: With dead ends: 14 [2018-10-15 12:55:36,362 INFO L226 Difference]: Without dead ends: 14 [2018-10-15 12:55:36,365 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:36,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2018-10-15 12:55:36,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 13. [2018-10-15 12:55:36,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-10-15 12:55:36,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-10-15 12:55:36,410 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-10-15 12:55:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,410 INFO L481 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-10-15 12:55:36,410 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:36,411 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-10-15 12:55:36,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 12:55:36,411 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,411 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,412 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,412 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,412 INFO L82 PathProgramCache]: Analyzing trace with hash -212743127, now seen corresponding path program 1 times [2018-10-15 12:55:36,413 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,494 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:55:36,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 12:55:36,497 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:55:36,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:55:36,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:55:36,498 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 4 states. [2018-10-15 12:55:36,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:36,666 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-10-15 12:55:36,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:55:36,667 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-10-15 12:55:36,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:36,668 INFO L225 Difference]: With dead ends: 16 [2018-10-15 12:55:36,668 INFO L226 Difference]: Without dead ends: 16 [2018-10-15 12:55:36,669 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:55:36,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-10-15 12:55:36,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 15. [2018-10-15 12:55:36,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-15 12:55:36,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-10-15 12:55:36,672 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-10-15 12:55:36,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:36,673 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-10-15 12:55:36,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:55:36,673 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-10-15 12:55:36,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-10-15 12:55:36,674 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:36,674 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:36,674 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:36,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:36,675 INFO L82 PathProgramCache]: Analyzing trace with hash -69715829, now seen corresponding path program 2 times [2018-10-15 12:55:36,676 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:36,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:36,930 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:36,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:36,931 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:36,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:36,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:36,932 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-10-15 12:55:37,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,022 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2018-10-15 12:55:37,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:55:37,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-10-15 12:55:37,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,026 INFO L225 Difference]: With dead ends: 18 [2018-10-15 12:55:37,026 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:55:37,027 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:37,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:55:37,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 12:55:37,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 12:55:37,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-10-15 12:55:37,031 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-10-15 12:55:37,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,031 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-10-15 12:55:37,031 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:37,031 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-10-15 12:55:37,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:55:37,032 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,032 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,033 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,033 INFO L82 PathProgramCache]: Analyzing trace with hash -59435923, now seen corresponding path program 3 times [2018-10-15 12:55:37,034 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,212 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,212 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,212 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:55:37,213 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:55:37,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:55:37,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:55:37,214 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 6 states. [2018-10-15 12:55:37,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,409 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2018-10-15 12:55:37,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:55:37,409 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 16 [2018-10-15 12:55:37,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,410 INFO L225 Difference]: With dead ends: 20 [2018-10-15 12:55:37,410 INFO L226 Difference]: Without dead ends: 20 [2018-10-15 12:55:37,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:55:37,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-10-15 12:55:37,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-10-15 12:55:37,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-10-15 12:55:37,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-10-15 12:55:37,415 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-10-15 12:55:37,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,415 INFO L481 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-10-15 12:55:37,415 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:55:37,415 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-10-15 12:55:37,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-10-15 12:55:37,416 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,416 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,416 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1229619151, now seen corresponding path program 4 times [2018-10-15 12:55:37,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,569 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:55:37,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:55:37,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:55:37,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:37,572 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 7 states. [2018-10-15 12:55:37,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,670 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2018-10-15 12:55:37,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:55:37,672 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 18 [2018-10-15 12:55:37,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,673 INFO L225 Difference]: With dead ends: 22 [2018-10-15 12:55:37,674 INFO L226 Difference]: Without dead ends: 22 [2018-10-15 12:55:37,674 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:55:37,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-10-15 12:55:37,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-10-15 12:55:37,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:55:37,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-15 12:55:37,679 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-10-15 12:55:37,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,679 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-15 12:55:37,679 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:55:37,679 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-10-15 12:55:37,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:55:37,680 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,680 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,681 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,681 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,681 INFO L82 PathProgramCache]: Analyzing trace with hash -1234003279, now seen corresponding path program 5 times [2018-10-15 12:55:37,682 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:37,872 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:37,872 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:37,872 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:55:37,873 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:55:37,873 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:55:37,873 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:55:37,874 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 8 states. [2018-10-15 12:55:37,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:37,948 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2018-10-15 12:55:37,948 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:55:37,948 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-10-15 12:55:37,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:37,949 INFO L225 Difference]: With dead ends: 24 [2018-10-15 12:55:37,949 INFO L226 Difference]: Without dead ends: 24 [2018-10-15 12:55:37,950 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:55:37,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2018-10-15 12:55:37,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2018-10-15 12:55:37,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 12:55:37,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 12:55:37,953 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-10-15 12:55:37,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:37,953 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 12:55:37,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:55:37,954 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 12:55:37,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 12:55:37,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:37,955 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:37,955 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:37,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:37,955 INFO L82 PathProgramCache]: Analyzing trace with hash 2046788883, now seen corresponding path program 6 times [2018-10-15 12:55:37,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:37,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,069 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,070 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,070 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:38,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:38,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:38,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:38,072 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 9 states. [2018-10-15 12:55:38,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,185 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-10-15 12:55:38,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:55:38,186 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-10-15 12:55:38,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,188 INFO L225 Difference]: With dead ends: 26 [2018-10-15 12:55:38,188 INFO L226 Difference]: Without dead ends: 26 [2018-10-15 12:55:38,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:38,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-10-15 12:55:38,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-10-15 12:55:38,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-10-15 12:55:38,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-10-15 12:55:38,193 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-10-15 12:55:38,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,194 INFO L481 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-10-15 12:55:38,194 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:38,194 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-10-15 12:55:38,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-10-15 12:55:38,195 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,195 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,195 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,196 INFO L82 PathProgramCache]: Analyzing trace with hash -1912905995, now seen corresponding path program 7 times [2018-10-15 12:55:38,196 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,342 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,343 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,343 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:55:38,344 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:55:38,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:55:38,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:55:38,345 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 10 states. [2018-10-15 12:55:38,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,659 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 12:55:38,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:55:38,660 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2018-10-15 12:55:38,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,661 INFO L225 Difference]: With dead ends: 28 [2018-10-15 12:55:38,661 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 12:55:38,662 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:55:38,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 12:55:38,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 12:55:38,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 12:55:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-10-15 12:55:38,665 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-10-15 12:55:38,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,666 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-10-15 12:55:38,666 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:55:38,666 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-10-15 12:55:38,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:55:38,667 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,667 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,667 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,668 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,668 INFO L82 PathProgramCache]: Analyzing trace with hash -1838659497, now seen corresponding path program 8 times [2018-10-15 12:55:38,669 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,854 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,854 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:38,855 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:38,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:38,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:38,856 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 11 states. [2018-10-15 12:55:38,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,942 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2018-10-15 12:55:38,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:55:38,944 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 26 [2018-10-15 12:55:38,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,946 INFO L225 Difference]: With dead ends: 30 [2018-10-15 12:55:38,946 INFO L226 Difference]: Without dead ends: 30 [2018-10-15 12:55:38,947 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-10-15 12:55:38,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-10-15 12:55:38,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:55:38,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:55:38,950 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-10-15 12:55:38,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,951 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:55:38,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:38,951 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:55:38,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:55:38,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,952 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,952 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,953 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,953 INFO L82 PathProgramCache]: Analyzing trace with hash 792748345, now seen corresponding path program 9 times [2018-10-15 12:55:38,954 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,112 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:55:39,113 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,113 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:55:39,114 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:55:39,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:55:39,114 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:55:39,115 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 12 states. [2018-10-15 12:55:39,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,488 INFO L93 Difference]: Finished difference Result 32 states and 32 transitions. [2018-10-15 12:55:39,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:55:39,489 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 28 [2018-10-15 12:55:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,490 INFO L225 Difference]: With dead ends: 32 [2018-10-15 12:55:39,490 INFO L226 Difference]: Without dead ends: 32 [2018-10-15 12:55:39,490 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:55:39,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-10-15 12:55:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-10-15 12:55:39,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-10-15 12:55:39,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-10-15 12:55:39,494 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-10-15 12:55:39,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,495 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-10-15 12:55:39,495 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:55:39,495 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-10-15 12:55:39,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-10-15 12:55:39,496 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,496 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,496 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,496 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,497 INFO L82 PathProgramCache]: Analyzing trace with hash -160052837, now seen corresponding path program 10 times [2018-10-15 12:55:39,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,705 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,706 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:39,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:39,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:39,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:39,707 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 13 states. [2018-10-15 12:55:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,807 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2018-10-15 12:55:39,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:55:39,807 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 30 [2018-10-15 12:55:39,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,808 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:55:39,808 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:55:39,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:39,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:55:39,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 12:55:39,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:55:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 12:55:39,813 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-10-15 12:55:39,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,813 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 12:55:39,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:39,814 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 12:55:39,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 12:55:39,815 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,815 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,815 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,816 INFO L82 PathProgramCache]: Analyzing trace with hash -973954691, now seen corresponding path program 11 times [2018-10-15 12:55:39,817 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,061 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:55:40,062 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:55:40,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:55:40,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:55:40,062 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 14 states. [2018-10-15 12:55:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,150 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-10-15 12:55:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:55:40,151 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 32 [2018-10-15 12:55:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,151 INFO L225 Difference]: With dead ends: 36 [2018-10-15 12:55:40,151 INFO L226 Difference]: Without dead ends: 36 [2018-10-15 12:55:40,152 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:55:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-10-15 12:55:40,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2018-10-15 12:55:40,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-10-15 12:55:40,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-10-15 12:55:40,155 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-10-15 12:55:40,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,156 INFO L481 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-10-15 12:55:40,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:55:40,156 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-10-15 12:55:40,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-10-15 12:55:40,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,157 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,157 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1449588513, now seen corresponding path program 12 times [2018-10-15 12:55:40,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,451 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,452 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,452 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:40,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:40,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:40,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:40,453 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 15 states. [2018-10-15 12:55:40,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,560 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-10-15 12:55:40,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:55:40,561 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 34 [2018-10-15 12:55:40,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,562 INFO L225 Difference]: With dead ends: 38 [2018-10-15 12:55:40,563 INFO L226 Difference]: Without dead ends: 38 [2018-10-15 12:55:40,563 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:40,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2018-10-15 12:55:40,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2018-10-15 12:55:40,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-10-15 12:55:40,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-10-15 12:55:40,567 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-10-15 12:55:40,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,567 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-10-15 12:55:40,568 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:40,568 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-10-15 12:55:40,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-10-15 12:55:40,568 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,569 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,569 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,569 INFO L82 PathProgramCache]: Analyzing trace with hash 1027809217, now seen corresponding path program 13 times [2018-10-15 12:55:40,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,814 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,814 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,814 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:55:40,815 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:55:40,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:55:40,815 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:55:40,816 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 16 states. [2018-10-15 12:55:40,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,906 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2018-10-15 12:55:40,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:55:40,906 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 36 [2018-10-15 12:55:40,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,907 INFO L225 Difference]: With dead ends: 40 [2018-10-15 12:55:40,907 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 12:55:40,908 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:55:40,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 12:55:40,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 12:55:40,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 12:55:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-10-15 12:55:40,912 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-10-15 12:55:40,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,912 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-10-15 12:55:40,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:55:40,912 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-10-15 12:55:40,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 12:55:40,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,913 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,914 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,914 INFO L82 PathProgramCache]: Analyzing trace with hash -1899821533, now seen corresponding path program 14 times [2018-10-15 12:55:40,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,129 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,130 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,130 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:41,131 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:41,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:41,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:41,131 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 17 states. [2018-10-15 12:55:41,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,235 INFO L93 Difference]: Finished difference Result 42 states and 42 transitions. [2018-10-15 12:55:41,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:55:41,235 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 38 [2018-10-15 12:55:41,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,237 INFO L225 Difference]: With dead ends: 42 [2018-10-15 12:55:41,237 INFO L226 Difference]: Without dead ends: 42 [2018-10-15 12:55:41,238 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:41,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-10-15 12:55:41,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-10-15 12:55:41,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-10-15 12:55:41,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-10-15 12:55:41,242 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-10-15 12:55:41,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,242 INFO L481 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-10-15 12:55:41,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:41,242 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-10-15 12:55:41,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-10-15 12:55:41,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,243 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,243 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,244 INFO L82 PathProgramCache]: Analyzing trace with hash 2145573893, now seen corresponding path program 15 times [2018-10-15 12:55:41,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,479 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:55:41,481 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:55:41,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:55:41,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:55:41,482 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 18 states. [2018-10-15 12:55:41,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,585 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2018-10-15 12:55:41,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:55:41,585 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 40 [2018-10-15 12:55:41,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,586 INFO L225 Difference]: With dead ends: 44 [2018-10-15 12:55:41,587 INFO L226 Difference]: Without dead ends: 44 [2018-10-15 12:55:41,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:55:41,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-10-15 12:55:41,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2018-10-15 12:55:41,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 12:55:41,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 12:55:41,592 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-10-15 12:55:41,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,592 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 12:55:41,592 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:55:41,592 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 12:55:41,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 12:55:41,593 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,593 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,594 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,594 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1469791897, now seen corresponding path program 16 times [2018-10-15 12:55:41,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,326 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,327 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,327 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:42,327 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:42,327 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:42,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:42,328 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 19 states. [2018-10-15 12:55:42,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,593 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-10-15 12:55:42,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:55:42,594 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 42 [2018-10-15 12:55:42,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,595 INFO L225 Difference]: With dead ends: 46 [2018-10-15 12:55:42,595 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:55:42,595 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:42,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:55:42,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 12:55:42,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:55:42,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-10-15 12:55:42,599 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-10-15 12:55:42,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,599 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-10-15 12:55:42,599 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:42,599 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-10-15 12:55:42,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:55:42,600 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,600 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,600 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1207773623, now seen corresponding path program 17 times [2018-10-15 12:55:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,889 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:55:42,890 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:55:42,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:55:42,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:55:42,891 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 20 states. [2018-10-15 12:55:42,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,994 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-10-15 12:55:42,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:55:42,994 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 44 [2018-10-15 12:55:42,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,995 INFO L225 Difference]: With dead ends: 48 [2018-10-15 12:55:42,996 INFO L226 Difference]: Without dead ends: 48 [2018-10-15 12:55:42,997 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:55:42,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-10-15 12:55:42,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 47. [2018-10-15 12:55:43,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:55:43,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:55:43,000 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-10-15 12:55:43,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,001 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:55:43,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:55:43,001 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:55:43,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:55:43,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,002 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,002 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1483684523, now seen corresponding path program 18 times [2018-10-15 12:55:43,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,252 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,253 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,253 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:43,254 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:43,254 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:43,254 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:43,254 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 21 states. [2018-10-15 12:55:43,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,496 INFO L93 Difference]: Finished difference Result 50 states and 50 transitions. [2018-10-15 12:55:43,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:55:43,496 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 46 [2018-10-15 12:55:43,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,497 INFO L225 Difference]: With dead ends: 50 [2018-10-15 12:55:43,497 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 12:55:43,498 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:43,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 12:55:43,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-10-15 12:55:43,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-10-15 12:55:43,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-10-15 12:55:43,501 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-10-15 12:55:43,501 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,501 INFO L481 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-10-15 12:55:43,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:43,501 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-10-15 12:55:43,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-10-15 12:55:43,502 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,502 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,502 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,502 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1890316659, now seen corresponding path program 19 times [2018-10-15 12:55:43,503 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,758 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,759 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:55:43,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:55:43,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:55:43,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:55:43,760 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 22 states. [2018-10-15 12:55:43,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,874 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2018-10-15 12:55:43,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:55:43,874 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 48 [2018-10-15 12:55:43,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,875 INFO L225 Difference]: With dead ends: 52 [2018-10-15 12:55:43,875 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 12:55:43,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:55:43,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 12:55:43,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 12:55:43,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:55:43,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-10-15 12:55:43,879 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-10-15 12:55:43,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,879 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-10-15 12:55:43,879 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:55:43,880 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-10-15 12:55:43,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:55:43,880 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,880 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,881 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,881 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,881 INFO L82 PathProgramCache]: Analyzing trace with hash -1605144081, now seen corresponding path program 20 times [2018-10-15 12:55:43,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,202 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:44,202 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:44,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:44,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:44,203 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 23 states. [2018-10-15 12:55:44,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,357 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 12:55:44,358 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:55:44,358 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 50 [2018-10-15 12:55:44,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,359 INFO L225 Difference]: With dead ends: 54 [2018-10-15 12:55:44,359 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:55:44,359 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:44,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:55:44,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-10-15 12:55:44,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 12:55:44,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 12:55:44,363 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-10-15 12:55:44,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,363 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 12:55:44,363 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:44,363 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 12:55:44,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 12:55:44,364 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,364 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,364 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,364 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,365 INFO L82 PathProgramCache]: Analyzing trace with hash 1862763729, now seen corresponding path program 21 times [2018-10-15 12:55:44,365 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,675 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,675 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:55:44,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:55:44,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:55:44,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:55:44,677 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 24 states. [2018-10-15 12:55:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,879 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-10-15 12:55:44,882 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:55:44,882 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 52 [2018-10-15 12:55:44,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,883 INFO L225 Difference]: With dead ends: 56 [2018-10-15 12:55:44,883 INFO L226 Difference]: Without dead ends: 56 [2018-10-15 12:55:44,883 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:55:44,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-10-15 12:55:44,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2018-10-15 12:55:44,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-10-15 12:55:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-10-15 12:55:44,885 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-10-15 12:55:44,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,886 INFO L481 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-10-15 12:55:44,886 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:55:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-10-15 12:55:44,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-10-15 12:55:44,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,887 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,887 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1627547443, now seen corresponding path program 22 times [2018-10-15 12:55:44,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,379 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:45,379 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:45,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:45,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:45,380 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 25 states. [2018-10-15 12:55:45,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,446 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:55:45,447 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:55:45,447 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 54 [2018-10-15 12:55:45,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,448 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:55:45,448 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:55:45,449 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:45,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:55:45,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 12:55:45,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 12:55:45,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-10-15 12:55:45,452 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-10-15 12:55:45,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,452 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-10-15 12:55:45,452 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:45,452 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-10-15 12:55:45,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 12:55:45,453 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,453 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,453 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,453 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,453 INFO L82 PathProgramCache]: Analyzing trace with hash -1077004011, now seen corresponding path program 23 times [2018-10-15 12:55:45,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,789 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,789 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,789 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:55:45,790 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:55:45,790 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:55:45,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:55:45,790 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 26 states. [2018-10-15 12:55:45,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,888 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2018-10-15 12:55:45,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:55:45,889 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 56 [2018-10-15 12:55:45,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,889 INFO L225 Difference]: With dead ends: 60 [2018-10-15 12:55:45,890 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 12:55:45,890 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:55:45,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 12:55:45,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-10-15 12:55:45,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-10-15 12:55:45,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-10-15 12:55:45,893 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-10-15 12:55:45,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,893 INFO L481 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-10-15 12:55:45,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:55:45,893 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-10-15 12:55:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-10-15 12:55:45,894 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,894 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,894 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,894 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,894 INFO L82 PathProgramCache]: Analyzing trace with hash -1695737225, now seen corresponding path program 24 times [2018-10-15 12:55:45,895 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,695 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:46,696 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:46,696 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:46,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:46,697 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 27 states. [2018-10-15 12:55:46,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,848 INFO L93 Difference]: Finished difference Result 62 states and 62 transitions. [2018-10-15 12:55:46,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:55:46,849 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 58 [2018-10-15 12:55:46,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,850 INFO L225 Difference]: With dead ends: 62 [2018-10-15 12:55:46,850 INFO L226 Difference]: Without dead ends: 62 [2018-10-15 12:55:46,851 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:46,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-10-15 12:55:46,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-10-15 12:55:46,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-10-15 12:55:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-10-15 12:55:46,853 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-10-15 12:55:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,853 INFO L481 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-10-15 12:55:46,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:46,853 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-10-15 12:55:46,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-10-15 12:55:46,854 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,854 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,854 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,855 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,855 INFO L82 PathProgramCache]: Analyzing trace with hash 702098265, now seen corresponding path program 25 times [2018-10-15 12:55:46,855 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,727 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,727 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:55:47,728 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:55:47,728 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:55:47,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:55:47,729 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 28 states. [2018-10-15 12:55:47,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:47,885 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 12:55:47,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:55:47,886 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 60 [2018-10-15 12:55:47,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:47,886 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:55:47,886 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:55:47,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:55:47,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:55:47,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 12:55:47,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:55:47,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 12:55:47,888 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-10-15 12:55:47,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:47,889 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 12:55:47,889 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:55:47,889 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 12:55:47,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 12:55:47,889 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:47,890 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:47,890 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:47,890 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:47,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1375433797, now seen corresponding path program 26 times [2018-10-15 12:55:47,891 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:48,681 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:48,682 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:48,682 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:48,682 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:48,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:48,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:48,683 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 29 states. [2018-10-15 12:55:48,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,820 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-10-15 12:55:48,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:55:48,820 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 62 [2018-10-15 12:55:48,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,821 INFO L225 Difference]: With dead ends: 66 [2018-10-15 12:55:48,821 INFO L226 Difference]: Without dead ends: 66 [2018-10-15 12:55:48,822 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:48,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2018-10-15 12:55:48,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 65. [2018-10-15 12:55:48,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:55:48,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:55:48,824 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-10-15 12:55:48,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,825 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:55:48,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:48,825 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:55:48,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:55:48,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,825 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,826 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,826 INFO L82 PathProgramCache]: Analyzing trace with hash -723952739, now seen corresponding path program 27 times [2018-10-15 12:55:48,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,985 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,986 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,986 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:55:49,986 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:55:49,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:55:49,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:55:49,987 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 30 states. [2018-10-15 12:55:50,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,121 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-10-15 12:55:50,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:55:50,122 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 64 [2018-10-15 12:55:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,123 INFO L225 Difference]: With dead ends: 68 [2018-10-15 12:55:50,123 INFO L226 Difference]: Without dead ends: 68 [2018-10-15 12:55:50,123 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:55:50,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2018-10-15 12:55:50,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 67. [2018-10-15 12:55:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-10-15 12:55:50,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-10-15 12:55:50,125 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-10-15 12:55:50,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,125 INFO L481 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-10-15 12:55:50,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:55:50,125 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-10-15 12:55:50,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-10-15 12:55:50,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,126 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,126 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1715881217, now seen corresponding path program 28 times [2018-10-15 12:55:50,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:50,551 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:50,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:50,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:50,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:50,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:50,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:50,553 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 31 states. [2018-10-15 12:55:50,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,687 INFO L93 Difference]: Finished difference Result 70 states and 70 transitions. [2018-10-15 12:55:50,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:55:50,688 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 66 [2018-10-15 12:55:50,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,689 INFO L225 Difference]: With dead ends: 70 [2018-10-15 12:55:50,689 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 12:55:50,689 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:50,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 12:55:50,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 12:55:50,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 12:55:50,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-10-15 12:55:50,692 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-10-15 12:55:50,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,692 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-10-15 12:55:50,692 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:50,692 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-10-15 12:55:50,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 12:55:50,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,693 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,693 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,694 INFO L82 PathProgramCache]: Analyzing trace with hash -1476408863, now seen corresponding path program 29 times [2018-10-15 12:55:50,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:51,749 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:51,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:51,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:55:51,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:55:51,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:55:51,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:55:51,750 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 32 states. [2018-10-15 12:55:51,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,917 INFO L93 Difference]: Finished difference Result 72 states and 72 transitions. [2018-10-15 12:55:51,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:55:51,918 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 68 [2018-10-15 12:55:51,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,919 INFO L225 Difference]: With dead ends: 72 [2018-10-15 12:55:51,919 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:55:51,920 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:55:51,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:55:51,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-10-15 12:55:51,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-10-15 12:55:51,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-10-15 12:55:51,922 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-10-15 12:55:51,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,922 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-10-15 12:55:51,922 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:55:51,922 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-10-15 12:55:51,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-10-15 12:55:51,922 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,922 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,923 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,923 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,923 INFO L82 PathProgramCache]: Analyzing trace with hash 1023256643, now seen corresponding path program 30 times [2018-10-15 12:55:51,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:52,775 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:52,775 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:52,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:52,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:52,776 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:52,776 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:52,776 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 33 states. [2018-10-15 12:55:53,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:53,053 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 12:55:53,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:55:53,054 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 70 [2018-10-15 12:55:53,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:53,055 INFO L225 Difference]: With dead ends: 74 [2018-10-15 12:55:53,055 INFO L226 Difference]: Without dead ends: 74 [2018-10-15 12:55:53,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2018-10-15 12:55:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 73. [2018-10-15 12:55:53,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 12:55:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 12:55:53,059 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-10-15 12:55:53,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:53,059 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 12:55:53,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 12:55:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 12:55:53,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:53,060 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:53,060 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:53,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:53,061 INFO L82 PathProgramCache]: Analyzing trace with hash -1979877851, now seen corresponding path program 31 times [2018-10-15 12:55:53,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:53,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:53,709 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:53,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:55:53,710 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:55:53,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:55:53,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:55:53,711 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 34 states. [2018-10-15 12:55:54,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:54,086 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 12:55:54,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:55:54,087 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 72 [2018-10-15 12:55:54,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:54,088 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:55:54,089 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:55:54,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:55:54,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:55:54,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 12:55:54,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:55:54,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-10-15 12:55:54,092 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-10-15 12:55:54,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:54,092 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-10-15 12:55:54,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:55:54,093 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-10-15 12:55:54,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:55:54,093 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:54,093 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:54,094 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:54,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:54,094 INFO L82 PathProgramCache]: Analyzing trace with hash -1774103673, now seen corresponding path program 32 times [2018-10-15 12:55:54,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:54,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:55,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:55,102 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:55,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:55,102 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:55,102 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:55,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:55,103 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 35 states. [2018-10-15 12:55:55,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:55,304 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-10-15 12:55:55,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:55:55,305 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 74 [2018-10-15 12:55:55,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:55,305 INFO L225 Difference]: With dead ends: 78 [2018-10-15 12:55:55,306 INFO L226 Difference]: Without dead ends: 78 [2018-10-15 12:55:55,307 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:55,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2018-10-15 12:55:55,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 77. [2018-10-15 12:55:55,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-10-15 12:55:55,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-10-15 12:55:55,309 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-10-15 12:55:55,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:55,310 INFO L481 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-10-15 12:55:55,310 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:55,310 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-10-15 12:55:55,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-10-15 12:55:55,310 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:55,310 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:55,311 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:55,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:55,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1593614231, now seen corresponding path program 33 times [2018-10-15 12:55:55,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:55,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:55,788 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:55,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:55,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:55:55,789 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:55:55,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:55:55,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:55:55,790 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 36 states. [2018-10-15 12:55:55,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:55,990 INFO L93 Difference]: Finished difference Result 80 states and 80 transitions. [2018-10-15 12:55:55,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:55:55,990 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 76 [2018-10-15 12:55:55,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:55,991 INFO L225 Difference]: With dead ends: 80 [2018-10-15 12:55:55,991 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 12:55:55,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:55:55,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 12:55:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-10-15 12:55:55,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-10-15 12:55:55,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-10-15 12:55:55,993 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-10-15 12:55:55,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:55,993 INFO L481 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-10-15 12:55:55,993 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:55:55,993 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-10-15 12:55:55,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-10-15 12:55:55,995 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:55,995 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:55,995 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:55,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:55,996 INFO L82 PathProgramCache]: Analyzing trace with hash 58047691, now seen corresponding path program 34 times [2018-10-15 12:55:55,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:56,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:56,921 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:56,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:56,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:56,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:56,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:56,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:56,923 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 37 states. [2018-10-15 12:55:57,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,163 INFO L93 Difference]: Finished difference Result 82 states and 82 transitions. [2018-10-15 12:55:57,163 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:55:57,163 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 78 [2018-10-15 12:55:57,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,164 INFO L225 Difference]: With dead ends: 82 [2018-10-15 12:55:57,164 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 12:55:57,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:57,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 12:55:57,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 12:55:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:55:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-10-15 12:55:57,167 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-10-15 12:55:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,167 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-10-15 12:55:57,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-10-15 12:55:57,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:55:57,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,167 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:57,168 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,168 INFO L82 PathProgramCache]: Analyzing trace with hash -1832744787, now seen corresponding path program 35 times [2018-10-15 12:55:57,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:55:58,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:55:58,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:55:58,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:55:58,740 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 38 states. [2018-10-15 12:55:58,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:58,930 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 12:55:58,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:55:58,931 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 80 [2018-10-15 12:55:58,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:58,932 INFO L225 Difference]: With dead ends: 84 [2018-10-15 12:55:58,932 INFO L226 Difference]: Without dead ends: 84 [2018-10-15 12:55:58,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:55:58,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2018-10-15 12:55:58,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 83. [2018-10-15 12:55:58,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:55:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:55:58,935 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-10-15 12:55:58,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:58,936 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:55:58,936 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:55:58,936 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:55:58,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:55:58,937 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:58,937 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:58,937 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:58,937 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:58,937 INFO L82 PathProgramCache]: Analyzing trace with hash -2113149937, now seen corresponding path program 36 times [2018-10-15 12:55:58,938 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:58,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:59,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:59,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:59,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:59,608 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:59,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:59,609 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:59,609 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 39 states. [2018-10-15 12:55:59,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,829 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-10-15 12:55:59,829 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:55:59,829 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 82 [2018-10-15 12:55:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,830 INFO L225 Difference]: With dead ends: 86 [2018-10-15 12:55:59,830 INFO L226 Difference]: Without dead ends: 86 [2018-10-15 12:55:59,831 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:59,831 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2018-10-15 12:55:59,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 85. [2018-10-15 12:55:59,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-10-15 12:55:59,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-10-15 12:55:59,834 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-10-15 12:55:59,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,834 INFO L481 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-10-15 12:55:59,834 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:59,835 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-10-15 12:55:59,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-10-15 12:55:59,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,835 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,836 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,836 INFO L82 PathProgramCache]: Analyzing trace with hash -999559439, now seen corresponding path program 37 times [2018-10-15 12:55:59,837 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:00,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:00,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:00,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:56:00,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:56:00,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:56:00,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:56:00,592 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 40 states. [2018-10-15 12:56:00,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:00,747 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-10-15 12:56:00,747 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:56:00,747 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 84 [2018-10-15 12:56:00,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:00,748 INFO L225 Difference]: With dead ends: 88 [2018-10-15 12:56:00,749 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:56:00,750 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:56:00,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:56:00,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 12:56:00,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 12:56:00,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-10-15 12:56:00,752 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-10-15 12:56:00,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:00,753 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-10-15 12:56:00,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:56:00,753 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-10-15 12:56:00,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:56:00,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:00,753 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:00,754 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:00,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:00,754 INFO L82 PathProgramCache]: Analyzing trace with hash -285947565, now seen corresponding path program 38 times [2018-10-15 12:56:00,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:00,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:01,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:01,582 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:01,582 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:56:01,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:56:01,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:56:01,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:56:01,584 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 41 states. [2018-10-15 12:56:01,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:01,793 INFO L93 Difference]: Finished difference Result 90 states and 90 transitions. [2018-10-15 12:56:01,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:56:01,793 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 86 [2018-10-15 12:56:01,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:01,794 INFO L225 Difference]: With dead ends: 90 [2018-10-15 12:56:01,794 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:56:01,795 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:56:01,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:56:01,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-10-15 12:56:01,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-10-15 12:56:01,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-10-15 12:56:01,796 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-10-15 12:56:01,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:01,797 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-10-15 12:56:01,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:56:01,797 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-10-15 12:56:01,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-10-15 12:56:01,797 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:01,798 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:01,798 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:01,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:01,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1699704011, now seen corresponding path program 39 times [2018-10-15 12:56:01,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:01,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:02,797 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:02,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:02,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:56:02,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:56:02,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:56:02,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:56:02,799 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 42 states. [2018-10-15 12:56:02,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:02,923 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2018-10-15 12:56:02,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:56:02,924 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 88 [2018-10-15 12:56:02,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:02,925 INFO L225 Difference]: With dead ends: 92 [2018-10-15 12:56:02,925 INFO L226 Difference]: Without dead ends: 92 [2018-10-15 12:56:02,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:56:02,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-10-15 12:56:02,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-10-15 12:56:02,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-10-15 12:56:02,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-10-15 12:56:02,928 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-10-15 12:56:02,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:02,928 INFO L481 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-10-15 12:56:02,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:56:02,929 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-10-15 12:56:02,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-10-15 12:56:02,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:02,929 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:02,929 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:02,929 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:02,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1184984215, now seen corresponding path program 40 times [2018-10-15 12:56:02,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:02,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:03,674 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:03,675 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:56:03,675 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:56:03,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:56:03,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:56:03,676 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 43 states. [2018-10-15 12:56:03,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:03,882 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 12:56:03,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:56:03,884 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 90 [2018-10-15 12:56:03,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:03,884 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:56:03,884 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:56:03,885 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:56:03,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:56:03,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 12:56:03,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 12:56:03,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 12:56:03,887 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-10-15 12:56:03,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:03,887 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 12:56:03,887 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:56:03,887 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 12:56:03,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 12:56:03,888 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:03,888 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:03,888 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:03,888 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:03,888 INFO L82 PathProgramCache]: Analyzing trace with hash -1178503815, now seen corresponding path program 41 times [2018-10-15 12:56:03,889 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:03,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:04,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:04,749 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:04,749 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:56:04,750 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:56:04,750 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:56:04,750 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:56:04,751 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 44 states. [2018-10-15 12:56:05,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:05,096 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-10-15 12:56:05,097 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:56:05,097 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 92 [2018-10-15 12:56:05,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:05,098 INFO L225 Difference]: With dead ends: 96 [2018-10-15 12:56:05,098 INFO L226 Difference]: Without dead ends: 96 [2018-10-15 12:56:05,099 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:56:05,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2018-10-15 12:56:05,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2018-10-15 12:56:05,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-10-15 12:56:05,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-10-15 12:56:05,101 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-10-15 12:56:05,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:05,101 INFO L481 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-10-15 12:56:05,101 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:56:05,102 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-10-15 12:56:05,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-10-15 12:56:05,102 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:05,102 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:05,102 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:05,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:05,103 INFO L82 PathProgramCache]: Analyzing trace with hash -452801061, now seen corresponding path program 42 times [2018-10-15 12:56:05,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:05,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:05,911 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:05,911 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:05,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:56:05,912 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:56:05,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:56:05,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:56:05,913 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 45 states. [2018-10-15 12:56:06,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:06,144 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-10-15 12:56:06,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:56:06,151 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 94 [2018-10-15 12:56:06,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:06,152 INFO L225 Difference]: With dead ends: 98 [2018-10-15 12:56:06,152 INFO L226 Difference]: Without dead ends: 98 [2018-10-15 12:56:06,153 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:56:06,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2018-10-15 12:56:06,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2018-10-15 12:56:06,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-10-15 12:56:06,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-10-15 12:56:06,155 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-10-15 12:56:06,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:06,156 INFO L481 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-10-15 12:56:06,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:56:06,156 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-10-15 12:56:06,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-10-15 12:56:06,156 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:06,157 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:06,157 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:06,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:06,157 INFO L82 PathProgramCache]: Analyzing trace with hash 1162843581, now seen corresponding path program 43 times [2018-10-15 12:56:06,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:06,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:06,978 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:06,978 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:06,978 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:56:06,979 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:56:06,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:56:06,980 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:56:06,980 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 46 states. [2018-10-15 12:56:07,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:07,581 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2018-10-15 12:56:07,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:56:07,581 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 96 [2018-10-15 12:56:07,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:07,582 INFO L225 Difference]: With dead ends: 100 [2018-10-15 12:56:07,582 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 12:56:07,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:56:07,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 12:56:07,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 12:56:07,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:56:07,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-10-15 12:56:07,585 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-10-15 12:56:07,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:07,586 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-10-15 12:56:07,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:56:07,586 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-10-15 12:56:07,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:56:07,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:07,587 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:07,587 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:07,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:07,587 INFO L82 PathProgramCache]: Analyzing trace with hash -980816609, now seen corresponding path program 44 times [2018-10-15 12:56:07,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:07,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:10,255 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:10,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:10,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:56:10,256 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:56:10,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:56:10,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:56:10,256 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 47 states. [2018-10-15 12:56:10,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:10,468 INFO L93 Difference]: Finished difference Result 102 states and 102 transitions. [2018-10-15 12:56:10,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:56:10,468 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 98 [2018-10-15 12:56:10,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:10,469 INFO L225 Difference]: With dead ends: 102 [2018-10-15 12:56:10,469 INFO L226 Difference]: Without dead ends: 102 [2018-10-15 12:56:10,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:56:10,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-10-15 12:56:10,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-10-15 12:56:10,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:56:10,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:56:10,471 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-10-15 12:56:10,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:10,471 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:56:10,471 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:56:10,472 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:56:10,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:56:10,472 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:10,472 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:10,472 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:10,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:10,473 INFO L82 PathProgramCache]: Analyzing trace with hash 546042881, now seen corresponding path program 45 times [2018-10-15 12:56:10,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:10,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:11,519 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:11,519 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:11,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:56:11,519 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:56:11,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:56:11,520 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:56:11,520 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 48 states. [2018-10-15 12:56:11,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:11,702 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 12:56:11,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:56:11,702 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 100 [2018-10-15 12:56:11,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:11,703 INFO L225 Difference]: With dead ends: 104 [2018-10-15 12:56:11,703 INFO L226 Difference]: Without dead ends: 104 [2018-10-15 12:56:11,704 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:56:11,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2018-10-15 12:56:11,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2018-10-15 12:56:11,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 12:56:11,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 12:56:11,707 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-10-15 12:56:11,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:11,707 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 12:56:11,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:56:11,708 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 12:56:11,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 12:56:11,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:11,708 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:11,708 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:11,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:11,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1020802461, now seen corresponding path program 46 times [2018-10-15 12:56:11,709 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:11,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:12,870 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:12,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:12,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:12,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:12,872 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:12,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:12,872 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 49 states. [2018-10-15 12:56:13,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:13,120 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-10-15 12:56:13,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:56:13,121 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 102 [2018-10-15 12:56:13,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:13,122 INFO L225 Difference]: With dead ends: 106 [2018-10-15 12:56:13,122 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:56:13,122 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:13,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:56:13,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 12:56:13,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:56:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-10-15 12:56:13,125 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-10-15 12:56:13,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:13,125 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-10-15 12:56:13,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:13,125 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-10-15 12:56:13,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 12:56:13,126 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:13,126 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:13,126 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:13,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:13,126 INFO L82 PathProgramCache]: Analyzing trace with hash 774344773, now seen corresponding path program 47 times [2018-10-15 12:56:13,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:13,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:14,061 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:14,061 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:14,061 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:56:14,061 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:56:14,062 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:56:14,062 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:56:14,062 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 50 states. [2018-10-15 12:56:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:14,315 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-10-15 12:56:14,315 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:56:14,315 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 104 [2018-10-15 12:56:14,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:14,316 INFO L225 Difference]: With dead ends: 108 [2018-10-15 12:56:14,317 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:56:14,317 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:56:14,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:56:14,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 107. [2018-10-15 12:56:14,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-10-15 12:56:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-10-15 12:56:14,320 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-10-15 12:56:14,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:14,320 INFO L481 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-10-15 12:56:14,320 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:56:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-10-15 12:56:14,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-10-15 12:56:14,321 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:14,321 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:14,321 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:14,321 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:14,322 INFO L82 PathProgramCache]: Analyzing trace with hash -666016345, now seen corresponding path program 48 times [2018-10-15 12:56:14,322 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:14,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:15,486 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:15,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:15,486 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:15,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:15,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:15,487 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 51 states. [2018-10-15 12:56:16,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:16,028 INFO L93 Difference]: Finished difference Result 110 states and 110 transitions. [2018-10-15 12:56:16,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:56:16,028 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 106 [2018-10-15 12:56:16,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:16,029 INFO L225 Difference]: With dead ends: 110 [2018-10-15 12:56:16,029 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 12:56:16,030 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:16,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 12:56:16,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-10-15 12:56:16,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-10-15 12:56:16,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-10-15 12:56:16,032 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-10-15 12:56:16,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:16,032 INFO L481 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-10-15 12:56:16,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:16,033 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-10-15 12:56:16,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-10-15 12:56:16,033 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:16,033 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:16,034 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:16,034 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:16,034 INFO L82 PathProgramCache]: Analyzing trace with hash -1873581431, now seen corresponding path program 49 times [2018-10-15 12:56:16,035 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:17,460 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:17,460 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:17,460 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:56:17,460 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:56:17,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:56:17,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:56:17,461 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 52 states. [2018-10-15 12:56:17,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:17,732 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 12:56:17,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:56:17,732 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 108 [2018-10-15 12:56:17,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:17,733 INFO L225 Difference]: With dead ends: 112 [2018-10-15 12:56:17,733 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 12:56:17,734 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:56:17,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 12:56:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 12:56:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:56:17,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-10-15 12:56:17,736 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-10-15 12:56:17,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:17,737 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-10-15 12:56:17,737 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:56:17,737 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-10-15 12:56:17,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:56:17,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:17,738 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:17,738 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:17,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:17,739 INFO L82 PathProgramCache]: Analyzing trace with hash 1592508139, now seen corresponding path program 50 times [2018-10-15 12:56:17,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:18,868 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:18,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:18,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:18,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:18,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:18,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:18,870 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 53 states. [2018-10-15 12:56:19,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:19,042 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 12:56:19,042 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:56:19,042 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 110 [2018-10-15 12:56:19,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:19,044 INFO L225 Difference]: With dead ends: 114 [2018-10-15 12:56:19,044 INFO L226 Difference]: Without dead ends: 114 [2018-10-15 12:56:19,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:19,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2018-10-15 12:56:19,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2018-10-15 12:56:19,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 12:56:19,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 12:56:19,047 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-10-15 12:56:19,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:19,047 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 12:56:19,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:19,048 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 12:56:19,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 12:56:19,048 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:19,048 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:19,049 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:19,049 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:19,049 INFO L82 PathProgramCache]: Analyzing trace with hash -390036787, now seen corresponding path program 51 times [2018-10-15 12:56:19,050 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:19,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:20,496 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:20,496 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-15 12:56:20,496 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-15 12:56:20,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-15 12:56:20,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:56:20,497 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 54 states. [2018-10-15 12:56:20,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:20,738 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2018-10-15 12:56:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-15 12:56:20,739 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 112 [2018-10-15 12:56:20,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:20,740 INFO L225 Difference]: With dead ends: 116 [2018-10-15 12:56:20,740 INFO L226 Difference]: Without dead ends: 116 [2018-10-15 12:56:20,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1431, Invalid=1431, Unknown=0, NotChecked=0, Total=2862 [2018-10-15 12:56:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2018-10-15 12:56:20,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2018-10-15 12:56:20,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-10-15 12:56:20,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-10-15 12:56:20,745 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-10-15 12:56:20,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:20,745 INFO L481 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-10-15 12:56:20,745 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-15 12:56:20,745 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-10-15 12:56:20,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-10-15 12:56:20,746 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:20,746 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:20,746 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:20,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:20,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1349768751, now seen corresponding path program 52 times [2018-10-15 12:56:20,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:21,944 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:21,944 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:21,944 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:21,944 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:21,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:21,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:21,945 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 55 states. [2018-10-15 12:56:22,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:22,309 INFO L93 Difference]: Finished difference Result 118 states and 118 transitions. [2018-10-15 12:56:22,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:56:22,310 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 114 [2018-10-15 12:56:22,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:22,311 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:56:22,311 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:56:22,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1485, Invalid=1485, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:22,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:56:22,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 12:56:22,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 12:56:22,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-10-15 12:56:22,313 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-10-15 12:56:22,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:22,314 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-10-15 12:56:22,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:22,314 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-10-15 12:56:22,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 12:56:22,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:22,315 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:22,315 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:22,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:22,315 INFO L82 PathProgramCache]: Analyzing trace with hash -1734354671, now seen corresponding path program 53 times [2018-10-15 12:56:22,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:24,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:24,011 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:24,011 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-15 12:56:24,011 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-15 12:56:24,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-15 12:56:24,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:56:24,012 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 56 states. [2018-10-15 12:56:24,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:24,328 INFO L93 Difference]: Finished difference Result 120 states and 120 transitions. [2018-10-15 12:56:24,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:56:24,328 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 116 [2018-10-15 12:56:24,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:24,329 INFO L225 Difference]: With dead ends: 120 [2018-10-15 12:56:24,329 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 12:56:24,330 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=1540, Invalid=1540, Unknown=0, NotChecked=0, Total=3080 [2018-10-15 12:56:24,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 12:56:24,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2018-10-15 12:56:24,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:56:24,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:56:24,331 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-10-15 12:56:24,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:24,332 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:56:24,332 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-15 12:56:24,332 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:56:24,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:56:24,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:24,333 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:24,333 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:24,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:24,333 INFO L82 PathProgramCache]: Analyzing trace with hash -2049528973, now seen corresponding path program 54 times [2018-10-15 12:56:24,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:24,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:25,963 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:25,963 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:25,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:25,964 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:25,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:25,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:25,964 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 57 states. [2018-10-15 12:56:26,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:26,151 INFO L93 Difference]: Finished difference Result 122 states and 122 transitions. [2018-10-15 12:56:26,151 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-15 12:56:26,151 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 118 [2018-10-15 12:56:26,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:26,153 INFO L225 Difference]: With dead ends: 122 [2018-10-15 12:56:26,153 INFO L226 Difference]: Without dead ends: 122 [2018-10-15 12:56:26,154 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1596, Invalid=1596, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:26,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2018-10-15 12:56:26,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 121. [2018-10-15 12:56:26,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-10-15 12:56:26,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-10-15 12:56:26,156 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-10-15 12:56:26,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:26,156 INFO L481 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-10-15 12:56:26,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:26,157 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-10-15 12:56:26,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-10-15 12:56:26,157 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:26,157 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:26,158 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:26,158 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:26,158 INFO L82 PathProgramCache]: Analyzing trace with hash 10644821, now seen corresponding path program 55 times [2018-10-15 12:56:26,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:26,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:27,384 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:27,385 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:27,385 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-15 12:56:27,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-15 12:56:27,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-15 12:56:27,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:56:27,386 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 58 states. [2018-10-15 12:56:27,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:27,668 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 12:56:27,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-15 12:56:27,669 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 120 [2018-10-15 12:56:27,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:27,670 INFO L225 Difference]: With dead ends: 124 [2018-10-15 12:56:27,670 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:56:27,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1653, Invalid=1653, Unknown=0, NotChecked=0, Total=3306 [2018-10-15 12:56:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:56:27,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 12:56:27,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:56:27,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 12:56:27,672 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-10-15 12:56:27,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:27,672 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 12:56:27,673 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-15 12:56:27,673 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 12:56:27,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:56:27,673 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:27,674 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:27,674 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:27,674 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:27,674 INFO L82 PathProgramCache]: Analyzing trace with hash -142262601, now seen corresponding path program 56 times [2018-10-15 12:56:27,675 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:27,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:29,307 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:29,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:29,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:29,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:29,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:29,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:29,309 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 59 states. [2018-10-15 12:56:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:29,714 INFO L93 Difference]: Finished difference Result 126 states and 126 transitions. [2018-10-15 12:56:29,714 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:56:29,714 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 122 [2018-10-15 12:56:29,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:29,715 INFO L225 Difference]: With dead ends: 126 [2018-10-15 12:56:29,715 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:56:29,715 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1711, Invalid=1711, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:29,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:56:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 125. [2018-10-15 12:56:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-10-15 12:56:29,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-10-15 12:56:29,718 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-10-15 12:56:29,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:29,718 INFO L481 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-10-15 12:56:29,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-10-15 12:56:29,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-10-15 12:56:29,719 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:29,719 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:29,720 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:29,720 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:29,720 INFO L82 PathProgramCache]: Analyzing trace with hash -1057407079, now seen corresponding path program 57 times [2018-10-15 12:56:29,721 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:29,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:31,572 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:31,572 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:31,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-15 12:56:31,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-15 12:56:31,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-15 12:56:31,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:56:31,573 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 60 states. [2018-10-15 12:56:31,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:31,818 INFO L93 Difference]: Finished difference Result 128 states and 128 transitions. [2018-10-15 12:56:31,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-15 12:56:31,819 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 124 [2018-10-15 12:56:31,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:31,820 INFO L225 Difference]: With dead ends: 128 [2018-10-15 12:56:31,820 INFO L226 Difference]: Without dead ends: 128 [2018-10-15 12:56:31,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1770, Invalid=1770, Unknown=0, NotChecked=0, Total=3540 [2018-10-15 12:56:31,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2018-10-15 12:56:31,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 127. [2018-10-15 12:56:31,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-10-15 12:56:31,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-10-15 12:56:31,823 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-10-15 12:56:31,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:31,823 INFO L481 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-10-15 12:56:31,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-15 12:56:31,823 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-10-15 12:56:31,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-10-15 12:56:31,824 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:31,824 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:31,824 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:31,824 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:31,824 INFO L82 PathProgramCache]: Analyzing trace with hash -42954757, now seen corresponding path program 58 times [2018-10-15 12:56:31,825 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:33,647 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:33,647 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:33,647 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:33,648 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:33,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:33,648 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:33,648 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 61 states. [2018-10-15 12:56:33,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:33,947 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 12:56:33,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-15 12:56:33,947 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 126 [2018-10-15 12:56:33,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:33,948 INFO L225 Difference]: With dead ends: 130 [2018-10-15 12:56:33,948 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 12:56:33,949 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1830, Invalid=1830, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:33,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 12:56:33,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 12:56:33,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 12:56:33,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-10-15 12:56:33,950 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-10-15 12:56:33,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:33,951 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-10-15 12:56:33,951 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:33,951 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-10-15 12:56:33,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:56:33,952 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:33,952 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:33,952 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:33,952 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:33,952 INFO L82 PathProgramCache]: Analyzing trace with hash -111849507, now seen corresponding path program 59 times [2018-10-15 12:56:33,953 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:35,354 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:35,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:35,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-15 12:56:35,355 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-15 12:56:35,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-15 12:56:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:56:35,356 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 62 states. [2018-10-15 12:56:35,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:35,601 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2018-10-15 12:56:35,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:56:35,601 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 128 [2018-10-15 12:56:35,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:35,602 INFO L225 Difference]: With dead ends: 132 [2018-10-15 12:56:35,603 INFO L226 Difference]: Without dead ends: 132 [2018-10-15 12:56:35,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1891, Invalid=1891, Unknown=0, NotChecked=0, Total=3782 [2018-10-15 12:56:35,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2018-10-15 12:56:35,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 131. [2018-10-15 12:56:35,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-10-15 12:56:35,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-10-15 12:56:35,605 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-10-15 12:56:35,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:35,605 INFO L481 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-10-15 12:56:35,605 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-15 12:56:35,606 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-10-15 12:56:35,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-10-15 12:56:35,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:35,606 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:35,606 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:35,606 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:35,607 INFO L82 PathProgramCache]: Analyzing trace with hash -1895194817, now seen corresponding path program 60 times [2018-10-15 12:56:35,607 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:36,984 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:36,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:36,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:36,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:36,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:36,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:36,985 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 63 states. [2018-10-15 12:56:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:37,299 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 12:56:37,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-15 12:56:37,299 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 130 [2018-10-15 12:56:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:37,300 INFO L225 Difference]: With dead ends: 134 [2018-10-15 12:56:37,300 INFO L226 Difference]: Without dead ends: 134 [2018-10-15 12:56:37,300 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1953, Invalid=1953, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:37,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2018-10-15 12:56:37,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 133. [2018-10-15 12:56:37,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 12:56:37,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 12:56:37,302 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-10-15 12:56:37,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:37,303 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 12:56:37,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:37,303 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 12:56:37,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 12:56:37,303 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:37,304 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:37,304 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:37,304 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:37,304 INFO L82 PathProgramCache]: Analyzing trace with hash -1998086623, now seen corresponding path program 61 times [2018-10-15 12:56:37,305 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:37,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:39,063 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:39,063 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:39,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-15 12:56:39,063 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-15 12:56:39,064 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-15 12:56:39,064 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:56:39,064 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 64 states. [2018-10-15 12:56:39,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:39,374 INFO L93 Difference]: Finished difference Result 136 states and 136 transitions. [2018-10-15 12:56:39,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-15 12:56:39,374 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 132 [2018-10-15 12:56:39,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:39,375 INFO L225 Difference]: With dead ends: 136 [2018-10-15 12:56:39,375 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 12:56:39,375 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2016, Invalid=2016, Unknown=0, NotChecked=0, Total=4032 [2018-10-15 12:56:39,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 12:56:39,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 12:56:39,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:56:39,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-10-15 12:56:39,377 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-10-15 12:56:39,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:39,377 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-10-15 12:56:39,377 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-15 12:56:39,378 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-10-15 12:56:39,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 12:56:39,378 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:39,379 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:39,379 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:39,379 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:39,379 INFO L82 PathProgramCache]: Analyzing trace with hash -2092864381, now seen corresponding path program 62 times [2018-10-15 12:56:39,380 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:39,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:40,875 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:40,875 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:40,875 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:40,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:40,877 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 65 states. [2018-10-15 12:56:41,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:41,078 INFO L93 Difference]: Finished difference Result 138 states and 138 transitions. [2018-10-15 12:56:41,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:56:41,078 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 134 [2018-10-15 12:56:41,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:41,079 INFO L225 Difference]: With dead ends: 138 [2018-10-15 12:56:41,079 INFO L226 Difference]: Without dead ends: 138 [2018-10-15 12:56:41,080 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2080, Invalid=2080, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:41,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2018-10-15 12:56:41,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2018-10-15 12:56:41,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:56:41,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:56:41,083 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-10-15 12:56:41,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:41,083 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:56:41,083 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:41,083 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:56:41,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:56:41,084 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:41,084 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:41,084 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:41,085 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:41,085 INFO L82 PathProgramCache]: Analyzing trace with hash 1314990693, now seen corresponding path program 63 times [2018-10-15 12:56:41,085 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:41,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:42,689 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:42,689 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:42,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-15 12:56:42,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-15 12:56:42,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-15 12:56:42,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:56:42,691 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 66 states. [2018-10-15 12:56:43,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:43,021 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2018-10-15 12:56:43,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-15 12:56:43,021 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 136 [2018-10-15 12:56:43,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:43,022 INFO L225 Difference]: With dead ends: 140 [2018-10-15 12:56:43,022 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 12:56:43,022 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=2145, Invalid=2145, Unknown=0, NotChecked=0, Total=4290 [2018-10-15 12:56:43,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 12:56:43,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 139. [2018-10-15 12:56:43,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-10-15 12:56:43,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-10-15 12:56:43,024 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-10-15 12:56:43,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:43,025 INFO L481 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-10-15 12:56:43,025 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-15 12:56:43,025 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-10-15 12:56:43,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-10-15 12:56:43,026 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:43,026 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:43,026 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:43,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:43,027 INFO L82 PathProgramCache]: Analyzing trace with hash -796330041, now seen corresponding path program 64 times [2018-10-15 12:56:43,027 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:43,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:44,888 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:44,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:44,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:44,889 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:44,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:44,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:44,889 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 67 states. [2018-10-15 12:56:45,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:45,199 INFO L93 Difference]: Finished difference Result 142 states and 142 transitions. [2018-10-15 12:56:45,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-15 12:56:45,199 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 138 [2018-10-15 12:56:45,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:45,200 INFO L225 Difference]: With dead ends: 142 [2018-10-15 12:56:45,200 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 12:56:45,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2211, Invalid=2211, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:45,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 12:56:45,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 12:56:45,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 12:56:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-10-15 12:56:45,202 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-10-15 12:56:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:45,203 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-10-15 12:56:45,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-10-15 12:56:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 12:56:45,203 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:45,203 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:45,204 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:45,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:45,204 INFO L82 PathProgramCache]: Analyzing trace with hash 1743975593, now seen corresponding path program 65 times [2018-10-15 12:56:45,204 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:45,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:46,868 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:46,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:46,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-15 12:56:46,869 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-15 12:56:46,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-15 12:56:46,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:56:46,869 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 68 states. [2018-10-15 12:56:47,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:47,098 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 12:56:47,098 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:56:47,098 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 140 [2018-10-15 12:56:47,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:47,099 INFO L225 Difference]: With dead ends: 144 [2018-10-15 12:56:47,100 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:56:47,100 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2278, Invalid=2278, Unknown=0, NotChecked=0, Total=4556 [2018-10-15 12:56:47,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:56:47,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 143. [2018-10-15 12:56:47,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 12:56:47,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 12:56:47,103 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-10-15 12:56:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:47,103 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 12:56:47,103 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-15 12:56:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 12:56:47,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 12:56:47,104 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:47,104 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:47,104 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:47,105 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:47,105 INFO L82 PathProgramCache]: Analyzing trace with hash -858701557, now seen corresponding path program 66 times [2018-10-15 12:56:47,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:47,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:49,082 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:49,082 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:49,082 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:49,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:49,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:49,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:49,084 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 69 states. [2018-10-15 12:56:49,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:49,515 INFO L93 Difference]: Finished difference Result 146 states and 146 transitions. [2018-10-15 12:56:49,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-15 12:56:49,515 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 142 [2018-10-15 12:56:49,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:49,516 INFO L225 Difference]: With dead ends: 146 [2018-10-15 12:56:49,516 INFO L226 Difference]: Without dead ends: 146 [2018-10-15 12:56:49,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2346, Invalid=2346, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:49,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2018-10-15 12:56:49,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 145. [2018-10-15 12:56:49,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-10-15 12:56:49,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-10-15 12:56:49,519 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-10-15 12:56:49,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:49,519 INFO L481 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-10-15 12:56:49,520 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:49,520 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-10-15 12:56:49,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-10-15 12:56:49,520 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:49,521 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:49,521 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:49,521 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:49,521 INFO L82 PathProgramCache]: Analyzing trace with hash 1934490861, now seen corresponding path program 67 times [2018-10-15 12:56:49,522 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:51,220 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:51,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:51,220 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-15 12:56:51,220 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-15 12:56:51,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-15 12:56:51,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:56:51,221 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 70 states. [2018-10-15 12:56:51,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:51,586 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:56:51,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-15 12:56:51,586 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 144 [2018-10-15 12:56:51,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:51,587 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:56:51,587 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:56:51,587 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=2415, Invalid=2415, Unknown=0, NotChecked=0, Total=4830 [2018-10-15 12:56:51,588 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:56:51,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 12:56:51,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:56:51,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-10-15 12:56:51,590 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-10-15 12:56:51,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:51,590 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-10-15 12:56:51,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-15 12:56:51,591 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-10-15 12:56:51,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:56:51,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:51,591 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:51,592 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:51,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:51,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1837844559, now seen corresponding path program 68 times [2018-10-15 12:56:51,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:51,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:53,625 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:53,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:53,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:53,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:53,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:53,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:53,627 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 71 states. [2018-10-15 12:56:54,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:54,168 INFO L93 Difference]: Finished difference Result 150 states and 150 transitions. [2018-10-15 12:56:54,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:56:54,168 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 146 [2018-10-15 12:56:54,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:54,169 INFO L225 Difference]: With dead ends: 150 [2018-10-15 12:56:54,169 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 12:56:54,170 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2485, Invalid=2485, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:54,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 12:56:54,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 149. [2018-10-15 12:56:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-10-15 12:56:54,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-10-15 12:56:54,172 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-10-15 12:56:54,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:54,172 INFO L481 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-10-15 12:56:54,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:54,172 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-10-15 12:56:54,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-10-15 12:56:54,173 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:54,173 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:54,173 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:54,174 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:54,174 INFO L82 PathProgramCache]: Analyzing trace with hash -844938447, now seen corresponding path program 69 times [2018-10-15 12:56:54,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:56,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:56,019 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:56,019 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-15 12:56:56,020 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-15 12:56:56,020 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-15 12:56:56,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:56:56,021 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 72 states. [2018-10-15 12:56:56,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:56,467 INFO L93 Difference]: Finished difference Result 152 states and 152 transitions. [2018-10-15 12:56:56,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-15 12:56:56,468 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 148 [2018-10-15 12:56:56,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:56,468 INFO L225 Difference]: With dead ends: 152 [2018-10-15 12:56:56,468 INFO L226 Difference]: Without dead ends: 152 [2018-10-15 12:56:56,469 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=2556, Invalid=2556, Unknown=0, NotChecked=0, Total=5112 [2018-10-15 12:56:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2018-10-15 12:56:56,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 151. [2018-10-15 12:56:56,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-10-15 12:56:56,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-10-15 12:56:56,471 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-10-15 12:56:56,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:56,472 INFO L481 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-10-15 12:56:56,472 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-15 12:56:56,472 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-10-15 12:56:56,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-10-15 12:56:56,473 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:56,473 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:56,473 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:56,473 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:56,473 INFO L82 PathProgramCache]: Analyzing trace with hash -2019029613, now seen corresponding path program 70 times [2018-10-15 12:56:56,474 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:56,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:58,391 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:58,391 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:58,391 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:58,392 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:58,392 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:58,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:58,392 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 73 states. [2018-10-15 12:56:58,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:58,818 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 12:56:58,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-15 12:56:58,818 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 150 [2018-10-15 12:56:58,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:58,819 INFO L225 Difference]: With dead ends: 154 [2018-10-15 12:56:58,819 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 12:56:58,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2628, Invalid=2628, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:58,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 12:56:58,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 12:56:58,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 12:56:58,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 12:56:58,821 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-10-15 12:56:58,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:58,821 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 12:56:58,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:58,821 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 12:56:58,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 12:56:58,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:58,822 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:58,822 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:58,822 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:58,822 INFO L82 PathProgramCache]: Analyzing trace with hash -744241291, now seen corresponding path program 71 times [2018-10-15 12:56:58,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:00,824 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:00,824 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:00,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-15 12:57:00,824 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-15 12:57:00,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-15 12:57:00,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:57:00,825 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 74 states. [2018-10-15 12:57:01,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:01,185 INFO L93 Difference]: Finished difference Result 156 states and 156 transitions. [2018-10-15 12:57:01,186 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:57:01,186 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 152 [2018-10-15 12:57:01,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:01,187 INFO L225 Difference]: With dead ends: 156 [2018-10-15 12:57:01,187 INFO L226 Difference]: Without dead ends: 156 [2018-10-15 12:57:01,187 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2701, Invalid=2701, Unknown=0, NotChecked=0, Total=5402 [2018-10-15 12:57:01,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2018-10-15 12:57:01,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 155. [2018-10-15 12:57:01,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:57:01,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:57:01,190 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-10-15 12:57:01,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:01,190 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:57:01,190 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-15 12:57:01,190 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:57:01,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:57:01,191 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:01,191 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:01,191 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:01,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:01,191 INFO L82 PathProgramCache]: Analyzing trace with hash 261656791, now seen corresponding path program 72 times [2018-10-15 12:57:01,192 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:01,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:03,443 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:03,443 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:03,443 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:57:03,444 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:57:03,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:57:03,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:57:03,444 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 75 states. [2018-10-15 12:57:03,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:03,820 INFO L93 Difference]: Finished difference Result 158 states and 158 transitions. [2018-10-15 12:57:03,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-15 12:57:03,820 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 154 [2018-10-15 12:57:03,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:03,821 INFO L225 Difference]: With dead ends: 158 [2018-10-15 12:57:03,821 INFO L226 Difference]: Without dead ends: 158 [2018-10-15 12:57:03,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2775, Invalid=2775, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:57:03,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2018-10-15 12:57:03,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 157. [2018-10-15 12:57:03,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-10-15 12:57:03,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-10-15 12:57:03,824 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-10-15 12:57:03,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:03,824 INFO L481 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-10-15 12:57:03,824 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:57:03,824 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-10-15 12:57:03,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-10-15 12:57:03,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:03,825 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:03,825 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:03,826 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:03,826 INFO L82 PathProgramCache]: Analyzing trace with hash 562071993, now seen corresponding path program 73 times [2018-10-15 12:57:03,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:03,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:06,202 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:06,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:06,203 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-15 12:57:06,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-15 12:57:06,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-15 12:57:06,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:57:06,204 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 76 states. [2018-10-15 12:57:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:06,600 INFO L93 Difference]: Finished difference Result 160 states and 160 transitions. [2018-10-15 12:57:06,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-15 12:57:06,600 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 156 [2018-10-15 12:57:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:06,601 INFO L225 Difference]: With dead ends: 160 [2018-10-15 12:57:06,601 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:57:06,601 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2850, Invalid=2850, Unknown=0, NotChecked=0, Total=5700 [2018-10-15 12:57:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:57:06,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 12:57:06,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 12:57:06,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-10-15 12:57:06,604 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-10-15 12:57:06,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:06,604 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-10-15 12:57:06,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-15 12:57:06,604 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-10-15 12:57:06,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 12:57:06,605 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:06,605 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:06,605 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:06,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:06,605 INFO L82 PathProgramCache]: Analyzing trace with hash 1498272283, now seen corresponding path program 74 times [2018-10-15 12:57:06,606 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:08,737 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:08,737 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:08,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:57:08,737 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:57:08,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:57:08,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:57:08,738 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 77 states. [2018-10-15 12:57:09,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:09,295 INFO L93 Difference]: Finished difference Result 162 states and 162 transitions. [2018-10-15 12:57:09,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:57:09,295 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 158 [2018-10-15 12:57:09,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:09,296 INFO L225 Difference]: With dead ends: 162 [2018-10-15 12:57:09,296 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:57:09,296 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2926, Invalid=2926, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:57:09,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:57:09,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 161. [2018-10-15 12:57:09,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-10-15 12:57:09,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-10-15 12:57:09,298 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-10-15 12:57:09,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:09,299 INFO L481 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-10-15 12:57:09,299 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:57:09,299 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-10-15 12:57:09,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-10-15 12:57:09,300 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:09,300 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:09,300 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:09,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:09,300 INFO L82 PathProgramCache]: Analyzing trace with hash -756381187, now seen corresponding path program 75 times [2018-10-15 12:57:09,301 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:09,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:11,333 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:11,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:11,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-15 12:57:11,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-15 12:57:11,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-15 12:57:11,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:57:11,334 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 78 states. [2018-10-15 12:57:11,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:11,809 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 12:57:11,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-15 12:57:11,810 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 160 [2018-10-15 12:57:11,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:11,811 INFO L225 Difference]: With dead ends: 164 [2018-10-15 12:57:11,811 INFO L226 Difference]: Without dead ends: 164 [2018-10-15 12:57:11,811 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=3003, Invalid=3003, Unknown=0, NotChecked=0, Total=6006 [2018-10-15 12:57:11,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2018-10-15 12:57:11,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 163. [2018-10-15 12:57:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 12:57:11,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 12:57:11,813 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-10-15 12:57:11,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:11,813 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 12:57:11,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-15 12:57:11,814 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 12:57:11,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 12:57:11,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:11,814 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:11,815 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:11,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:11,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1480118623, now seen corresponding path program 76 times [2018-10-15 12:57:11,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:11,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:13,916 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:13,916 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:13,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:13,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:13,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:13,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:13,917 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 79 states. [2018-10-15 12:57:14,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:14,454 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 12:57:14,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-15 12:57:14,455 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 162 [2018-10-15 12:57:14,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:14,455 INFO L225 Difference]: With dead ends: 166 [2018-10-15 12:57:14,455 INFO L226 Difference]: Without dead ends: 166 [2018-10-15 12:57:14,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=3081, Invalid=3081, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:14,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2018-10-15 12:57:14,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 165. [2018-10-15 12:57:14,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 12:57:14,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-10-15 12:57:14,458 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-10-15 12:57:14,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:14,458 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-10-15 12:57:14,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:14,458 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-10-15 12:57:14,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 12:57:14,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:14,459 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:14,459 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:14,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:14,459 INFO L82 PathProgramCache]: Analyzing trace with hash -1022179263, now seen corresponding path program 77 times [2018-10-15 12:57:14,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:16,679 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:57:16,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:16,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-15 12:57:16,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-15 12:57:16,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-15 12:57:16,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:57:16,681 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 80 states. [2018-10-15 12:57:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:16,969 INFO L93 Difference]: Finished difference Result 168 states and 168 transitions. [2018-10-15 12:57:16,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:57:16,969 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 164 [2018-10-15 12:57:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:16,970 INFO L225 Difference]: With dead ends: 168 [2018-10-15 12:57:16,970 INFO L226 Difference]: Without dead ends: 168 [2018-10-15 12:57:16,971 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3160, Invalid=3160, Unknown=0, NotChecked=0, Total=6320 [2018-10-15 12:57:16,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2018-10-15 12:57:16,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 167. [2018-10-15 12:57:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-10-15 12:57:16,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-10-15 12:57:16,974 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-10-15 12:57:16,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:16,974 INFO L481 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-10-15 12:57:16,974 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-15 12:57:16,974 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-10-15 12:57:16,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-10-15 12:57:16,974 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:16,975 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:16,975 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:16,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:16,975 INFO L82 PathProgramCache]: Analyzing trace with hash -548761949, now seen corresponding path program 78 times [2018-10-15 12:57:16,975 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:19,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:19,397 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:19,397 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:19,398 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:19,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:19,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:19,399 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 81 states. [2018-10-15 12:57:19,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:19,831 INFO L93 Difference]: Finished difference Result 170 states and 170 transitions. [2018-10-15 12:57:19,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-15 12:57:19,831 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 166 [2018-10-15 12:57:19,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:19,832 INFO L225 Difference]: With dead ends: 170 [2018-10-15 12:57:19,832 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 12:57:19,833 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3240, Invalid=3240, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 12:57:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 169. [2018-10-15 12:57:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 12:57:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-10-15 12:57:19,834 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-10-15 12:57:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:19,835 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-10-15 12:57:19,835 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-10-15 12:57:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 12:57:19,835 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:19,835 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:19,836 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:19,836 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:19,836 INFO L82 PathProgramCache]: Analyzing trace with hash -861256571, now seen corresponding path program 79 times [2018-10-15 12:57:19,836 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:19,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:22,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:22,099 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:22,099 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-15 12:57:22,100 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-15 12:57:22,100 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-15 12:57:22,100 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:57:22,101 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 82 states. [2018-10-15 12:57:22,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:22,597 INFO L93 Difference]: Finished difference Result 172 states and 172 transitions. [2018-10-15 12:57:22,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-15 12:57:22,597 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 168 [2018-10-15 12:57:22,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:22,598 INFO L225 Difference]: With dead ends: 172 [2018-10-15 12:57:22,598 INFO L226 Difference]: Without dead ends: 172 [2018-10-15 12:57:22,598 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3321, Invalid=3321, Unknown=0, NotChecked=0, Total=6642 [2018-10-15 12:57:22,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2018-10-15 12:57:22,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 171. [2018-10-15 12:57:22,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-10-15 12:57:22,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-10-15 12:57:22,600 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-10-15 12:57:22,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:22,600 INFO L481 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-10-15 12:57:22,600 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-15 12:57:22,600 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-10-15 12:57:22,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-10-15 12:57:22,601 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:22,601 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:22,601 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:22,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:22,601 INFO L82 PathProgramCache]: Analyzing trace with hash -520877593, now seen corresponding path program 80 times [2018-10-15 12:57:22,602 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:22,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:24,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 6400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:24,947 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:24,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:24,948 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:24,948 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:24,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:24,949 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 83 states. [2018-10-15 12:57:25,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:25,445 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 12:57:25,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:57:25,446 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 170 [2018-10-15 12:57:25,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:25,446 INFO L225 Difference]: With dead ends: 174 [2018-10-15 12:57:25,446 INFO L226 Difference]: Without dead ends: 174 [2018-10-15 12:57:25,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3403, Invalid=3403, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:25,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2018-10-15 12:57:25,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 173. [2018-10-15 12:57:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:57:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:57:25,448 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-10-15 12:57:25,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:25,449 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:57:25,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:25,449 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:57:25,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:57:25,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:25,450 INFO L375 BasicCegarLoop]: trace histogram [81, 81, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:25,450 INFO L424 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:25,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:25,451 INFO L82 PathProgramCache]: Analyzing trace with hash 165805769, now seen corresponding path program 81 times [2018-10-15 12:57:25,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:25,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:27,887 INFO L134 CoverageAnalysis]: Checked inductivity of 6561 backedges. 0 proven. 6561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:27,888 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:27,888 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-10-15 12:57:27,888 INFO L460 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-10-15 12:57:27,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-10-15 12:57:27,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:57:27,889 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 84 states. [2018-10-15 12:57:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:28,232 INFO L93 Difference]: Finished difference Result 176 states and 176 transitions. [2018-10-15 12:57:28,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-10-15 12:57:28,233 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 172 [2018-10-15 12:57:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:28,233 INFO L225 Difference]: With dead ends: 176 [2018-10-15 12:57:28,233 INFO L226 Difference]: Without dead ends: 176 [2018-10-15 12:57:28,234 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3486, Invalid=3486, Unknown=0, NotChecked=0, Total=6972 [2018-10-15 12:57:28,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 176 states. [2018-10-15 12:57:28,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 176 to 175. [2018-10-15 12:57:28,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-10-15 12:57:28,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-10-15 12:57:28,236 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-10-15 12:57:28,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:28,236 INFO L481 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-10-15 12:57:28,236 INFO L482 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-10-15 12:57:28,236 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-10-15 12:57:28,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-10-15 12:57:28,237 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:28,237 INFO L375 BasicCegarLoop]: trace histogram [82, 82, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:28,238 INFO L424 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:28,238 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:28,238 INFO L82 PathProgramCache]: Analyzing trace with hash -1356446933, now seen corresponding path program 82 times [2018-10-15 12:57:28,238 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:28,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:30,899 INFO L134 CoverageAnalysis]: Checked inductivity of 6724 backedges. 0 proven. 6724 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:30,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:30,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:30,900 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:30,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:30,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:30,901 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 85 states. [2018-10-15 12:57:31,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:31,433 INFO L93 Difference]: Finished difference Result 178 states and 178 transitions. [2018-10-15 12:57:31,433 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-10-15 12:57:31,433 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 174 [2018-10-15 12:57:31,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:31,434 INFO L225 Difference]: With dead ends: 178 [2018-10-15 12:57:31,434 INFO L226 Difference]: Without dead ends: 178 [2018-10-15 12:57:31,434 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=3570, Invalid=3570, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:31,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2018-10-15 12:57:31,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 177. [2018-10-15 12:57:31,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-10-15 12:57:31,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-10-15 12:57:31,436 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-10-15 12:57:31,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:31,436 INFO L481 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-10-15 12:57:31,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:31,436 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-10-15 12:57:31,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-10-15 12:57:31,437 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:31,437 INFO L375 BasicCegarLoop]: trace histogram [83, 83, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:31,437 INFO L424 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:31,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:31,437 INFO L82 PathProgramCache]: Analyzing trace with hash 342554381, now seen corresponding path program 83 times [2018-10-15 12:57:31,438 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 6889 backedges. 0 proven. 6889 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:33,975 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:33,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-10-15 12:57:33,975 INFO L460 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-10-15 12:57:33,976 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-10-15 12:57:33,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:57:33,976 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 86 states. [2018-10-15 12:57:34,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:34,292 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2018-10-15 12:57:34,293 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:57:34,293 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 176 [2018-10-15 12:57:34,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:34,294 INFO L225 Difference]: With dead ends: 180 [2018-10-15 12:57:34,294 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:57:34,294 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3655, Invalid=3655, Unknown=0, NotChecked=0, Total=7310 [2018-10-15 12:57:34,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:57:34,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 179. [2018-10-15 12:57:34,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-10-15 12:57:34,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-10-15 12:57:34,296 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-10-15 12:57:34,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:34,297 INFO L481 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-10-15 12:57:34,297 INFO L482 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-10-15 12:57:34,297 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-10-15 12:57:34,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-10-15 12:57:34,297 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:34,297 INFO L375 BasicCegarLoop]: trace histogram [84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:34,298 INFO L424 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:34,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:34,298 INFO L82 PathProgramCache]: Analyzing trace with hash 995244655, now seen corresponding path program 84 times [2018-10-15 12:57:34,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:37,148 INFO L134 CoverageAnalysis]: Checked inductivity of 7056 backedges. 0 proven. 7056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:37,149 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:37,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:37,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:37,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:37,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:37,150 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 87 states. [2018-10-15 12:57:37,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:37,712 INFO L93 Difference]: Finished difference Result 182 states and 182 transitions. [2018-10-15 12:57:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-10-15 12:57:37,715 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 178 [2018-10-15 12:57:37,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:37,716 INFO L225 Difference]: With dead ends: 182 [2018-10-15 12:57:37,716 INFO L226 Difference]: Without dead ends: 182 [2018-10-15 12:57:37,717 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3741, Invalid=3741, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:37,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2018-10-15 12:57:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 181. [2018-10-15 12:57:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 12:57:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-10-15 12:57:37,719 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-10-15 12:57:37,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:37,719 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-10-15 12:57:37,719 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:37,719 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-10-15 12:57:37,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 12:57:37,720 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:37,720 INFO L375 BasicCegarLoop]: trace histogram [85, 85, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:37,721 INFO L424 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:37,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:37,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1165372753, now seen corresponding path program 85 times [2018-10-15 12:57:37,722 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:37,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:40,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7225 backedges. 0 proven. 7225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:40,627 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:40,627 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-10-15 12:57:40,627 INFO L460 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-10-15 12:57:40,628 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-10-15 12:57:40,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:57:40,628 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 88 states. [2018-10-15 12:57:40,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:40,966 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 12:57:40,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-10-15 12:57:40,966 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 180 [2018-10-15 12:57:40,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:40,967 INFO L225 Difference]: With dead ends: 184 [2018-10-15 12:57:40,968 INFO L226 Difference]: Without dead ends: 184 [2018-10-15 12:57:40,968 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=3828, Invalid=3828, Unknown=0, NotChecked=0, Total=7656 [2018-10-15 12:57:40,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2018-10-15 12:57:40,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 183. [2018-10-15 12:57:40,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 12:57:40,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 12:57:40,971 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-10-15 12:57:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:40,971 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 12:57:40,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-10-15 12:57:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 12:57:40,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 12:57:40,972 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:40,972 INFO L375 BasicCegarLoop]: trace histogram [86, 86, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:40,973 INFO L424 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:40,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:40,973 INFO L82 PathProgramCache]: Analyzing trace with hash 1449717683, now seen corresponding path program 86 times [2018-10-15 12:57:40,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:40,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:43,660 INFO L134 CoverageAnalysis]: Checked inductivity of 7396 backedges. 0 proven. 7396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:43,661 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:43,661 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:43,661 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:43,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:43,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:43,662 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 89 states. [2018-10-15 12:57:44,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:44,231 INFO L93 Difference]: Finished difference Result 186 states and 186 transitions. [2018-10-15 12:57:44,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:57:44,231 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 182 [2018-10-15 12:57:44,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:44,232 INFO L225 Difference]: With dead ends: 186 [2018-10-15 12:57:44,232 INFO L226 Difference]: Without dead ends: 186 [2018-10-15 12:57:44,232 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=3916, Invalid=3916, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:44,232 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2018-10-15 12:57:44,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 185. [2018-10-15 12:57:44,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-10-15 12:57:44,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-10-15 12:57:44,234 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-10-15 12:57:44,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:44,234 INFO L481 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-10-15 12:57:44,234 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:44,234 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-10-15 12:57:44,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-10-15 12:57:44,235 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:44,235 INFO L375 BasicCegarLoop]: trace histogram [87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:44,235 INFO L424 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:44,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:44,236 INFO L82 PathProgramCache]: Analyzing trace with hash -172711531, now seen corresponding path program 87 times [2018-10-15 12:57:44,236 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:44,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:47,294 INFO L134 CoverageAnalysis]: Checked inductivity of 7569 backedges. 0 proven. 7569 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:47,295 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:47,295 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-10-15 12:57:47,295 INFO L460 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-10-15 12:57:47,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-10-15 12:57:47,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:57:47,296 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 90 states. [2018-10-15 12:57:47,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:47,682 INFO L93 Difference]: Finished difference Result 188 states and 188 transitions. [2018-10-15 12:57:47,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-10-15 12:57:47,683 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 184 [2018-10-15 12:57:47,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:47,683 INFO L225 Difference]: With dead ends: 188 [2018-10-15 12:57:47,684 INFO L226 Difference]: Without dead ends: 188 [2018-10-15 12:57:47,684 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4005, Invalid=4005, Unknown=0, NotChecked=0, Total=8010 [2018-10-15 12:57:47,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2018-10-15 12:57:47,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 187. [2018-10-15 12:57:47,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-10-15 12:57:47,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-10-15 12:57:47,686 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-10-15 12:57:47,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:47,687 INFO L481 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-10-15 12:57:47,687 INFO L482 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-10-15 12:57:47,687 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-10-15 12:57:47,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-10-15 12:57:47,688 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:47,688 INFO L375 BasicCegarLoop]: trace histogram [88, 88, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:47,688 INFO L424 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:47,688 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:47,688 INFO L82 PathProgramCache]: Analyzing trace with hash -254057737, now seen corresponding path program 88 times [2018-10-15 12:57:47,689 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:50,714 INFO L134 CoverageAnalysis]: Checked inductivity of 7744 backedges. 0 proven. 7744 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:50,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:50,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:50,715 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:50,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:50,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:50,716 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 91 states. [2018-10-15 12:57:51,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:51,310 INFO L93 Difference]: Finished difference Result 190 states and 190 transitions. [2018-10-15 12:57:51,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-10-15 12:57:51,310 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 186 [2018-10-15 12:57:51,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:51,311 INFO L225 Difference]: With dead ends: 190 [2018-10-15 12:57:51,311 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 12:57:51,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4095, Invalid=4095, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:51,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 12:57:51,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 189. [2018-10-15 12:57:51,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-10-15 12:57:51,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-10-15 12:57:51,314 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-10-15 12:57:51,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:51,314 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-10-15 12:57:51,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:51,314 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-10-15 12:57:51,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-10-15 12:57:51,315 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:51,315 INFO L375 BasicCegarLoop]: trace histogram [89, 89, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:51,316 INFO L424 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:51,316 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:51,316 INFO L82 PathProgramCache]: Analyzing trace with hash -1118350375, now seen corresponding path program 89 times [2018-10-15 12:57:51,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:51,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:54,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7921 backedges. 0 proven. 7921 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:54,298 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:54,298 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-10-15 12:57:54,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-10-15 12:57:54,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-10-15 12:57:54,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:57:54,299 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 92 states. [2018-10-15 12:57:54,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:54,924 INFO L93 Difference]: Finished difference Result 192 states and 192 transitions. [2018-10-15 12:57:54,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:57:54,924 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 188 [2018-10-15 12:57:54,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:54,925 INFO L225 Difference]: With dead ends: 192 [2018-10-15 12:57:54,925 INFO L226 Difference]: Without dead ends: 192 [2018-10-15 12:57:54,926 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=4186, Invalid=4186, Unknown=0, NotChecked=0, Total=8372 [2018-10-15 12:57:54,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2018-10-15 12:57:54,927 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 191. [2018-10-15 12:57:54,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:57:54,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:57:54,928 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-10-15 12:57:54,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:54,928 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:57:54,928 INFO L482 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-10-15 12:57:54,928 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:57:54,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:57:54,929 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:54,929 INFO L375 BasicCegarLoop]: trace histogram [90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:54,930 INFO L424 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:54,930 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:54,930 INFO L82 PathProgramCache]: Analyzing trace with hash 1520079931, now seen corresponding path program 90 times [2018-10-15 12:57:54,930 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:54,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:58,168 INFO L134 CoverageAnalysis]: Checked inductivity of 8100 backedges. 0 proven. 8100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:58,168 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:58,168 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:58,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:58,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:58,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:58,169 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 93 states. [2018-10-15 12:57:58,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:58,592 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 12:57:58,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-10-15 12:57:58,592 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 190 [2018-10-15 12:57:58,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:58,593 INFO L225 Difference]: With dead ends: 194 [2018-10-15 12:57:58,594 INFO L226 Difference]: Without dead ends: 194 [2018-10-15 12:57:58,594 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4278, Invalid=4278, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:58,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2018-10-15 12:57:58,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 193. [2018-10-15 12:57:58,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 12:57:58,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 12:57:58,596 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-10-15 12:57:58,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:58,596 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 12:57:58,596 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:58,596 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 12:57:58,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 12:57:58,597 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:58,597 INFO L375 BasicCegarLoop]: trace histogram [91, 91, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:58,597 INFO L424 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:58,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:58,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1274067939, now seen corresponding path program 91 times [2018-10-15 12:57:58,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:01,880 INFO L134 CoverageAnalysis]: Checked inductivity of 8281 backedges. 0 proven. 8281 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:01,880 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:01,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-10-15 12:58:01,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-10-15 12:58:01,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-10-15 12:58:01,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:58:01,882 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 94 states. [2018-10-15 12:58:02,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:02,263 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-15 12:58:02,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-10-15 12:58:02,263 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 192 [2018-10-15 12:58:02,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:02,265 INFO L225 Difference]: With dead ends: 196 [2018-10-15 12:58:02,265 INFO L226 Difference]: Without dead ends: 196 [2018-10-15 12:58:02,265 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=4371, Invalid=4371, Unknown=0, NotChecked=0, Total=8742 [2018-10-15 12:58:02,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-15 12:58:02,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 195. [2018-10-15 12:58:02,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-10-15 12:58:02,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-10-15 12:58:02,268 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-10-15 12:58:02,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:02,268 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-10-15 12:58:02,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-10-15 12:58:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-10-15 12:58:02,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-10-15 12:58:02,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:02,269 INFO L375 BasicCegarLoop]: trace histogram [92, 92, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:02,269 INFO L424 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:02,269 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash -2095611009, now seen corresponding path program 92 times [2018-10-15 12:58:02,270 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:02,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:05,536 INFO L134 CoverageAnalysis]: Checked inductivity of 8464 backedges. 0 proven. 8464 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:05,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:05,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:58:05,537 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:58:05,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:58:05,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:58:05,538 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 95 states. [2018-10-15 12:58:06,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:06,220 INFO L93 Difference]: Finished difference Result 198 states and 198 transitions. [2018-10-15 12:58:06,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:58:06,220 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 194 [2018-10-15 12:58:06,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:06,221 INFO L225 Difference]: With dead ends: 198 [2018-10-15 12:58:06,221 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:58:06,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4465, Invalid=4465, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:58:06,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:58:06,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 197. [2018-10-15 12:58:06,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-10-15 12:58:06,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-10-15 12:58:06,224 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-10-15 12:58:06,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:06,224 INFO L481 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-10-15 12:58:06,224 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:06,225 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-10-15 12:58:06,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-10-15 12:58:06,225 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:06,226 INFO L375 BasicCegarLoop]: trace histogram [93, 93, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:06,226 INFO L424 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:06,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:06,226 INFO L82 PathProgramCache]: Analyzing trace with hash -1324518815, now seen corresponding path program 93 times [2018-10-15 12:58:06,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:06,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:09,465 INFO L134 CoverageAnalysis]: Checked inductivity of 8649 backedges. 0 proven. 8649 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:09,465 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:09,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-10-15 12:58:09,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-10-15 12:58:09,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-10-15 12:58:09,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:58:09,467 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 96 states. [2018-10-15 12:58:10,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:10,154 INFO L93 Difference]: Finished difference Result 200 states and 200 transitions. [2018-10-15 12:58:10,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-10-15 12:58:10,155 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 196 [2018-10-15 12:58:10,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:10,155 INFO L225 Difference]: With dead ends: 200 [2018-10-15 12:58:10,155 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 12:58:10,156 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4560, Invalid=4560, Unknown=0, NotChecked=0, Total=9120 [2018-10-15 12:58:10,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 12:58:10,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 199. [2018-10-15 12:58:10,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-10-15 12:58:10,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-10-15 12:58:10,158 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-10-15 12:58:10,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:10,158 INFO L481 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-10-15 12:58:10,158 INFO L482 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-10-15 12:58:10,158 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-10-15 12:58:10,159 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-10-15 12:58:10,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:10,159 INFO L375 BasicCegarLoop]: trace histogram [94, 94, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:10,159 INFO L424 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:10,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:10,159 INFO L82 PathProgramCache]: Analyzing trace with hash 960704707, now seen corresponding path program 94 times [2018-10-15 12:58:10,160 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:10,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:14,214 INFO L134 CoverageAnalysis]: Checked inductivity of 8836 backedges. 0 proven. 8836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:14,214 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:14,214 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:14,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:14,215 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:14,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:14,215 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 97 states. [2018-10-15 12:58:14,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:14,880 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 12:58:14,880 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-10-15 12:58:14,880 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 198 [2018-10-15 12:58:14,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:14,881 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:58:14,881 INFO L226 Difference]: Without dead ends: 202 [2018-10-15 12:58:14,882 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4656, Invalid=4656, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:14,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 202 states. [2018-10-15 12:58:14,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 202 to 201. [2018-10-15 12:58:14,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-10-15 12:58:14,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-10-15 12:58:14,883 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-10-15 12:58:14,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:14,884 INFO L481 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-10-15 12:58:14,884 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:14,884 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-10-15 12:58:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-10-15 12:58:14,884 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:14,885 INFO L375 BasicCegarLoop]: trace histogram [95, 95, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:14,885 INFO L424 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:14,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:14,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1962746203, now seen corresponding path program 95 times [2018-10-15 12:58:14,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:14,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:18,362 INFO L134 CoverageAnalysis]: Checked inductivity of 9025 backedges. 0 proven. 9025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:18,363 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:18,363 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-10-15 12:58:18,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-10-15 12:58:18,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-10-15 12:58:18,364 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:58:18,364 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 98 states. [2018-10-15 12:58:18,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:18,929 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 12:58:18,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 12:58:18,929 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 200 [2018-10-15 12:58:18,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:18,930 INFO L225 Difference]: With dead ends: 204 [2018-10-15 12:58:18,930 INFO L226 Difference]: Without dead ends: 204 [2018-10-15 12:58:18,930 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4753, Invalid=4753, Unknown=0, NotChecked=0, Total=9506 [2018-10-15 12:58:18,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2018-10-15 12:58:18,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 203. [2018-10-15 12:58:18,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 12:58:18,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 12:58:18,932 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-10-15 12:58:18,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:18,933 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 12:58:18,933 INFO L482 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-10-15 12:58:18,933 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 12:58:18,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 12:58:18,934 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:18,934 INFO L375 BasicCegarLoop]: trace histogram [96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:18,934 INFO L424 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:18,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:18,934 INFO L82 PathProgramCache]: Analyzing trace with hash 1804508167, now seen corresponding path program 96 times [2018-10-15 12:58:18,935 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:18,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 9216 backedges. 0 proven. 9216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:22,556 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:22,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:22,556 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:22,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:22,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:22,557 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 99 states. [2018-10-15 12:58:23,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:23,166 INFO L93 Difference]: Finished difference Result 206 states and 206 transitions. [2018-10-15 12:58:23,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-10-15 12:58:23,167 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 202 [2018-10-15 12:58:23,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:23,167 INFO L225 Difference]: With dead ends: 206 [2018-10-15 12:58:23,167 INFO L226 Difference]: Without dead ends: 206 [2018-10-15 12:58:23,168 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4851, Invalid=4851, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:23,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2018-10-15 12:58:23,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 205. [2018-10-15 12:58:23,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:58:23,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-10-15 12:58:23,170 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-10-15 12:58:23,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:23,170 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-10-15 12:58:23,170 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:23,170 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-10-15 12:58:23,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 12:58:23,171 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:23,171 INFO L375 BasicCegarLoop]: trace histogram [97, 97, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:23,171 INFO L424 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:23,171 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:23,171 INFO L82 PathProgramCache]: Analyzing trace with hash 1478527209, now seen corresponding path program 97 times [2018-10-15 12:58:23,172 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:23,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:26,906 INFO L134 CoverageAnalysis]: Checked inductivity of 9409 backedges. 0 proven. 9409 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:26,906 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:26,906 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-10-15 12:58:26,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-10-15 12:58:26,907 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-10-15 12:58:26,907 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:58:26,908 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 100 states. [2018-10-15 12:58:27,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:27,514 INFO L93 Difference]: Finished difference Result 208 states and 208 transitions. [2018-10-15 12:58:27,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-10-15 12:58:27,515 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 204 [2018-10-15 12:58:27,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:27,516 INFO L225 Difference]: With dead ends: 208 [2018-10-15 12:58:27,516 INFO L226 Difference]: Without dead ends: 208 [2018-10-15 12:58:27,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4950, Invalid=4950, Unknown=0, NotChecked=0, Total=9900 [2018-10-15 12:58:27,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2018-10-15 12:58:27,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 207. [2018-10-15 12:58:27,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-10-15 12:58:27,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-10-15 12:58:27,518 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-10-15 12:58:27,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:27,518 INFO L481 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-10-15 12:58:27,518 INFO L482 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-10-15 12:58:27,518 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-10-15 12:58:27,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-10-15 12:58:27,519 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:27,519 INFO L375 BasicCegarLoop]: trace histogram [98, 98, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:27,520 INFO L424 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:27,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:27,520 INFO L82 PathProgramCache]: Analyzing trace with hash 1743439179, now seen corresponding path program 98 times [2018-10-15 12:58:27,520 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:27,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:31,197 INFO L134 CoverageAnalysis]: Checked inductivity of 9604 backedges. 0 proven. 9604 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:31,198 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:31,198 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:31,198 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:31,198 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:31,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:31,199 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 101 states. [2018-10-15 12:58:31,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:31,856 INFO L93 Difference]: Finished difference Result 210 states and 210 transitions. [2018-10-15 12:58:31,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:58:31,857 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 206 [2018-10-15 12:58:31,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:31,857 INFO L225 Difference]: With dead ends: 210 [2018-10-15 12:58:31,857 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 12:58:31,858 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5050, Invalid=5050, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:31,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 12:58:31,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 209. [2018-10-15 12:58:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:58:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 12:58:31,860 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-10-15 12:58:31,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:31,861 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 12:58:31,861 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:31,861 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 12:58:31,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:58:31,862 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:31,862 INFO L375 BasicCegarLoop]: trace histogram [99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:31,862 INFO L424 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:31,862 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:31,863 INFO L82 PathProgramCache]: Analyzing trace with hash -1374195411, now seen corresponding path program 99 times [2018-10-15 12:58:31,863 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:35,420 INFO L134 CoverageAnalysis]: Checked inductivity of 9801 backedges. 0 proven. 9801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:35,420 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:35,420 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-10-15 12:58:35,420 INFO L460 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-10-15 12:58:35,421 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-10-15 12:58:35,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:58:35,421 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 102 states. [2018-10-15 12:58:36,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:36,229 INFO L93 Difference]: Finished difference Result 212 states and 212 transitions. [2018-10-15 12:58:36,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-10-15 12:58:36,230 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 208 [2018-10-15 12:58:36,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:36,230 INFO L225 Difference]: With dead ends: 212 [2018-10-15 12:58:36,231 INFO L226 Difference]: Without dead ends: 212 [2018-10-15 12:58:36,231 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=5151, Invalid=5151, Unknown=0, NotChecked=0, Total=10302 [2018-10-15 12:58:36,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 212 states. [2018-10-15 12:58:36,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 212 to 211. [2018-10-15 12:58:36,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-10-15 12:58:36,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-10-15 12:58:36,233 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-10-15 12:58:36,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:36,233 INFO L481 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-10-15 12:58:36,233 INFO L482 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-10-15 12:58:36,233 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-10-15 12:58:36,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-10-15 12:58:36,234 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:36,234 INFO L375 BasicCegarLoop]: trace histogram [100, 100, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:36,234 INFO L424 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:36,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:36,235 INFO L82 PathProgramCache]: Analyzing trace with hash 466136207, now seen corresponding path program 100 times [2018-10-15 12:58:36,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:36,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:39,867 INFO L134 CoverageAnalysis]: Checked inductivity of 10000 backedges. 0 proven. 10000 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:39,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:39,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:39,868 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:39,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:39,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:39,869 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 103 states. [2018-10-15 12:58:40,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:40,624 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 12:58:40,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-10-15 12:58:40,624 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 210 [2018-10-15 12:58:40,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:40,625 INFO L225 Difference]: With dead ends: 214 [2018-10-15 12:58:40,625 INFO L226 Difference]: Without dead ends: 214 [2018-10-15 12:58:40,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5253, Invalid=5253, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:40,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2018-10-15 12:58:40,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 213. [2018-10-15 12:58:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 12:58:40,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 12:58:40,628 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-10-15 12:58:40,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:40,629 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 12:58:40,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 12:58:40,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 12:58:40,630 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:40,630 INFO L375 BasicCegarLoop]: trace histogram [101, 101, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:40,630 INFO L424 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:40,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:40,631 INFO L82 PathProgramCache]: Analyzing trace with hash -501704847, now seen corresponding path program 101 times [2018-10-15 12:58:40,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:44,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10201 backedges. 0 proven. 10201 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:44,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:44,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-10-15 12:58:44,502 INFO L460 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-10-15 12:58:44,503 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-10-15 12:58:44,503 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:58:44,504 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 104 states. [2018-10-15 12:58:45,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:45,289 INFO L93 Difference]: Finished difference Result 216 states and 216 transitions. [2018-10-15 12:58:45,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 12:58:45,289 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 212 [2018-10-15 12:58:45,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:45,290 INFO L225 Difference]: With dead ends: 216 [2018-10-15 12:58:45,290 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:58:45,291 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=5356, Invalid=5356, Unknown=0, NotChecked=0, Total=10712 [2018-10-15 12:58:45,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:58:45,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 215. [2018-10-15 12:58:45,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-10-15 12:58:45,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-10-15 12:58:45,294 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-10-15 12:58:45,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:45,294 INFO L481 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-10-15 12:58:45,294 INFO L482 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-10-15 12:58:45,294 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-10-15 12:58:45,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-10-15 12:58:45,295 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:45,295 INFO L375 BasicCegarLoop]: trace histogram [102, 102, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:45,296 INFO L424 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:45,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash 1410945491, now seen corresponding path program 102 times [2018-10-15 12:58:45,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:45,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:49,557 INFO L134 CoverageAnalysis]: Checked inductivity of 10404 backedges. 0 proven. 10404 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:49,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:49,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:49,558 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:49,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:49,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:49,559 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 105 states. [2018-10-15 12:58:50,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:50,065 INFO L93 Difference]: Finished difference Result 218 states and 218 transitions. [2018-10-15 12:58:50,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-10-15 12:58:50,066 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 214 [2018-10-15 12:58:50,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:50,067 INFO L225 Difference]: With dead ends: 218 [2018-10-15 12:58:50,067 INFO L226 Difference]: Without dead ends: 218 [2018-10-15 12:58:50,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5460, Invalid=5460, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:50,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 218 states. [2018-10-15 12:58:50,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 218 to 217. [2018-10-15 12:58:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 12:58:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-10-15 12:58:50,070 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-10-15 12:58:50,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:50,071 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-10-15 12:58:50,071 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:50,071 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-10-15 12:58:50,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 12:58:50,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:50,072 INFO L375 BasicCegarLoop]: trace histogram [103, 103, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:50,072 INFO L424 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:50,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:50,072 INFO L82 PathProgramCache]: Analyzing trace with hash 1221917621, now seen corresponding path program 103 times [2018-10-15 12:58:50,073 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:54,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10609 backedges. 0 proven. 10609 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:54,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:54,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-10-15 12:58:54,192 INFO L460 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-10-15 12:58:54,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-10-15 12:58:54,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:58:54,193 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 106 states. [2018-10-15 12:58:54,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:54,654 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 12:58:54,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-10-15 12:58:54,655 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 216 [2018-10-15 12:58:54,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:54,656 INFO L225 Difference]: With dead ends: 220 [2018-10-15 12:58:54,656 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 12:58:54,656 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5565, Invalid=5565, Unknown=0, NotChecked=0, Total=11130 [2018-10-15 12:58:54,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 12:58:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 219. [2018-10-15 12:58:54,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-10-15 12:58:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-10-15 12:58:54,659 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-10-15 12:58:54,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:54,659 INFO L481 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-10-15 12:58:54,659 INFO L482 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-10-15 12:58:54,660 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-10-15 12:58:54,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-10-15 12:58:54,660 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:54,660 INFO L375 BasicCegarLoop]: trace histogram [104, 104, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:54,661 INFO L424 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:54,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:54,661 INFO L82 PathProgramCache]: Analyzing trace with hash -45239017, now seen corresponding path program 104 times [2018-10-15 12:58:54,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:58,981 INFO L134 CoverageAnalysis]: Checked inductivity of 10816 backedges. 0 proven. 10816 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:58,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:58,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:58,982 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:58,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:58,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:58,983 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 107 states. [2018-10-15 12:58:59,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:59,608 INFO L93 Difference]: Finished difference Result 222 states and 222 transitions. [2018-10-15 12:58:59,608 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:58:59,608 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 218 [2018-10-15 12:58:59,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:59,609 INFO L225 Difference]: With dead ends: 222 [2018-10-15 12:58:59,609 INFO L226 Difference]: Without dead ends: 222 [2018-10-15 12:58:59,609 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5671, Invalid=5671, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:59,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2018-10-15 12:58:59,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 221. [2018-10-15 12:58:59,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-10-15 12:58:59,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-10-15 12:58:59,611 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-10-15 12:58:59,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:59,611 INFO L481 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-10-15 12:58:59,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-10-15 12:58:59,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-10-15 12:58:59,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:59,613 INFO L375 BasicCegarLoop]: trace histogram [105, 105, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:59,613 INFO L424 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:59,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:59,613 INFO L82 PathProgramCache]: Analyzing trace with hash 1987943929, now seen corresponding path program 105 times [2018-10-15 12:58:59,614 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:03,961 INFO L134 CoverageAnalysis]: Checked inductivity of 11025 backedges. 0 proven. 11025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:03,961 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:03,961 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-10-15 12:59:03,961 INFO L460 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-10-15 12:59:03,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-10-15 12:59:03,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:59:03,963 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 108 states. [2018-10-15 12:59:04,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:04,802 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 12:59:04,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-10-15 12:59:04,803 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 220 [2018-10-15 12:59:04,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:04,803 INFO L225 Difference]: With dead ends: 224 [2018-10-15 12:59:04,803 INFO L226 Difference]: Without dead ends: 224 [2018-10-15 12:59:04,804 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5778, Invalid=5778, Unknown=0, NotChecked=0, Total=11556 [2018-10-15 12:59:04,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2018-10-15 12:59:04,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 223. [2018-10-15 12:59:04,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 12:59:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 12:59:04,805 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-10-15 12:59:04,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:04,806 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 12:59:04,806 INFO L482 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-10-15 12:59:04,806 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 12:59:04,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 12:59:04,807 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:04,807 INFO L375 BasicCegarLoop]: trace histogram [106, 106, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:04,807 INFO L424 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:04,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:04,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1666635355, now seen corresponding path program 106 times [2018-10-15 12:59:04,808 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:09,267 INFO L134 CoverageAnalysis]: Checked inductivity of 11236 backedges. 0 proven. 11236 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:09,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:09,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:59:09,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:59:09,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:59:09,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:09,269 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 109 states. [2018-10-15 12:59:10,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:10,015 INFO L93 Difference]: Finished difference Result 226 states and 226 transitions. [2018-10-15 12:59:10,015 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-10-15 12:59:10,015 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 222 [2018-10-15 12:59:10,016 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:10,016 INFO L225 Difference]: With dead ends: 226 [2018-10-15 12:59:10,016 INFO L226 Difference]: Without dead ends: 226 [2018-10-15 12:59:10,017 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5886, Invalid=5886, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:59:10,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2018-10-15 12:59:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 225. [2018-10-15 12:59:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-10-15 12:59:10,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-10-15 12:59:10,019 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-10-15 12:59:10,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:10,019 INFO L481 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-10-15 12:59:10,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:10,019 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-10-15 12:59:10,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-10-15 12:59:10,020 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:10,020 INFO L375 BasicCegarLoop]: trace histogram [107, 107, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:10,020 INFO L424 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:10,021 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:10,021 INFO L82 PathProgramCache]: Analyzing trace with hash 2126741053, now seen corresponding path program 107 times [2018-10-15 12:59:10,021 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:14,384 INFO L134 CoverageAnalysis]: Checked inductivity of 11449 backedges. 0 proven. 11449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:14,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:14,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-10-15 12:59:14,385 INFO L460 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-10-15 12:59:14,385 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-10-15 12:59:14,386 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:59:14,386 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 110 states. [2018-10-15 12:59:15,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:15,153 INFO L93 Difference]: Finished difference Result 228 states and 228 transitions. [2018-10-15 12:59:15,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 12:59:15,154 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 224 [2018-10-15 12:59:15,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:15,154 INFO L225 Difference]: With dead ends: 228 [2018-10-15 12:59:15,155 INFO L226 Difference]: Without dead ends: 228 [2018-10-15 12:59:15,155 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5995, Invalid=5995, Unknown=0, NotChecked=0, Total=11990 [2018-10-15 12:59:15,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2018-10-15 12:59:15,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 227. [2018-10-15 12:59:15,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:59:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:59:15,157 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-10-15 12:59:15,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:15,157 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:59:15,157 INFO L482 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-10-15 12:59:15,158 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:59:15,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:59:15,158 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:15,158 INFO L375 BasicCegarLoop]: trace histogram [108, 108, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:15,159 INFO L424 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:15,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:15,159 INFO L82 PathProgramCache]: Analyzing trace with hash 1906685343, now seen corresponding path program 108 times [2018-10-15 12:59:15,159 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:19,708 INFO L134 CoverageAnalysis]: Checked inductivity of 11664 backedges. 0 proven. 11664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:19,708 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:19,709 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:19,709 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:19,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:19,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:19,710 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 111 states. [2018-10-15 12:59:20,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:20,338 INFO L93 Difference]: Finished difference Result 230 states and 230 transitions. [2018-10-15 12:59:20,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-10-15 12:59:20,338 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 226 [2018-10-15 12:59:20,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:20,338 INFO L225 Difference]: With dead ends: 230 [2018-10-15 12:59:20,339 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 12:59:20,339 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6105, Invalid=6105, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 12:59:20,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 229. [2018-10-15 12:59:20,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 12:59:20,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-10-15 12:59:20,341 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-10-15 12:59:20,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:20,341 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-10-15 12:59:20,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:20,341 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-10-15 12:59:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 12:59:20,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:20,342 INFO L375 BasicCegarLoop]: trace histogram [109, 109, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:20,342 INFO L424 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:20,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:20,342 INFO L82 PathProgramCache]: Analyzing trace with hash 886545537, now seen corresponding path program 109 times [2018-10-15 12:59:20,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:20,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:24,940 INFO L134 CoverageAnalysis]: Checked inductivity of 11881 backedges. 0 proven. 11881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:24,940 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:24,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-10-15 12:59:24,940 INFO L460 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-10-15 12:59:24,941 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-10-15 12:59:24,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 12:59:24,942 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 112 states. [2018-10-15 12:59:25,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:25,513 INFO L93 Difference]: Finished difference Result 232 states and 232 transitions. [2018-10-15 12:59:25,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-10-15 12:59:25,513 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 228 [2018-10-15 12:59:25,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:25,514 INFO L225 Difference]: With dead ends: 232 [2018-10-15 12:59:25,514 INFO L226 Difference]: Without dead ends: 232 [2018-10-15 12:59:25,515 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6216, Invalid=6216, Unknown=0, NotChecked=0, Total=12432 [2018-10-15 12:59:25,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2018-10-15 12:59:25,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 231. [2018-10-15 12:59:25,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-10-15 12:59:25,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-10-15 12:59:25,517 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-10-15 12:59:25,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:25,517 INFO L481 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-10-15 12:59:25,517 INFO L482 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-10-15 12:59:25,517 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-10-15 12:59:25,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-10-15 12:59:25,518 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:25,518 INFO L375 BasicCegarLoop]: trace histogram [110, 110, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:25,518 INFO L424 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:25,519 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:25,519 INFO L82 PathProgramCache]: Analyzing trace with hash -215264541, now seen corresponding path program 110 times [2018-10-15 12:59:25,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:25,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:30,140 INFO L134 CoverageAnalysis]: Checked inductivity of 12100 backedges. 0 proven. 12100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:30,140 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:30,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:30,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:30,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:30,142 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:30,142 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 113 states. [2018-10-15 12:59:31,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:31,051 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 12:59:31,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 12:59:31,051 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 230 [2018-10-15 12:59:31,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:31,052 INFO L225 Difference]: With dead ends: 234 [2018-10-15 12:59:31,052 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:59:31,052 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6328, Invalid=6328, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:31,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:59:31,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 233. [2018-10-15 12:59:31,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 12:59:31,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-15 12:59:31,054 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-10-15 12:59:31,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:31,054 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-15 12:59:31,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:31,054 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-15 12:59:31,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 12:59:31,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:31,055 INFO L375 BasicCegarLoop]: trace histogram [111, 111, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:31,055 INFO L424 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:31,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:31,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1802172613, now seen corresponding path program 111 times [2018-10-15 12:59:31,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:31,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:35,921 INFO L134 CoverageAnalysis]: Checked inductivity of 12321 backedges. 0 proven. 12321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:35,921 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:35,921 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-10-15 12:59:35,922 INFO L460 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-10-15 12:59:35,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-10-15 12:59:35,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:59:35,923 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 114 states. [2018-10-15 12:59:36,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:36,715 INFO L93 Difference]: Finished difference Result 236 states and 236 transitions. [2018-10-15 12:59:36,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-10-15 12:59:36,715 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 232 [2018-10-15 12:59:36,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:36,716 INFO L225 Difference]: With dead ends: 236 [2018-10-15 12:59:36,716 INFO L226 Difference]: Without dead ends: 236 [2018-10-15 12:59:36,716 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6441, Invalid=6441, Unknown=0, NotChecked=0, Total=12882 [2018-10-15 12:59:36,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2018-10-15 12:59:36,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 235. [2018-10-15 12:59:36,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-10-15 12:59:36,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-10-15 12:59:36,718 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-10-15 12:59:36,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:36,718 INFO L481 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-10-15 12:59:36,718 INFO L482 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-10-15 12:59:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-10-15 12:59:36,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-10-15 12:59:36,718 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:36,719 INFO L375 BasicCegarLoop]: trace histogram [112, 112, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:36,719 INFO L424 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:36,719 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:36,719 INFO L82 PathProgramCache]: Analyzing trace with hash -765940185, now seen corresponding path program 112 times [2018-10-15 12:59:36,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 12544 backedges. 0 proven. 12544 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:41,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:41,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:41,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:41,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:41,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:41,540 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 115 states. [2018-10-15 12:59:42,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:42,318 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:59:42,318 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-10-15 12:59:42,319 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 234 [2018-10-15 12:59:42,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:42,319 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:59:42,320 INFO L226 Difference]: Without dead ends: 238 [2018-10-15 12:59:42,320 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6555, Invalid=6555, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:42,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2018-10-15 12:59:42,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 237. [2018-10-15 12:59:42,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-10-15 12:59:42,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-10-15 12:59:42,322 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-10-15 12:59:42,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:42,322 INFO L481 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-10-15 12:59:42,322 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:42,322 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-10-15 12:59:42,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-10-15 12:59:42,323 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:42,323 INFO L375 BasicCegarLoop]: trace histogram [113, 113, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:42,323 INFO L424 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:42,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:42,323 INFO L82 PathProgramCache]: Analyzing trace with hash 883856137, now seen corresponding path program 113 times [2018-10-15 12:59:42,323 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:47,238 INFO L134 CoverageAnalysis]: Checked inductivity of 12769 backedges. 0 proven. 12769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:47,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:47,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-10-15 12:59:47,239 INFO L460 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-10-15 12:59:47,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-10-15 12:59:47,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 12:59:47,240 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 116 states. [2018-10-15 12:59:48,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:48,096 INFO L93 Difference]: Finished difference Result 240 states and 240 transitions. [2018-10-15 12:59:48,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 12:59:48,096 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 236 [2018-10-15 12:59:48,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:48,097 INFO L225 Difference]: With dead ends: 240 [2018-10-15 12:59:48,097 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 12:59:48,098 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6670, Invalid=6670, Unknown=0, NotChecked=0, Total=13340 [2018-10-15 12:59:48,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 12:59:48,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 239. [2018-10-15 12:59:48,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-10-15 12:59:48,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-10-15 12:59:48,100 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-10-15 12:59:48,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:48,100 INFO L481 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-10-15 12:59:48,100 INFO L482 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-10-15 12:59:48,100 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-10-15 12:59:48,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-10-15 12:59:48,101 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:48,101 INFO L375 BasicCegarLoop]: trace histogram [114, 114, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:48,102 INFO L424 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:48,102 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:48,102 INFO L82 PathProgramCache]: Analyzing trace with hash 1495189355, now seen corresponding path program 114 times [2018-10-15 12:59:48,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:53,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12996 backedges. 0 proven. 12996 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:53,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:53,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:53,072 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:53,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:53,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:53,073 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 117 states. [2018-10-15 12:59:53,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:53,909 INFO L93 Difference]: Finished difference Result 242 states and 242 transitions. [2018-10-15 12:59:53,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-10-15 12:59:53,909 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 238 [2018-10-15 12:59:53,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:53,910 INFO L225 Difference]: With dead ends: 242 [2018-10-15 12:59:53,910 INFO L226 Difference]: Without dead ends: 242 [2018-10-15 12:59:53,910 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=6786, Invalid=6786, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:53,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2018-10-15 12:59:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 241. [2018-10-15 12:59:53,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:59:53,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-10-15 12:59:53,912 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-10-15 12:59:53,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:53,912 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-10-15 12:59:53,912 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:53,912 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-10-15 12:59:53,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:59:53,913 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:53,913 INFO L375 BasicCegarLoop]: trace histogram [115, 115, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:53,914 INFO L424 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:53,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:53,914 INFO L82 PathProgramCache]: Analyzing trace with hash 575892301, now seen corresponding path program 115 times [2018-10-15 12:59:53,914 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:53,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:58,824 INFO L134 CoverageAnalysis]: Checked inductivity of 13225 backedges. 0 proven. 13225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:58,825 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:58,825 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-10-15 12:59:58,825 INFO L460 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-10-15 12:59:58,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-10-15 12:59:58,826 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:59:58,826 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 118 states. [2018-10-15 12:59:59,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:59,495 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 12:59:59,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-10-15 12:59:59,496 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 240 [2018-10-15 12:59:59,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:59,497 INFO L225 Difference]: With dead ends: 244 [2018-10-15 12:59:59,497 INFO L226 Difference]: Without dead ends: 244 [2018-10-15 12:59:59,497 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=6903, Invalid=6903, Unknown=0, NotChecked=0, Total=13806 [2018-10-15 12:59:59,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2018-10-15 12:59:59,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2018-10-15 12:59:59,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 12:59:59,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 12:59:59,500 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-10-15 12:59:59,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:59,500 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 12:59:59,500 INFO L482 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-10-15 12:59:59,500 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 12:59:59,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 12:59:59,501 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:59,501 INFO L375 BasicCegarLoop]: trace histogram [116, 116, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:59,501 INFO L424 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:59,501 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:59,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1894686383, now seen corresponding path program 116 times [2018-10-15 12:59:59,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:59,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:04,559 INFO L134 CoverageAnalysis]: Checked inductivity of 13456 backedges. 0 proven. 13456 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:04,559 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:04,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 13:00:04,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 13:00:04,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 13:00:04,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:00:04,561 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 119 states. [2018-10-15 13:00:05,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:05,505 INFO L93 Difference]: Finished difference Result 246 states and 246 transitions. [2018-10-15 13:00:05,506 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 13:00:05,506 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 242 [2018-10-15 13:00:05,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:05,507 INFO L225 Difference]: With dead ends: 246 [2018-10-15 13:00:05,507 INFO L226 Difference]: Without dead ends: 246 [2018-10-15 13:00:05,507 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7021, Invalid=7021, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 13:00:05,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 246 states. [2018-10-15 13:00:05,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 246 to 245. [2018-10-15 13:00:05,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 13:00:05,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 13:00:05,509 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-10-15 13:00:05,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:05,509 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 13:00:05,509 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 13:00:05,509 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 13:00:05,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 13:00:05,510 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:05,510 INFO L375 BasicCegarLoop]: trace histogram [117, 117, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:05,510 INFO L424 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:05,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:05,511 INFO L82 PathProgramCache]: Analyzing trace with hash -2054520431, now seen corresponding path program 117 times [2018-10-15 13:00:05,511 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:05,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:10,638 INFO L134 CoverageAnalysis]: Checked inductivity of 13689 backedges. 0 proven. 13689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:10,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:10,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-10-15 13:00:10,639 INFO L460 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-10-15 13:00:10,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-10-15 13:00:10,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:00:10,640 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 120 states. [2018-10-15 13:00:11,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:11,543 INFO L93 Difference]: Finished difference Result 248 states and 248 transitions. [2018-10-15 13:00:11,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-10-15 13:00:11,544 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 244 [2018-10-15 13:00:11,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:11,544 INFO L225 Difference]: With dead ends: 248 [2018-10-15 13:00:11,544 INFO L226 Difference]: Without dead ends: 248 [2018-10-15 13:00:11,545 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=7140, Invalid=7140, Unknown=0, NotChecked=0, Total=14280 [2018-10-15 13:00:11,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2018-10-15 13:00:11,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 247. [2018-10-15 13:00:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-10-15 13:00:11,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-10-15 13:00:11,546 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-10-15 13:00:11,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:11,547 INFO L481 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-10-15 13:00:11,547 INFO L482 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-10-15 13:00:11,547 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-10-15 13:00:11,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-10-15 13:00:11,548 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:11,548 INFO L375 BasicCegarLoop]: trace histogram [118, 118, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:11,548 INFO L424 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:11,548 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:11,549 INFO L82 PathProgramCache]: Analyzing trace with hash -491179021, now seen corresponding path program 118 times [2018-10-15 13:00:11,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:11,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:16,793 INFO L134 CoverageAnalysis]: Checked inductivity of 13924 backedges. 0 proven. 13924 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:16,794 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:16,794 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 13:00:16,794 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 13:00:16,795 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 13:00:16,795 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:16,795 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 121 states. [2018-10-15 13:00:17,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:17,349 INFO L93 Difference]: Finished difference Result 250 states and 250 transitions. [2018-10-15 13:00:17,350 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-10-15 13:00:17,350 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 246 [2018-10-15 13:00:17,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:17,351 INFO L225 Difference]: With dead ends: 250 [2018-10-15 13:00:17,351 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 13:00:17,351 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7260, Invalid=7260, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 13:00:17,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 13:00:17,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 249. [2018-10-15 13:00:17,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-10-15 13:00:17,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-10-15 13:00:17,353 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-10-15 13:00:17,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:17,353 INFO L481 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-10-15 13:00:17,353 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:17,353 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-10-15 13:00:17,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-10-15 13:00:17,354 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:17,354 INFO L375 BasicCegarLoop]: trace histogram [119, 119, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:17,354 INFO L424 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:17,354 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:17,354 INFO L82 PathProgramCache]: Analyzing trace with hash -1358637611, now seen corresponding path program 119 times [2018-10-15 13:00:17,355 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:17,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:22,625 INFO L134 CoverageAnalysis]: Checked inductivity of 14161 backedges. 0 proven. 14161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:22,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:22,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-10-15 13:00:22,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-10-15 13:00:22,626 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-10-15 13:00:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:00:22,627 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 122 states. [2018-10-15 13:00:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:23,793 INFO L93 Difference]: Finished difference Result 252 states and 252 transitions. [2018-10-15 13:00:23,793 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 13:00:23,793 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 248 [2018-10-15 13:00:23,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:23,794 INFO L225 Difference]: With dead ends: 252 [2018-10-15 13:00:23,794 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 13:00:23,794 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7381, Invalid=7381, Unknown=0, NotChecked=0, Total=14762 [2018-10-15 13:00:23,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 13:00:23,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 251. [2018-10-15 13:00:23,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-10-15 13:00:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-10-15 13:00:23,797 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-10-15 13:00:23,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:23,797 INFO L481 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-10-15 13:00:23,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-10-15 13:00:23,797 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-10-15 13:00:23,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-10-15 13:00:23,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:23,798 INFO L375 BasicCegarLoop]: trace histogram [120, 120, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:23,798 INFO L424 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:23,798 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:23,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1762687177, now seen corresponding path program 120 times [2018-10-15 13:00:23,799 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:29,208 INFO L134 CoverageAnalysis]: Checked inductivity of 14400 backedges. 0 proven. 14400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:29,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:29,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:29,209 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:29,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:29,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:29,210 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 123 states. [2018-10-15 13:00:29,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:29,908 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 13:00:29,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-10-15 13:00:29,909 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 250 [2018-10-15 13:00:29,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:29,910 INFO L225 Difference]: With dead ends: 254 [2018-10-15 13:00:29,910 INFO L226 Difference]: Without dead ends: 254 [2018-10-15 13:00:29,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7503, Invalid=7503, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:29,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2018-10-15 13:00:29,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 253. [2018-10-15 13:00:29,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 13:00:29,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 13:00:29,913 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-10-15 13:00:29,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:29,913 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 13:00:29,913 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:29,913 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 13:00:29,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 13:00:29,914 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:29,914 INFO L375 BasicCegarLoop]: trace histogram [121, 121, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:29,914 INFO L424 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:29,914 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:29,914 INFO L82 PathProgramCache]: Analyzing trace with hash 787703833, now seen corresponding path program 121 times [2018-10-15 13:00:29,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:29,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:35,473 INFO L134 CoverageAnalysis]: Checked inductivity of 14641 backedges. 0 proven. 14641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:35,473 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:35,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-10-15 13:00:35,474 INFO L460 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-10-15 13:00:35,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-10-15 13:00:35,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:00:35,475 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 124 states. [2018-10-15 13:00:36,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:36,590 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 13:00:36,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-10-15 13:00:36,590 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 252 [2018-10-15 13:00:36,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:36,591 INFO L225 Difference]: With dead ends: 256 [2018-10-15 13:00:36,591 INFO L226 Difference]: Without dead ends: 256 [2018-10-15 13:00:36,592 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7626, Invalid=7626, Unknown=0, NotChecked=0, Total=15252 [2018-10-15 13:00:36,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2018-10-15 13:00:36,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 255. [2018-10-15 13:00:36,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-10-15 13:00:36,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-10-15 13:00:36,594 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-10-15 13:00:36,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:36,594 INFO L481 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-10-15 13:00:36,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-10-15 13:00:36,594 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-10-15 13:00:36,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-10-15 13:00:36,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:36,595 INFO L375 BasicCegarLoop]: trace histogram [122, 122, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:36,595 INFO L424 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:36,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:36,595 INFO L82 PathProgramCache]: Analyzing trace with hash -712861573, now seen corresponding path program 122 times [2018-10-15 13:00:36,595 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:42,167 INFO L134 CoverageAnalysis]: Checked inductivity of 14884 backedges. 0 proven. 14884 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:42,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:42,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:42,168 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:42,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:42,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:42,169 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 125 states. [2018-10-15 13:00:43,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:43,012 INFO L93 Difference]: Finished difference Result 258 states and 258 transitions. [2018-10-15 13:00:43,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 13:00:43,013 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 254 [2018-10-15 13:00:43,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:43,014 INFO L225 Difference]: With dead ends: 258 [2018-10-15 13:00:43,014 INFO L226 Difference]: Without dead ends: 258 [2018-10-15 13:00:43,015 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=7750, Invalid=7750, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:43,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2018-10-15 13:00:43,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 257. [2018-10-15 13:00:43,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-10-15 13:00:43,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-10-15 13:00:43,017 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-10-15 13:00:43,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:43,018 INFO L481 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-10-15 13:00:43,018 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:43,018 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-10-15 13:00:43,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-10-15 13:00:43,019 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:43,019 INFO L375 BasicCegarLoop]: trace histogram [123, 123, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:43,019 INFO L424 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:43,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:43,019 INFO L82 PathProgramCache]: Analyzing trace with hash 352794717, now seen corresponding path program 123 times [2018-10-15 13:00:43,020 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:48,758 INFO L134 CoverageAnalysis]: Checked inductivity of 15129 backedges. 0 proven. 15129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:48,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:48,759 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-10-15 13:00:48,759 INFO L460 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-10-15 13:00:48,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-10-15 13:00:48,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 13:00:48,760 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 126 states. [2018-10-15 13:00:50,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:50,006 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2018-10-15 13:00:50,006 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-10-15 13:00:50,006 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 256 [2018-10-15 13:00:50,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:50,007 INFO L225 Difference]: With dead ends: 260 [2018-10-15 13:00:50,007 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 13:00:50,007 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=7875, Invalid=7875, Unknown=0, NotChecked=0, Total=15750 [2018-10-15 13:00:50,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 13:00:50,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 259. [2018-10-15 13:00:50,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-10-15 13:00:50,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-10-15 13:00:50,009 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-10-15 13:00:50,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:50,009 INFO L481 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-10-15 13:00:50,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-10-15 13:00:50,009 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-10-15 13:00:50,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-10-15 13:00:50,010 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:50,010 INFO L375 BasicCegarLoop]: trace histogram [124, 124, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:50,010 INFO L424 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:50,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:50,010 INFO L82 PathProgramCache]: Analyzing trace with hash -2048694337, now seen corresponding path program 124 times [2018-10-15 13:00:50,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:55,680 INFO L134 CoverageAnalysis]: Checked inductivity of 15376 backedges. 0 proven. 15376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:55,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:55,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:55,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:55,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:55,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:55,682 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 127 states. [2018-10-15 13:00:56,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:56,515 INFO L93 Difference]: Finished difference Result 262 states and 262 transitions. [2018-10-15 13:00:56,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-10-15 13:00:56,516 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 258 [2018-10-15 13:00:56,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:56,517 INFO L225 Difference]: With dead ends: 262 [2018-10-15 13:00:56,517 INFO L226 Difference]: Without dead ends: 262 [2018-10-15 13:00:56,517 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8001, Invalid=8001, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:56,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2018-10-15 13:00:56,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 261. [2018-10-15 13:00:56,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-10-15 13:00:56,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-10-15 13:00:56,520 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-10-15 13:00:56,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:56,521 INFO L481 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-10-15 13:00:56,521 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:56,521 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-10-15 13:00:56,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-10-15 13:00:56,522 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:56,522 INFO L375 BasicCegarLoop]: trace histogram [125, 125, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:56,522 INFO L424 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:56,522 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:56,523 INFO L82 PathProgramCache]: Analyzing trace with hash 812730017, now seen corresponding path program 125 times [2018-10-15 13:00:56,523 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:56,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:02,307 INFO L134 CoverageAnalysis]: Checked inductivity of 15625 backedges. 0 proven. 15625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:02,307 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:02,307 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-10-15 13:01:02,307 INFO L460 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-10-15 13:01:02,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-10-15 13:01:02,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:01:02,309 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 128 states. [2018-10-15 13:01:03,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:03,546 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 13:01:03,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 13:01:03,546 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 260 [2018-10-15 13:01:03,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:03,547 INFO L225 Difference]: With dead ends: 264 [2018-10-15 13:01:03,547 INFO L226 Difference]: Without dead ends: 264 [2018-10-15 13:01:03,547 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=8128, Invalid=8128, Unknown=0, NotChecked=0, Total=16256 [2018-10-15 13:01:03,547 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2018-10-15 13:01:03,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 263. [2018-10-15 13:01:03,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 13:01:03,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 13:01:03,549 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-10-15 13:01:03,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:03,549 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 13:01:03,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-10-15 13:01:03,549 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 13:01:03,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 13:01:03,550 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:03,550 INFO L375 BasicCegarLoop]: trace histogram [126, 126, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:03,550 INFO L424 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:03,550 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:03,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1862464771, now seen corresponding path program 126 times [2018-10-15 13:01:03,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:09,552 INFO L134 CoverageAnalysis]: Checked inductivity of 15876 backedges. 0 proven. 15876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:09,553 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:09,553 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:01:09,553 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:01:09,554 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:01:09,554 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:09,554 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 129 states. [2018-10-15 13:01:10,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:10,270 INFO L93 Difference]: Finished difference Result 266 states and 266 transitions. [2018-10-15 13:01:10,271 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-10-15 13:01:10,271 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 262 [2018-10-15 13:01:10,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:10,271 INFO L225 Difference]: With dead ends: 266 [2018-10-15 13:01:10,272 INFO L226 Difference]: Without dead ends: 266 [2018-10-15 13:01:10,272 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8256, Invalid=8256, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:01:10,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2018-10-15 13:01:10,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 265. [2018-10-15 13:01:10,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 13:01:10,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-10-15 13:01:10,274 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-10-15 13:01:10,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:10,274 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-10-15 13:01:10,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:01:10,274 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-10-15 13:01:10,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 13:01:10,275 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:10,275 INFO L375 BasicCegarLoop]: trace histogram [127, 127, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:10,275 INFO L424 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:10,276 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:10,276 INFO L82 PathProgramCache]: Analyzing trace with hash 1340248805, now seen corresponding path program 127 times [2018-10-15 13:01:10,276 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:10,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:16,140 INFO L134 CoverageAnalysis]: Checked inductivity of 16129 backedges. 0 proven. 16129 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:16,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:16,141 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-10-15 13:01:16,141 INFO L460 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-10-15 13:01:16,142 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-10-15 13:01:16,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:01:16,143 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 130 states. [2018-10-15 13:01:17,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:17,247 INFO L93 Difference]: Finished difference Result 268 states and 268 transitions. [2018-10-15 13:01:17,247 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-10-15 13:01:17,247 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 264 [2018-10-15 13:01:17,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:17,248 INFO L225 Difference]: With dead ends: 268 [2018-10-15 13:01:17,248 INFO L226 Difference]: Without dead ends: 268 [2018-10-15 13:01:17,249 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8385, Invalid=8385, Unknown=0, NotChecked=0, Total=16770 [2018-10-15 13:01:17,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2018-10-15 13:01:17,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 267. [2018-10-15 13:01:17,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-10-15 13:01:17,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-10-15 13:01:17,251 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-10-15 13:01:17,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:17,252 INFO L481 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-10-15 13:01:17,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-10-15 13:01:17,252 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-10-15 13:01:17,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-10-15 13:01:17,253 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:17,253 INFO L375 BasicCegarLoop]: trace histogram [128, 128, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:17,253 INFO L424 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:17,253 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:17,253 INFO L82 PathProgramCache]: Analyzing trace with hash 2001879111, now seen corresponding path program 128 times [2018-10-15 13:01:17,254 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:23,276 INFO L134 CoverageAnalysis]: Checked inductivity of 16384 backedges. 0 proven. 16384 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:23,276 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:23,276 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:23,277 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:23,279 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 131 states. [2018-10-15 13:01:24,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:24,149 INFO L93 Difference]: Finished difference Result 270 states and 270 transitions. [2018-10-15 13:01:24,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 13:01:24,149 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 266 [2018-10-15 13:01:24,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:24,150 INFO L225 Difference]: With dead ends: 270 [2018-10-15 13:01:24,150 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 13:01:24,151 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=8515, Invalid=8515, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:24,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 13:01:24,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 269. [2018-10-15 13:01:24,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-10-15 13:01:24,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-10-15 13:01:24,154 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-10-15 13:01:24,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:24,154 INFO L481 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-10-15 13:01:24,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:24,154 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-10-15 13:01:24,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-10-15 13:01:24,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:24,155 INFO L375 BasicCegarLoop]: trace histogram [129, 129, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:24,155 INFO L424 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:24,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:24,156 INFO L82 PathProgramCache]: Analyzing trace with hash -2121523927, now seen corresponding path program 129 times [2018-10-15 13:01:24,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:30,622 INFO L134 CoverageAnalysis]: Checked inductivity of 16641 backedges. 0 proven. 16641 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:30,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:30,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-10-15 13:01:30,622 INFO L460 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-10-15 13:01:30,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-10-15 13:01:30,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 13:01:30,623 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 132 states. [2018-10-15 13:01:31,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:31,859 INFO L93 Difference]: Finished difference Result 272 states and 272 transitions. [2018-10-15 13:01:31,860 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-10-15 13:01:31,860 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 268 [2018-10-15 13:01:31,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:31,860 INFO L225 Difference]: With dead ends: 272 [2018-10-15 13:01:31,860 INFO L226 Difference]: Without dead ends: 272 [2018-10-15 13:01:31,861 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=8646, Invalid=8646, Unknown=0, NotChecked=0, Total=17292 [2018-10-15 13:01:31,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 272 states. [2018-10-15 13:01:31,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 272 to 271. [2018-10-15 13:01:31,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-10-15 13:01:31,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-10-15 13:01:31,863 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-10-15 13:01:31,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:31,863 INFO L481 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-10-15 13:01:31,863 INFO L482 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-10-15 13:01:31,863 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-10-15 13:01:31,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-10-15 13:01:31,864 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:31,864 INFO L375 BasicCegarLoop]: trace histogram [130, 130, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:31,864 INFO L424 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:31,864 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:31,864 INFO L82 PathProgramCache]: Analyzing trace with hash -457029237, now seen corresponding path program 130 times [2018-10-15 13:01:31,865 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:38,077 INFO L134 CoverageAnalysis]: Checked inductivity of 16900 backedges. 0 proven. 16900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:38,078 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:38,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:38,078 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:38,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:38,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:38,079 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 133 states. [2018-10-15 13:01:39,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:39,377 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 13:01:39,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-10-15 13:01:39,377 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 270 [2018-10-15 13:01:39,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:39,378 INFO L225 Difference]: With dead ends: 274 [2018-10-15 13:01:39,378 INFO L226 Difference]: Without dead ends: 274 [2018-10-15 13:01:39,378 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=8778, Invalid=8778, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:39,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2018-10-15 13:01:39,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 273. [2018-10-15 13:01:39,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 13:01:39,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 13:01:39,380 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-10-15 13:01:39,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:39,380 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 13:01:39,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:39,380 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 13:01:39,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 13:01:39,381 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:39,381 INFO L375 BasicCegarLoop]: trace histogram [131, 131, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:39,381 INFO L424 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:39,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:39,381 INFO L82 PathProgramCache]: Analyzing trace with hash 1394533741, now seen corresponding path program 131 times [2018-10-15 13:01:39,382 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:45,989 INFO L134 CoverageAnalysis]: Checked inductivity of 17161 backedges. 0 proven. 17161 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:45,989 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:45,989 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-10-15 13:01:45,989 INFO L460 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-10-15 13:01:45,990 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-10-15 13:01:45,991 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 13:01:45,991 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 134 states. [2018-10-15 13:01:46,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:46,731 INFO L93 Difference]: Finished difference Result 276 states and 276 transitions. [2018-10-15 13:01:46,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 13:01:46,732 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 272 [2018-10-15 13:01:46,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:46,732 INFO L225 Difference]: With dead ends: 276 [2018-10-15 13:01:46,732 INFO L226 Difference]: Without dead ends: 276 [2018-10-15 13:01:46,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=8911, Invalid=8911, Unknown=0, NotChecked=0, Total=17822 [2018-10-15 13:01:46,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 276 states. [2018-10-15 13:01:46,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 276 to 275. [2018-10-15 13:01:46,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-10-15 13:01:46,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-10-15 13:01:46,734 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-10-15 13:01:46,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:46,735 INFO L481 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-10-15 13:01:46,735 INFO L482 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-10-15 13:01:46,735 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-10-15 13:01:46,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-10-15 13:01:46,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:46,736 INFO L375 BasicCegarLoop]: trace histogram [132, 132, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:46,736 INFO L424 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:46,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:46,736 INFO L82 PathProgramCache]: Analyzing trace with hash -1664872241, now seen corresponding path program 132 times [2018-10-15 13:01:46,736 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:46,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:53,203 INFO L134 CoverageAnalysis]: Checked inductivity of 17424 backedges. 0 proven. 17424 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:53,204 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:53,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:53,204 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:53,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:53,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:53,205 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 135 states. [2018-10-15 13:01:54,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:54,482 INFO L93 Difference]: Finished difference Result 278 states and 278 transitions. [2018-10-15 13:01:54,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-10-15 13:01:54,482 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 274 [2018-10-15 13:01:54,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:54,483 INFO L225 Difference]: With dead ends: 278 [2018-10-15 13:01:54,483 INFO L226 Difference]: Without dead ends: 278 [2018-10-15 13:01:54,484 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=9045, Invalid=9045, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:54,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2018-10-15 13:01:54,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 277. [2018-10-15 13:01:54,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 13:01:54,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-10-15 13:01:54,485 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-10-15 13:01:54,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:54,485 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-10-15 13:01:54,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:54,486 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-10-15 13:01:54,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 13:01:54,486 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:54,486 INFO L375 BasicCegarLoop]: trace histogram [133, 133, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:54,486 INFO L424 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:54,487 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:54,487 INFO L82 PathProgramCache]: Analyzing trace with hash 298576817, now seen corresponding path program 133 times [2018-10-15 13:01:54,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:54,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 17689 backedges. 0 proven. 17689 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:01,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:01,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-10-15 13:02:01,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-10-15 13:02:01,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-10-15 13:02:01,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 13:02:01,379 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 136 states. [2018-10-15 13:02:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:02,779 INFO L93 Difference]: Finished difference Result 280 states and 280 transitions. [2018-10-15 13:02:02,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-10-15 13:02:02,779 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 276 [2018-10-15 13:02:02,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:02,780 INFO L225 Difference]: With dead ends: 280 [2018-10-15 13:02:02,780 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 13:02:02,780 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=9180, Invalid=9180, Unknown=0, NotChecked=0, Total=18360 [2018-10-15 13:02:02,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 13:02:02,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 279. [2018-10-15 13:02:02,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 279 states. [2018-10-15 13:02:02,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 279 transitions. [2018-10-15 13:02:02,782 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 279 transitions. Word has length 276 [2018-10-15 13:02:02,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:02,782 INFO L481 AbstractCegarLoop]: Abstraction has 279 states and 279 transitions. [2018-10-15 13:02:02,782 INFO L482 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-10-15 13:02:02,782 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 279 transitions. [2018-10-15 13:02:02,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2018-10-15 13:02:02,783 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:02,783 INFO L375 BasicCegarLoop]: trace histogram [134, 134, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:02,783 INFO L424 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:02,783 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:02,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1682478611, now seen corresponding path program 134 times [2018-10-15 13:02:02,784 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:02,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:09,428 INFO L134 CoverageAnalysis]: Checked inductivity of 17956 backedges. 0 proven. 17956 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:09,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:09,429 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:02:09,429 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:02:09,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:02:09,430 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:09,430 INFO L87 Difference]: Start difference. First operand 279 states and 279 transitions. Second operand 137 states. [2018-10-15 13:02:10,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:10,404 INFO L93 Difference]: Finished difference Result 282 states and 282 transitions. [2018-10-15 13:02:10,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 13:02:10,405 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 278 [2018-10-15 13:02:10,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:10,405 INFO L225 Difference]: With dead ends: 282 [2018-10-15 13:02:10,405 INFO L226 Difference]: Without dead ends: 282 [2018-10-15 13:02:10,406 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9316, Invalid=9316, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:02:10,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2018-10-15 13:02:10,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 281. [2018-10-15 13:02:10,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 13:02:10,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-15 13:02:10,409 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 278 [2018-10-15 13:02:10,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:10,409 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-15 13:02:10,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:02:10,409 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-15 13:02:10,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 13:02:10,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:10,411 INFO L375 BasicCegarLoop]: trace histogram [135, 135, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:10,411 INFO L424 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:10,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:10,411 INFO L82 PathProgramCache]: Analyzing trace with hash 172240885, now seen corresponding path program 135 times [2018-10-15 13:02:10,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:10,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:17,451 INFO L134 CoverageAnalysis]: Checked inductivity of 18225 backedges. 0 proven. 18225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:17,451 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:17,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-10-15 13:02:17,452 INFO L460 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-10-15 13:02:17,453 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-10-15 13:02:17,453 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 13:02:17,453 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 138 states. [2018-10-15 13:02:18,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:18,403 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-15 13:02:18,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-10-15 13:02:18,404 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 280 [2018-10-15 13:02:18,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:18,404 INFO L225 Difference]: With dead ends: 284 [2018-10-15 13:02:18,404 INFO L226 Difference]: Without dead ends: 284 [2018-10-15 13:02:18,405 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=9453, Invalid=9453, Unknown=0, NotChecked=0, Total=18906 [2018-10-15 13:02:18,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2018-10-15 13:02:18,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 283. [2018-10-15 13:02:18,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 13:02:18,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 13:02:18,407 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 280 [2018-10-15 13:02:18,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:18,408 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 13:02:18,408 INFO L482 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-10-15 13:02:18,408 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 13:02:18,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 13:02:18,409 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:18,409 INFO L375 BasicCegarLoop]: trace histogram [136, 136, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:18,409 INFO L424 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:18,409 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:18,409 INFO L82 PathProgramCache]: Analyzing trace with hash 532732247, now seen corresponding path program 136 times [2018-10-15 13:02:18,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:18,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:25,207 INFO L134 CoverageAnalysis]: Checked inductivity of 18496 backedges. 0 proven. 18496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:25,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:25,208 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:25,208 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:25,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:25,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:25,209 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 139 states. [2018-10-15 13:02:26,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:26,644 INFO L93 Difference]: Finished difference Result 286 states and 286 transitions. [2018-10-15 13:02:26,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2018-10-15 13:02:26,644 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 282 [2018-10-15 13:02:26,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:26,645 INFO L225 Difference]: With dead ends: 286 [2018-10-15 13:02:26,645 INFO L226 Difference]: Without dead ends: 286 [2018-10-15 13:02:26,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=9591, Invalid=9591, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:26,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2018-10-15 13:02:26,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 285. [2018-10-15 13:02:26,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 285 states. [2018-10-15 13:02:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 285 transitions. [2018-10-15 13:02:26,647 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 285 transitions. Word has length 282 [2018-10-15 13:02:26,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:26,647 INFO L481 AbstractCegarLoop]: Abstraction has 285 states and 285 transitions. [2018-10-15 13:02:26,647 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:26,648 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 285 transitions. [2018-10-15 13:02:26,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 285 [2018-10-15 13:02:26,648 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:26,648 INFO L375 BasicCegarLoop]: trace histogram [137, 137, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:26,649 INFO L424 AbstractCegarLoop]: === Iteration 138 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:26,649 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:26,649 INFO L82 PathProgramCache]: Analyzing trace with hash -927419847, now seen corresponding path program 137 times [2018-10-15 13:02:26,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:26,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:33,372 INFO L134 CoverageAnalysis]: Checked inductivity of 18769 backedges. 0 proven. 18769 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:33,372 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:33,372 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [140] total 140 [2018-10-15 13:02:33,373 INFO L460 AbstractCegarLoop]: Interpolant automaton has 140 states [2018-10-15 13:02:33,373 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 140 interpolants. [2018-10-15 13:02:33,374 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 13:02:33,374 INFO L87 Difference]: Start difference. First operand 285 states and 285 transitions. Second operand 140 states. [2018-10-15 13:02:34,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:34,911 INFO L93 Difference]: Finished difference Result 288 states and 288 transitions. [2018-10-15 13:02:34,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 13:02:34,912 INFO L78 Accepts]: Start accepts. Automaton has 140 states. Word has length 284 [2018-10-15 13:02:34,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:34,912 INFO L225 Difference]: With dead ends: 288 [2018-10-15 13:02:34,912 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 13:02:34,913 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9730, Invalid=9730, Unknown=0, NotChecked=0, Total=19460 [2018-10-15 13:02:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 13:02:34,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 287. [2018-10-15 13:02:34,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 287 states. [2018-10-15 13:02:34,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 287 states to 287 states and 287 transitions. [2018-10-15 13:02:34,915 INFO L78 Accepts]: Start accepts. Automaton has 287 states and 287 transitions. Word has length 284 [2018-10-15 13:02:34,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:34,915 INFO L481 AbstractCegarLoop]: Abstraction has 287 states and 287 transitions. [2018-10-15 13:02:34,915 INFO L482 AbstractCegarLoop]: Interpolant automaton has 140 states. [2018-10-15 13:02:34,915 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 287 transitions. [2018-10-15 13:02:34,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2018-10-15 13:02:34,916 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:34,916 INFO L375 BasicCegarLoop]: trace histogram [138, 138, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:34,916 INFO L424 AbstractCegarLoop]: === Iteration 139 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:34,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:34,916 INFO L82 PathProgramCache]: Analyzing trace with hash 320723611, now seen corresponding path program 138 times [2018-10-15 13:02:34,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:42,255 INFO L134 CoverageAnalysis]: Checked inductivity of 19044 backedges. 0 proven. 19044 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:42,255 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:42,255 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:42,255 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:42,256 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:42,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:42,257 INFO L87 Difference]: Start difference. First operand 287 states and 287 transitions. Second operand 141 states. [2018-10-15 13:02:43,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:43,458 INFO L93 Difference]: Finished difference Result 290 states and 290 transitions. [2018-10-15 13:02:43,458 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 141 states. [2018-10-15 13:02:43,458 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 286 [2018-10-15 13:02:43,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:43,459 INFO L225 Difference]: With dead ends: 290 [2018-10-15 13:02:43,459 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 13:02:43,460 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 139 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=9870, Invalid=9870, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:43,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 13:02:43,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 289. [2018-10-15 13:02:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 13:02:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 289 transitions. [2018-10-15 13:02:43,462 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 289 transitions. Word has length 286 [2018-10-15 13:02:43,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:43,462 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 289 transitions. [2018-10-15 13:02:43,462 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:43,462 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 289 transitions. [2018-10-15 13:02:43,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 13:02:43,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:43,463 INFO L375 BasicCegarLoop]: trace histogram [139, 139, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:43,463 INFO L424 AbstractCegarLoop]: === Iteration 140 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:43,463 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:43,463 INFO L82 PathProgramCache]: Analyzing trace with hash 1490711165, now seen corresponding path program 139 times [2018-10-15 13:02:43,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:43,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:50,625 INFO L134 CoverageAnalysis]: Checked inductivity of 19321 backedges. 0 proven. 19321 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:50,625 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:50,625 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [142] total 142 [2018-10-15 13:02:50,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 142 states [2018-10-15 13:02:50,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 142 interpolants. [2018-10-15 13:02:50,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 13:02:50,627 INFO L87 Difference]: Start difference. First operand 289 states and 289 transitions. Second operand 142 states. [2018-10-15 13:02:51,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:51,423 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-15 13:02:51,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 142 states. [2018-10-15 13:02:51,423 INFO L78 Accepts]: Start accepts. Automaton has 142 states. Word has length 288 [2018-10-15 13:02:51,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:51,424 INFO L225 Difference]: With dead ends: 292 [2018-10-15 13:02:51,424 INFO L226 Difference]: Without dead ends: 292 [2018-10-15 13:02:51,424 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.9s TimeCoverageRelationStatistics Valid=10011, Invalid=10011, Unknown=0, NotChecked=0, Total=20022 [2018-10-15 13:02:51,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 292 states. [2018-10-15 13:02:51,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 292 to 291. [2018-10-15 13:02:51,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 291 states. [2018-10-15 13:02:51,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 291 transitions. [2018-10-15 13:02:51,427 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 291 transitions. Word has length 288 [2018-10-15 13:02:51,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:51,427 INFO L481 AbstractCegarLoop]: Abstraction has 291 states and 291 transitions. [2018-10-15 13:02:51,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 142 states. [2018-10-15 13:02:51,427 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 291 transitions. [2018-10-15 13:02:51,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 291 [2018-10-15 13:02:51,428 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:51,428 INFO L375 BasicCegarLoop]: trace histogram [140, 140, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:51,428 INFO L424 AbstractCegarLoop]: === Iteration 141 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:51,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:51,428 INFO L82 PathProgramCache]: Analyzing trace with hash 567319007, now seen corresponding path program 140 times [2018-10-15 13:02:51,429 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:51,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:58,934 INFO L134 CoverageAnalysis]: Checked inductivity of 19600 backedges. 0 proven. 19600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:58,934 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:58,934 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:58,935 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:58,935 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:58,936 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:58,936 INFO L87 Difference]: Start difference. First operand 291 states and 291 transitions. Second operand 143 states. [2018-10-15 13:02:59,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:59,994 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-15 13:02:59,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 13:02:59,994 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 290 [2018-10-15 13:02:59,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:59,995 INFO L225 Difference]: With dead ends: 294 [2018-10-15 13:02:59,995 INFO L226 Difference]: Without dead ends: 294 [2018-10-15 13:02:59,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=10153, Invalid=10153, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:59,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states. [2018-10-15 13:02:59,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 293. [2018-10-15 13:02:59,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 13:02:59,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-15 13:02:59,998 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 290 [2018-10-15 13:02:59,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:59,999 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-15 13:02:59,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:02:59,999 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-15 13:03:00,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 13:03:00,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:00,000 INFO L375 BasicCegarLoop]: trace histogram [141, 141, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:00,000 INFO L424 AbstractCegarLoop]: === Iteration 142 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:00,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:00,001 INFO L82 PathProgramCache]: Analyzing trace with hash -2049281855, now seen corresponding path program 141 times [2018-10-15 13:03:00,001 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:00,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:07,771 INFO L134 CoverageAnalysis]: Checked inductivity of 19881 backedges. 0 proven. 19881 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:07,771 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:07,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [144] total 144 [2018-10-15 13:03:07,771 INFO L460 AbstractCegarLoop]: Interpolant automaton has 144 states [2018-10-15 13:03:07,772 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 144 interpolants. [2018-10-15 13:03:07,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 13:03:07,773 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 144 states. [2018-10-15 13:03:09,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:09,239 INFO L93 Difference]: Finished difference Result 296 states and 296 transitions. [2018-10-15 13:03:09,239 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 144 states. [2018-10-15 13:03:09,239 INFO L78 Accepts]: Start accepts. Automaton has 144 states. Word has length 292 [2018-10-15 13:03:09,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:09,240 INFO L225 Difference]: With dead ends: 296 [2018-10-15 13:03:09,240 INFO L226 Difference]: Without dead ends: 296 [2018-10-15 13:03:09,240 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=10296, Invalid=10296, Unknown=0, NotChecked=0, Total=20592 [2018-10-15 13:03:09,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2018-10-15 13:03:09,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 295. [2018-10-15 13:03:09,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 295 states. [2018-10-15 13:03:09,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 295 transitions. [2018-10-15 13:03:09,242 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 295 transitions. Word has length 292 [2018-10-15 13:03:09,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:09,242 INFO L481 AbstractCegarLoop]: Abstraction has 295 states and 295 transitions. [2018-10-15 13:03:09,242 INFO L482 AbstractCegarLoop]: Interpolant automaton has 144 states. [2018-10-15 13:03:09,242 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 295 transitions. [2018-10-15 13:03:09,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2018-10-15 13:03:09,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:09,243 INFO L375 BasicCegarLoop]: trace histogram [142, 142, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:09,243 INFO L424 AbstractCegarLoop]: === Iteration 143 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:09,244 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:09,244 INFO L82 PathProgramCache]: Analyzing trace with hash 248125219, now seen corresponding path program 142 times [2018-10-15 13:03:09,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:09,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:16,642 INFO L134 CoverageAnalysis]: Checked inductivity of 20164 backedges. 0 proven. 20164 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:16,642 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:16,643 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:03:16,643 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:03:16,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:03:16,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:16,644 INFO L87 Difference]: Start difference. First operand 295 states and 295 transitions. Second operand 145 states. [2018-10-15 13:03:18,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:18,119 INFO L93 Difference]: Finished difference Result 298 states and 298 transitions. [2018-10-15 13:03:18,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 145 states. [2018-10-15 13:03:18,119 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 294 [2018-10-15 13:03:18,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:18,120 INFO L225 Difference]: With dead ends: 298 [2018-10-15 13:03:18,120 INFO L226 Difference]: Without dead ends: 298 [2018-10-15 13:03:18,120 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 143 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=10440, Invalid=10440, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:03:18,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states. [2018-10-15 13:03:18,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 297. [2018-10-15 13:03:18,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2018-10-15 13:03:18,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 297 transitions. [2018-10-15 13:03:18,122 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 297 transitions. Word has length 294 [2018-10-15 13:03:18,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:18,122 INFO L481 AbstractCegarLoop]: Abstraction has 297 states and 297 transitions. [2018-10-15 13:03:18,123 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:03:18,123 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 297 transitions. [2018-10-15 13:03:18,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2018-10-15 13:03:18,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:18,123 INFO L375 BasicCegarLoop]: trace histogram [143, 143, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:18,124 INFO L424 AbstractCegarLoop]: === Iteration 144 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:18,124 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:18,124 INFO L82 PathProgramCache]: Analyzing trace with hash 443133189, now seen corresponding path program 143 times [2018-10-15 13:03:18,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:18,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:25,716 INFO L134 CoverageAnalysis]: Checked inductivity of 20449 backedges. 0 proven. 20449 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:25,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:25,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2018-10-15 13:03:25,717 INFO L460 AbstractCegarLoop]: Interpolant automaton has 146 states [2018-10-15 13:03:25,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 146 interpolants. [2018-10-15 13:03:25,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 13:03:25,719 INFO L87 Difference]: Start difference. First operand 297 states and 297 transitions. Second operand 146 states. [2018-10-15 13:03:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:27,375 INFO L93 Difference]: Finished difference Result 300 states and 300 transitions. [2018-10-15 13:03:27,375 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 13:03:27,375 INFO L78 Accepts]: Start accepts. Automaton has 146 states. Word has length 296 [2018-10-15 13:03:27,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:27,376 INFO L225 Difference]: With dead ends: 300 [2018-10-15 13:03:27,376 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 13:03:27,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.4s TimeCoverageRelationStatistics Valid=10585, Invalid=10585, Unknown=0, NotChecked=0, Total=21170 [2018-10-15 13:03:27,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 13:03:27,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 299. [2018-10-15 13:03:27,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 13:03:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 13:03:27,378 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 296 [2018-10-15 13:03:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:27,379 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 13:03:27,379 INFO L482 AbstractCegarLoop]: Interpolant automaton has 146 states. [2018-10-15 13:03:27,379 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 13:03:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 13:03:27,380 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:27,380 INFO L375 BasicCegarLoop]: trace histogram [144, 144, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:27,380 INFO L424 AbstractCegarLoop]: === Iteration 145 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:27,380 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:27,380 INFO L82 PathProgramCache]: Analyzing trace with hash -1132768665, now seen corresponding path program 144 times [2018-10-15 13:03:27,381 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 20736 backedges. 0 proven. 20736 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:35,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:35,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:35,376 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:35,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:35,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:35,378 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 147 states. [2018-10-15 13:03:37,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:37,131 INFO L93 Difference]: Finished difference Result 302 states and 302 transitions. [2018-10-15 13:03:37,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2018-10-15 13:03:37,131 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 298 [2018-10-15 13:03:37,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:37,132 INFO L225 Difference]: With dead ends: 302 [2018-10-15 13:03:37,132 INFO L226 Difference]: Without dead ends: 302 [2018-10-15 13:03:37,133 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10731, Invalid=10731, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2018-10-15 13:03:37,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 301. [2018-10-15 13:03:37,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 13:03:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 301 transitions. [2018-10-15 13:03:37,134 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 301 transitions. Word has length 298 [2018-10-15 13:03:37,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:37,135 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 301 transitions. [2018-10-15 13:03:37,135 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:37,135 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 301 transitions. [2018-10-15 13:03:37,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 13:03:37,136 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:37,136 INFO L375 BasicCegarLoop]: trace histogram [145, 145, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:37,136 INFO L424 AbstractCegarLoop]: === Iteration 146 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:37,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:37,136 INFO L82 PathProgramCache]: Analyzing trace with hash 549005129, now seen corresponding path program 145 times [2018-10-15 13:03:37,136 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:37,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:45,143 INFO L134 CoverageAnalysis]: Checked inductivity of 21025 backedges. 0 proven. 21025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:45,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:45,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [148] total 148 [2018-10-15 13:03:45,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 148 states [2018-10-15 13:03:45,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 148 interpolants. [2018-10-15 13:03:45,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 13:03:45,145 INFO L87 Difference]: Start difference. First operand 301 states and 301 transitions. Second operand 148 states. [2018-10-15 13:03:46,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:46,954 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-15 13:03:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 148 states. [2018-10-15 13:03:46,954 INFO L78 Accepts]: Start accepts. Automaton has 148 states. Word has length 300 [2018-10-15 13:03:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:46,955 INFO L225 Difference]: With dead ends: 304 [2018-10-15 13:03:46,955 INFO L226 Difference]: Without dead ends: 304 [2018-10-15 13:03:46,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=10878, Invalid=10878, Unknown=0, NotChecked=0, Total=21756 [2018-10-15 13:03:46,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 304 states. [2018-10-15 13:03:46,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 304 to 303. [2018-10-15 13:03:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 13:03:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-15 13:03:46,958 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 300 [2018-10-15 13:03:46,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:46,959 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-15 13:03:46,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 148 states. [2018-10-15 13:03:46,959 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-15 13:03:46,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 13:03:46,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:46,960 INFO L375 BasicCegarLoop]: trace histogram [146, 146, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:46,961 INFO L424 AbstractCegarLoop]: === Iteration 147 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:46,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:46,961 INFO L82 PathProgramCache]: Analyzing trace with hash 1825917867, now seen corresponding path program 146 times [2018-10-15 13:03:46,961 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:47,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:55,139 INFO L134 CoverageAnalysis]: Checked inductivity of 21316 backedges. 0 proven. 21316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:55,139 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:55,139 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:03:55,139 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:03:55,140 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:03:55,141 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:55,141 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 149 states. [2018-10-15 13:03:56,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:56,712 INFO L93 Difference]: Finished difference Result 306 states and 306 transitions. [2018-10-15 13:03:56,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 13:03:56,712 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 302 [2018-10-15 13:03:56,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:56,713 INFO L225 Difference]: With dead ends: 306 [2018-10-15 13:03:56,713 INFO L226 Difference]: Without dead ends: 306 [2018-10-15 13:03:56,713 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=11026, Invalid=11026, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:56,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-15 13:03:56,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 305. [2018-10-15 13:03:56,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2018-10-15 13:03:56,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 305 transitions. [2018-10-15 13:03:56,715 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 305 transitions. Word has length 302 [2018-10-15 13:03:56,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:56,715 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 305 transitions. [2018-10-15 13:03:56,715 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 13:03:56,715 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 305 transitions. [2018-10-15 13:03:56,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2018-10-15 13:03:56,716 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:56,716 INFO L375 BasicCegarLoop]: trace histogram [147, 147, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:56,716 INFO L424 AbstractCegarLoop]: === Iteration 148 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:56,717 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:56,717 INFO L82 PathProgramCache]: Analyzing trace with hash 578412429, now seen corresponding path program 147 times [2018-10-15 13:03:56,717 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:56,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat