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_nondet_true-unreach-call_true-termination.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:55:37,342 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:55:37,345 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:55:37,360 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:55:37,360 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:55:37,361 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:55:37,363 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:55:37,365 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:55:37,366 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:55:37,367 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:55:37,368 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:55:37,368 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:55:37,369 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:55:37,370 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:55:37,371 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:55:37,372 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:55:37,373 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:55:37,375 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:55:37,377 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:55:37,379 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:55:37,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:55:37,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:55:37,384 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:55:37,384 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:55:37,384 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:55:37,385 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:55:37,386 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:55:37,387 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:55:37,388 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:55:37,389 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:55:37,390 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:55:37,390 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:55:37,391 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:55:37,391 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:55:37,392 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:55:37,393 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:55:37,393 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:37,412 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:55:37,412 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:55:37,414 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:55:37,414 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:55:37,414 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:55:37,415 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:55:37,415 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:55:37,416 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:55:37,416 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:55:37,416 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:55:37,416 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:55:37,416 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:55:37,417 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:55:37,418 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:55:37,418 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:55:37,467 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:55:37,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:55:37,489 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:55:37,490 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:55:37,491 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:55:37,492 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_nondet_true-unreach-call_true-termination.i_3.bpl [2018-10-15 12:55:37,492 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/count_by_nondet_true-unreach-call_true-termination.i_3.bpl' [2018-10-15 12:55:37,554 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:55:37,556 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-10-15 12:55:37,557 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:55:37,557 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:55:37,557 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:55:37,586 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,588 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,599 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,600 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,605 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,607 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,608 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,609 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:55:37,610 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:55:37,610 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:55:37,610 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:55:37,613 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (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:37,688 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:55:37,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:55:37,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:55:37,961 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:55:37,962 INFO L202 PluginConnector]: Adding new model count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:37 BoogieIcfgContainer [2018-10-15 12:55:37,962 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:55:37,963 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2018-10-15 12:55:37,963 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2018-10-15 12:55:37,964 INFO L276 PluginConnector]: IcfgTransformer initialized [2018-10-15 12:55:37,968 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:37" (1/1) ... [2018-10-15 12:55:37,973 WARN L219 ansformationObserver]: HeapSeparator: input icfg has no '#valid' array -- returning unchanged Icfg! [2018-10-15 12:55:37,990 INFO L202 PluginConnector]: Adding new model count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:37 BasicIcfg [2018-10-15 12:55:37,990 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2018-10-15 12:55:37,991 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:55:37,992 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:55:37,998 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:55:37,999 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:55:37" (1/3) ... [2018-10-15 12:55:38,000 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24213a49 and model type count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:55:38, skipping insertion in model container [2018-10-15 12:55:38,000 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:55:37" (2/3) ... [2018-10-15 12:55:38,001 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24213a49 and model type count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:55:38, skipping insertion in model container [2018-10-15 12:55:38,001 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet_true-unreach-call_true-termination.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.10 12:55:37" (3/3) ... [2018-10-15 12:55:38,003 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet_true-unreach-call_true-termination.i_3.bplleft_unchanged_by_heapseparator [2018-10-15 12:55:38,023 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:55:38,044 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:55:38,084 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:55:38,137 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:55:38,138 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:55:38,139 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:55:38,139 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:55:38,139 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:55:38,139 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:55:38,139 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:55:38,140 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:55:38,140 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:55:38,164 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-10-15 12:55:38,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:55:38,178 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,179 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,180 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,185 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1100707927, now seen corresponding path program 1 times [2018-10-15 12:55:38,243 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,329 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:38,331 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:55:38,332 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:55:38,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:55:38,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:55:38,350 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:55:38,353 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-10-15 12:55:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,404 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-10-15 12:55:38,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:55:38,406 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:55:38,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,419 INFO L225 Difference]: With dead ends: 25 [2018-10-15 12:55:38,419 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 12:55:38,421 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:38,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 12:55:38,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 20. [2018-10-15 12:55:38,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 12:55:38,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2018-10-15 12:55:38,458 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 10 [2018-10-15 12:55:38,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,458 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2018-10-15 12:55:38,458 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:55:38,458 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2018-10-15 12:55:38,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-10-15 12:55:38,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,460 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,460 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,460 INFO L82 PathProgramCache]: Analyzing trace with hash -2010207478, now seen corresponding path program 1 times [2018-10-15 12:55:38,461 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,555 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:38,555 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,555 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:55:38,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:55:38,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:55:38,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:55:38,558 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 5 states. [2018-10-15 12:55:38,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:38,662 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-10-15 12:55:38,663 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:55:38,663 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-10-15 12:55:38,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:38,664 INFO L225 Difference]: With dead ends: 29 [2018-10-15 12:55:38,664 INFO L226 Difference]: Without dead ends: 29 [2018-10-15 12:55:38,665 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:55:38,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-10-15 12:55:38,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-10-15 12:55:38,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-10-15 12:55:38,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-10-15 12:55:38,670 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 19 [2018-10-15 12:55:38,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:38,671 INFO L481 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-10-15 12:55:38,671 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:55:38,671 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-10-15 12:55:38,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-10-15 12:55:38,672 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:38,672 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:38,673 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:38,673 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:38,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1141914423, now seen corresponding path program 2 times [2018-10-15 12:55:38,674 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:38,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:38,929 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:38,929 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:38,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:55:38,930 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:55:38,930 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:55:38,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:55:38,931 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 9 states. [2018-10-15 12:55:39,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:39,400 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-15 12:55:39,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:55:39,401 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 28 [2018-10-15 12:55:39,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:39,402 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:55:39,402 INFO L226 Difference]: Without dead ends: 45 [2018-10-15 12:55:39,403 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:39,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-15 12:55:39,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 38. [2018-10-15 12:55:39,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-15 12:55:39,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-15 12:55:39,410 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 28 [2018-10-15 12:55:39,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:39,410 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-15 12:55:39,411 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:55:39,411 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-15 12:55:39,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-15 12:55:39,412 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:39,412 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:39,414 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:39,414 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:39,415 INFO L82 PathProgramCache]: Analyzing trace with hash -1608109590, now seen corresponding path program 3 times [2018-10-15 12:55:39,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:39,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:39,599 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:39,600 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:39,600 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:55:39,600 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:55:39,601 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:55:39,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:55:39,602 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 11 states. [2018-10-15 12:55:40,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:40,189 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-10-15 12:55:40,190 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:55:40,190 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 37 [2018-10-15 12:55:40,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:40,193 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:55:40,193 INFO L226 Difference]: Without dead ends: 54 [2018-10-15 12:55:40,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:40,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2018-10-15 12:55:40,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 47. [2018-10-15 12:55:40,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-10-15 12:55:40,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-10-15 12:55:40,203 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 37 [2018-10-15 12:55:40,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:40,203 INFO L481 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-10-15 12:55:40,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:55:40,204 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-10-15 12:55:40,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-10-15 12:55:40,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:40,205 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:40,206 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:40,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:40,206 INFO L82 PathProgramCache]: Analyzing trace with hash -615384599, now seen corresponding path program 4 times [2018-10-15 12:55:40,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:40,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:40,407 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:40,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:40,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:55:40,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:55:40,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:55:40,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:55:40,409 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 13 states. [2018-10-15 12:55:41,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,067 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-15 12:55:41,069 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:55:41,069 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 46 [2018-10-15 12:55:41,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,072 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:55:41,072 INFO L226 Difference]: Without dead ends: 63 [2018-10-15 12:55:41,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:41,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-15 12:55:41,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 56. [2018-10-15 12:55:41,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-15 12:55:41,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-15 12:55:41,079 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 46 [2018-10-15 12:55:41,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,080 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-15 12:55:41,080 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:55:41,080 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-15 12:55:41,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-15 12:55:41,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,082 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,082 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,082 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,083 INFO L82 PathProgramCache]: Analyzing trace with hash 1822277834, now seen corresponding path program 5 times [2018-10-15 12:55:41,084 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:41,435 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 0 proven. 95 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:41,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:41,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:55:41,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:55:41,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:55:41,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:55:41,437 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 15 states. [2018-10-15 12:55:41,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:41,696 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-10-15 12:55:41,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:55:41,697 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 55 [2018-10-15 12:55:41,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:41,699 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:55:41,699 INFO L226 Difference]: Without dead ends: 72 [2018-10-15 12:55:41,700 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:41,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-10-15 12:55:41,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2018-10-15 12:55:41,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-10-15 12:55:41,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-10-15 12:55:41,707 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 55 [2018-10-15 12:55:41,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:41,708 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-10-15 12:55:41,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:55:41,708 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-10-15 12:55:41,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-10-15 12:55:41,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:41,710 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:41,710 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:41,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:41,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1581439223, now seen corresponding path program 6 times [2018-10-15 12:55:41,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,214 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:42,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:55:42,216 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:55:42,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:55:42,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:55:42,217 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 17 states. [2018-10-15 12:55:42,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:42,550 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-15 12:55:42,550 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:55:42,551 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 64 [2018-10-15 12:55:42,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:42,552 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:55:42,552 INFO L226 Difference]: Without dead ends: 81 [2018-10-15 12:55:42,553 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:42,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-15 12:55:42,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 74. [2018-10-15 12:55:42,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-15 12:55:42,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-15 12:55:42,559 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 64 [2018-10-15 12:55:42,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:42,560 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-15 12:55:42,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:55:42,560 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-15 12:55:42,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-15 12:55:42,562 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:42,562 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:42,562 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:42,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:42,563 INFO L82 PathProgramCache]: Analyzing trace with hash 547575722, now seen corresponding path program 7 times [2018-10-15 12:55:42,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:42,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:42,818 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:42,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:42,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:55:42,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:55:42,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:55:42,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:55:42,820 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 19 states. [2018-10-15 12:55:43,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:43,391 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 12:55:43,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:55:43,392 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 73 [2018-10-15 12:55:43,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:43,394 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:55:43,394 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 12:55:43,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:43,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 12:55:43,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 12:55:43,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 12:55:43,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 12:55:43,401 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 73 [2018-10-15 12:55:43,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:43,402 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 12:55:43,402 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:55:43,402 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 12:55:43,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 12:55:43,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:43,404 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:43,404 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:43,404 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:43,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1810058281, now seen corresponding path program 8 times [2018-10-15 12:55:43,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:43,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:43,861 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:43,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:43,862 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:55:43,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:55:43,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:55:43,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:55:43,863 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 21 states. [2018-10-15 12:55:44,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:44,397 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-15 12:55:44,397 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:55:44,398 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 82 [2018-10-15 12:55:44,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:44,400 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:55:44,400 INFO L226 Difference]: Without dead ends: 99 [2018-10-15 12:55:44,401 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:44,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-15 12:55:44,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 92. [2018-10-15 12:55:44,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-15 12:55:44,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-15 12:55:44,408 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 82 [2018-10-15 12:55:44,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:44,409 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-15 12:55:44,409 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:55:44,409 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-15 12:55:44,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-15 12:55:44,410 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:44,411 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:44,411 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:44,411 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:44,411 INFO L82 PathProgramCache]: Analyzing trace with hash -2017134966, now seen corresponding path program 9 times [2018-10-15 12:55:44,412 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:44,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 333 backedges. 0 proven. 333 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:44,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:44,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:55:44,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:55:44,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:55:44,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:55:44,744 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 23 states. [2018-10-15 12:55:45,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,153 INFO L93 Difference]: Finished difference Result 112 states and 112 transitions. [2018-10-15 12:55:45,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:55:45,154 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 91 [2018-10-15 12:55:45,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,155 INFO L225 Difference]: With dead ends: 112 [2018-10-15 12:55:45,156 INFO L226 Difference]: Without dead ends: 108 [2018-10-15 12:55:45,157 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:45,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2018-10-15 12:55:45,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 101. [2018-10-15 12:55:45,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-10-15 12:55:45,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-10-15 12:55:45,164 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 91 [2018-10-15 12:55:45,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,164 INFO L481 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-10-15 12:55:45,164 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:55:45,165 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-10-15 12:55:45,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-10-15 12:55:45,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,166 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,167 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1913231031, now seen corresponding path program 10 times [2018-10-15 12:55:45,168 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:45,505 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 0 proven. 415 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:45,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:45,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:55:45,506 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:55:45,506 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:55:45,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:55:45,507 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 25 states. [2018-10-15 12:55:45,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:45,932 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-15 12:55:45,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:55:45,932 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 100 [2018-10-15 12:55:45,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:45,933 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:55:45,933 INFO L226 Difference]: Without dead ends: 117 [2018-10-15 12:55:45,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:55:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-15 12:55:45,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 110. [2018-10-15 12:55:45,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-15 12:55:45,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-15 12:55:45,941 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 100 [2018-10-15 12:55:45,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:45,941 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-15 12:55:45,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:55:45,941 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-15 12:55:45,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-15 12:55:45,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:45,943 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:45,944 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:45,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:45,944 INFO L82 PathProgramCache]: Analyzing trace with hash -435118742, now seen corresponding path program 11 times [2018-10-15 12:55:45,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:46,296 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:46,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:46,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:55:46,297 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:55:46,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:55:46,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:55:46,298 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 27 states. [2018-10-15 12:55:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:46,954 INFO L93 Difference]: Finished difference Result 130 states and 130 transitions. [2018-10-15 12:55:46,954 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:55:46,954 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 109 [2018-10-15 12:55:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:46,956 INFO L225 Difference]: With dead ends: 130 [2018-10-15 12:55:46,956 INFO L226 Difference]: Without dead ends: 126 [2018-10-15 12:55:46,958 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:55:46,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2018-10-15 12:55:46,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 119. [2018-10-15 12:55:46,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-10-15 12:55:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-10-15 12:55:46,963 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 109 [2018-10-15 12:55:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:46,964 INFO L481 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-10-15 12:55:46,964 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:55:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-10-15 12:55:46,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-10-15 12:55:46,966 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:46,966 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:46,966 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:46,967 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:46,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1940422249, now seen corresponding path program 12 times [2018-10-15 12:55:46,967 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:46,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:47,544 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 0 proven. 606 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:47,545 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:47,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:55:47,545 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:55:47,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:55:47,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:55:47,546 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 29 states. [2018-10-15 12:55:48,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:48,563 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-15 12:55:48,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:55:48,564 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 118 [2018-10-15 12:55:48,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:48,565 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:55:48,566 INFO L226 Difference]: Without dead ends: 135 [2018-10-15 12:55:48,567 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:55:48,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-15 12:55:48,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 128. [2018-10-15 12:55:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-15 12:55:48,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-15 12:55:48,573 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 118 [2018-10-15 12:55:48,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:48,573 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-15 12:55:48,573 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:55:48,574 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-15 12:55:48,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-15 12:55:48,575 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:48,576 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:48,576 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:48,576 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:48,576 INFO L82 PathProgramCache]: Analyzing trace with hash -669758390, now seen corresponding path program 13 times [2018-10-15 12:55:48,577 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:49,453 INFO L134 CoverageAnalysis]: Checked inductivity of 715 backedges. 0 proven. 715 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:49,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:49,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:55:49,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:55:49,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:55:49,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:55:49,455 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 31 states. [2018-10-15 12:55:50,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:50,026 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2018-10-15 12:55:50,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:55:50,027 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 127 [2018-10-15 12:55:50,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:50,029 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:55:50,029 INFO L226 Difference]: Without dead ends: 144 [2018-10-15 12:55:50,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:55:50,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2018-10-15 12:55:50,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 137. [2018-10-15 12:55:50,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-10-15 12:55:50,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-10-15 12:55:50,035 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 127 [2018-10-15 12:55:50,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:50,035 INFO L481 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-10-15 12:55:50,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:55:50,036 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-10-15 12:55:50,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-10-15 12:55:50,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:50,038 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:50,038 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:50,038 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:50,038 INFO L82 PathProgramCache]: Analyzing trace with hash -1070888055, now seen corresponding path program 14 times [2018-10-15 12:55:50,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:50,429 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 0 proven. 833 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:50,429 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:50,430 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:55:50,430 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:55:50,430 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:55:50,431 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:55:50,431 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 33 states. [2018-10-15 12:55:51,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:51,072 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-15 12:55:51,072 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:55:51,072 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 136 [2018-10-15 12:55:51,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:51,074 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:55:51,074 INFO L226 Difference]: Without dead ends: 153 [2018-10-15 12:55:51,077 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:55:51,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-15 12:55:51,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 146. [2018-10-15 12:55:51,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-15 12:55:51,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-15 12:55:51,080 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 136 [2018-10-15 12:55:51,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:51,081 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-15 12:55:51,081 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:55:51,081 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-15 12:55:51,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-15 12:55:51,082 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:51,082 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:51,082 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:51,083 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:51,083 INFO L82 PathProgramCache]: Analyzing trace with hash 853410602, now seen corresponding path program 15 times [2018-10-15 12:55:51,083 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:51,760 INFO L134 CoverageAnalysis]: Checked inductivity of 960 backedges. 0 proven. 960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:51,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:51,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:55:51,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:55:51,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:55:51,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:55:51,762 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 35 states. [2018-10-15 12:55:53,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:53,050 INFO L93 Difference]: Finished difference Result 166 states and 166 transitions. [2018-10-15 12:55:53,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:55:53,051 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 145 [2018-10-15 12:55:53,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:53,053 INFO L225 Difference]: With dead ends: 166 [2018-10-15 12:55:53,053 INFO L226 Difference]: Without dead ends: 162 [2018-10-15 12:55:53,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:55:53,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2018-10-15 12:55:53,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 155. [2018-10-15 12:55:53,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-10-15 12:55:53,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-10-15 12:55:53,059 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 145 [2018-10-15 12:55:53,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:53,060 INFO L481 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-10-15 12:55:53,060 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:55:53,060 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-10-15 12:55:53,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-10-15 12:55:53,061 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:53,062 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:53,062 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:53,062 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:53,062 INFO L82 PathProgramCache]: Analyzing trace with hash 1848742057, now seen corresponding path program 16 times [2018-10-15 12:55:53,063 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:53,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:54,262 INFO L134 CoverageAnalysis]: Checked inductivity of 1096 backedges. 0 proven. 1096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:54,262 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:54,262 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:55:54,263 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:55:54,263 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:55:54,263 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:55:54,263 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 37 states. [2018-10-15 12:55:55,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:55,037 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-15 12:55:55,039 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:55:55,039 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 154 [2018-10-15 12:55:55,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:55,040 INFO L225 Difference]: With dead ends: 175 [2018-10-15 12:55:55,040 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:55:55,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:55:55,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:55:55,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 164. [2018-10-15 12:55:55,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-15 12:55:55,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-15 12:55:55,045 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 154 [2018-10-15 12:55:55,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:55,045 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-15 12:55:55,045 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:55:55,046 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-15 12:55:55,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-15 12:55:55,046 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:55,047 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:55,047 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:55,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:55,047 INFO L82 PathProgramCache]: Analyzing trace with hash -470040054, now seen corresponding path program 17 times [2018-10-15 12:55:55,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:56,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1241 backedges. 0 proven. 1241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:56,096 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:56,096 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:55:56,097 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:55:56,097 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:55:56,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:55:56,098 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 39 states. [2018-10-15 12:55:57,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:57,037 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 12:55:57,037 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 12:55:57,038 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 163 [2018-10-15 12:55:57,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:57,039 INFO L225 Difference]: With dead ends: 184 [2018-10-15 12:55:57,039 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 12:55:57,042 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:55:57,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 12:55:57,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 12:55:57,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 12:55:57,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 12:55:57,045 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 163 [2018-10-15 12:55:57,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:57,046 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 12:55:57,046 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:55:57,046 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 12:55:57,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 12:55:57,047 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:57,047 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:57,047 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:57,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:57,048 INFO L82 PathProgramCache]: Analyzing trace with hash -269709879, now seen corresponding path program 18 times [2018-10-15 12:55:57,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:58,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1395 backedges. 0 proven. 1395 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:58,017 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:58,017 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:55:58,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:55:58,018 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:55:58,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:55:58,019 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 41 states. [2018-10-15 12:55:59,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:55:59,188 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-15 12:55:59,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 12:55:59,189 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 172 [2018-10-15 12:55:59,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:55:59,191 INFO L225 Difference]: With dead ends: 193 [2018-10-15 12:55:59,191 INFO L226 Difference]: Without dead ends: 189 [2018-10-15 12:55:59,194 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:55:59,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-15 12:55:59,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 182. [2018-10-15 12:55:59,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-15 12:55:59,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-15 12:55:59,197 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 172 [2018-10-15 12:55:59,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:55:59,198 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-15 12:55:59,198 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:55:59,198 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-15 12:55:59,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-15 12:55:59,199 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:55:59,200 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:55:59,200 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:55:59,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:55:59,200 INFO L82 PathProgramCache]: Analyzing trace with hash -780433174, now seen corresponding path program 19 times [2018-10-15 12:55:59,201 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:55:59,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:55:59,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1558 backedges. 0 proven. 1558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:55:59,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:55:59,923 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:55:59,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:55:59,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:55:59,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:55:59,924 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 43 states. [2018-10-15 12:56:00,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:00,994 INFO L93 Difference]: Finished difference Result 202 states and 202 transitions. [2018-10-15 12:56:00,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 12:56:00,994 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 181 [2018-10-15 12:56:00,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:00,996 INFO L225 Difference]: With dead ends: 202 [2018-10-15 12:56:00,996 INFO L226 Difference]: Without dead ends: 198 [2018-10-15 12:56:01,000 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:56:01,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2018-10-15 12:56:01,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 191. [2018-10-15 12:56:01,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-10-15 12:56:01,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-10-15 12:56:01,005 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 181 [2018-10-15 12:56:01,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:01,005 INFO L481 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-10-15 12:56:01,005 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:56:01,005 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-10-15 12:56:01,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-10-15 12:56:01,006 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:01,006 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:01,006 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:01,007 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:01,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1326351081, now seen corresponding path program 20 times [2018-10-15 12:56:01,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 1730 backedges. 0 proven. 1730 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:02,355 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:02,355 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:56:02,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:56:02,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:56:02,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:56:02,357 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 45 states. [2018-10-15 12:56:03,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:03,717 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-10-15 12:56:03,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 12:56:03,717 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 190 [2018-10-15 12:56:03,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:03,719 INFO L225 Difference]: With dead ends: 211 [2018-10-15 12:56:03,719 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:56:03,720 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:56:03,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:56:03,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 200. [2018-10-15 12:56:03,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-10-15 12:56:03,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 200 transitions. [2018-10-15 12:56:03,724 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 200 transitions. Word has length 190 [2018-10-15 12:56:03,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:03,724 INFO L481 AbstractCegarLoop]: Abstraction has 200 states and 200 transitions. [2018-10-15 12:56:03,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:56:03,725 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 200 transitions. [2018-10-15 12:56:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2018-10-15 12:56:03,726 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:03,726 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:03,726 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:03,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:03,727 INFO L82 PathProgramCache]: Analyzing trace with hash -1175758902, now seen corresponding path program 21 times [2018-10-15 12:56:03,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:03,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:04,589 INFO L134 CoverageAnalysis]: Checked inductivity of 1911 backedges. 0 proven. 1911 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:04,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:04,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:56:04,590 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:56:04,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:56:04,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:56:04,591 INFO L87 Difference]: Start difference. First operand 200 states and 200 transitions. Second operand 47 states. [2018-10-15 12:56:05,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:05,848 INFO L93 Difference]: Finished difference Result 220 states and 220 transitions. [2018-10-15 12:56:05,850 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 12:56:05,850 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 199 [2018-10-15 12:56:05,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:05,852 INFO L225 Difference]: With dead ends: 220 [2018-10-15 12:56:05,852 INFO L226 Difference]: Without dead ends: 216 [2018-10-15 12:56:05,853 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:56:05,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2018-10-15 12:56:05,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 209. [2018-10-15 12:56:05,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-10-15 12:56:05,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-10-15 12:56:05,857 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 199 [2018-10-15 12:56:05,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:05,857 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-10-15 12:56:05,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:56:05,857 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-10-15 12:56:05,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-10-15 12:56:05,858 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:05,859 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:05,859 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:05,859 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:05,859 INFO L82 PathProgramCache]: Analyzing trace with hash 1288269833, now seen corresponding path program 22 times [2018-10-15 12:56:05,860 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:05,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:06,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2101 backedges. 0 proven. 2101 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:06,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:06,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:56:06,740 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:56:06,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:56:06,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:56:06,740 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 49 states. [2018-10-15 12:56:08,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:08,371 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-10-15 12:56:08,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 12:56:08,372 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 208 [2018-10-15 12:56:08,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:08,374 INFO L225 Difference]: With dead ends: 229 [2018-10-15 12:56:08,374 INFO L226 Difference]: Without dead ends: 225 [2018-10-15 12:56:08,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:56:08,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-10-15 12:56:08,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 218. [2018-10-15 12:56:08,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218 states. [2018-10-15 12:56:08,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218 states to 218 states and 218 transitions. [2018-10-15 12:56:08,380 INFO L78 Accepts]: Start accepts. Automaton has 218 states and 218 transitions. Word has length 208 [2018-10-15 12:56:08,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:08,380 INFO L481 AbstractCegarLoop]: Abstraction has 218 states and 218 transitions. [2018-10-15 12:56:08,380 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:56:08,381 INFO L276 IsEmpty]: Start isEmpty. Operand 218 states and 218 transitions. [2018-10-15 12:56:08,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2018-10-15 12:56:08,382 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:08,382 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:08,382 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:08,382 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:08,382 INFO L82 PathProgramCache]: Analyzing trace with hash 341388970, now seen corresponding path program 23 times [2018-10-15 12:56:08,383 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2300 backedges. 0 proven. 2300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:09,552 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:09,552 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:56:09,552 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:56:09,553 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:56:09,553 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:56:09,553 INFO L87 Difference]: Start difference. First operand 218 states and 218 transitions. Second operand 51 states. [2018-10-15 12:56:10,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:10,990 INFO L93 Difference]: Finished difference Result 238 states and 238 transitions. [2018-10-15 12:56:10,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 12:56:10,990 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 217 [2018-10-15 12:56:10,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:10,992 INFO L225 Difference]: With dead ends: 238 [2018-10-15 12:56:10,992 INFO L226 Difference]: Without dead ends: 234 [2018-10-15 12:56:10,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:56:10,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 234 states. [2018-10-15 12:56:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 234 to 227. [2018-10-15 12:56:10,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-10-15 12:56:10,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-10-15 12:56:10,999 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 217 [2018-10-15 12:56:10,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:11,000 INFO L481 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-10-15 12:56:11,000 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:56:11,000 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-10-15 12:56:11,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-10-15 12:56:11,001 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:11,001 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:11,001 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:11,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:11,002 INFO L82 PathProgramCache]: Analyzing trace with hash -2117118679, now seen corresponding path program 24 times [2018-10-15 12:56:11,002 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:11,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:12,377 INFO L134 CoverageAnalysis]: Checked inductivity of 2508 backedges. 0 proven. 2508 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:12,377 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:12,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:56:12,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:56:12,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:56:12,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:56:12,379 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 53 states. [2018-10-15 12:56:14,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:14,161 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-10-15 12:56:14,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 12:56:14,161 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 226 [2018-10-15 12:56:14,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:14,164 INFO L225 Difference]: With dead ends: 247 [2018-10-15 12:56:14,164 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 12:56:14,165 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:56:14,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 12:56:14,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 236. [2018-10-15 12:56:14,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 236 states. [2018-10-15 12:56:14,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 236 transitions. [2018-10-15 12:56:14,170 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 236 transitions. Word has length 226 [2018-10-15 12:56:14,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:14,171 INFO L481 AbstractCegarLoop]: Abstraction has 236 states and 236 transitions. [2018-10-15 12:56:14,171 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:56:14,171 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 236 transitions. [2018-10-15 12:56:14,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2018-10-15 12:56:14,172 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:14,172 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:14,173 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:14,173 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:14,173 INFO L82 PathProgramCache]: Analyzing trace with hash -262992502, now seen corresponding path program 25 times [2018-10-15 12:56:14,174 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:14,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:15,193 INFO L134 CoverageAnalysis]: Checked inductivity of 2725 backedges. 0 proven. 2725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:15,194 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:15,194 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:56:15,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:56:15,195 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:56:15,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:56:15,195 INFO L87 Difference]: Start difference. First operand 236 states and 236 transitions. Second operand 55 states. [2018-10-15 12:56:17,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:17,070 INFO L93 Difference]: Finished difference Result 256 states and 256 transitions. [2018-10-15 12:56:17,071 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 12:56:17,071 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 235 [2018-10-15 12:56:17,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:17,072 INFO L225 Difference]: With dead ends: 256 [2018-10-15 12:56:17,072 INFO L226 Difference]: Without dead ends: 252 [2018-10-15 12:56:17,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:56:17,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2018-10-15 12:56:17,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 245. [2018-10-15 12:56:17,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-10-15 12:56:17,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-10-15 12:56:17,078 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 235 [2018-10-15 12:56:17,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:17,078 INFO L481 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-10-15 12:56:17,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:56:17,078 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-10-15 12:56:17,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-10-15 12:56:17,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:17,080 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:17,080 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:17,080 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:17,081 INFO L82 PathProgramCache]: Analyzing trace with hash 2119316041, now seen corresponding path program 26 times [2018-10-15 12:56:17,081 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:18,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2951 backedges. 0 proven. 2951 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:18,881 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:18,881 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 12:56:18,881 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 12:56:18,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 12:56:18,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:56:18,882 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 57 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 265 states and 265 transitions. [2018-10-15 12:56:20,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 12:56:20,739 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 244 [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: 265 [2018-10-15 12:56:20,740 INFO L226 Difference]: Without dead ends: 261 [2018-10-15 12:56:20,741 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:56:20,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-10-15 12:56:20,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 254. [2018-10-15 12:56:20,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 254 states. [2018-10-15 12:56:20,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 254 transitions. [2018-10-15 12:56:20,747 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 254 transitions. Word has length 244 [2018-10-15 12:56:20,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:20,747 INFO L481 AbstractCegarLoop]: Abstraction has 254 states and 254 transitions. [2018-10-15 12:56:20,747 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 12:56:20,747 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 254 transitions. [2018-10-15 12:56:20,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2018-10-15 12:56:20,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:20,749 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:20,749 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:20,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:20,750 INFO L82 PathProgramCache]: Analyzing trace with hash -706284438, now seen corresponding path program 27 times [2018-10-15 12:56:20,750 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:20,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:22,151 INFO L134 CoverageAnalysis]: Checked inductivity of 3186 backedges. 0 proven. 3186 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:22,151 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:22,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 12:56:22,151 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 12:56:22,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 12:56:22,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 12:56:22,152 INFO L87 Difference]: Start difference. First operand 254 states and 254 transitions. Second operand 59 states. [2018-10-15 12:56:24,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:24,380 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 12:56:24,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 12:56:24,380 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 253 [2018-10-15 12:56:24,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:24,381 INFO L225 Difference]: With dead ends: 274 [2018-10-15 12:56:24,382 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 12:56:24,383 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:56:24,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 12:56:24,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 12:56:24,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 12:56:24,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 12:56:24,388 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 253 [2018-10-15 12:56:24,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:24,388 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 12:56:24,388 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 12:56:24,388 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 12:56:24,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 12:56:24,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:24,390 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:24,390 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:24,390 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:24,390 INFO L82 PathProgramCache]: Analyzing trace with hash -368834711, now seen corresponding path program 28 times [2018-10-15 12:56:24,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:26,270 INFO L134 CoverageAnalysis]: Checked inductivity of 3430 backedges. 0 proven. 3430 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:26,270 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:26,271 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 12:56:26,271 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 12:56:26,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 12:56:26,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 12:56:26,272 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 61 states. [2018-10-15 12:56:28,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:28,413 INFO L93 Difference]: Finished difference Result 283 states and 283 transitions. [2018-10-15 12:56:28,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 12:56:28,413 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 262 [2018-10-15 12:56:28,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:28,415 INFO L225 Difference]: With dead ends: 283 [2018-10-15 12:56:28,415 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:56:28,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:56:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:56:28,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 272. [2018-10-15 12:56:28,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 272 states. [2018-10-15 12:56:28,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 272 states and 272 transitions. [2018-10-15 12:56:28,420 INFO L78 Accepts]: Start accepts. Automaton has 272 states and 272 transitions. Word has length 262 [2018-10-15 12:56:28,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:28,421 INFO L481 AbstractCegarLoop]: Abstraction has 272 states and 272 transitions. [2018-10-15 12:56:28,421 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 12:56:28,421 INFO L276 IsEmpty]: Start isEmpty. Operand 272 states and 272 transitions. [2018-10-15 12:56:28,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2018-10-15 12:56:28,422 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:28,422 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:28,423 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:28,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:28,423 INFO L82 PathProgramCache]: Analyzing trace with hash -1516051638, now seen corresponding path program 29 times [2018-10-15 12:56:28,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:28,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:30,278 INFO L134 CoverageAnalysis]: Checked inductivity of 3683 backedges. 0 proven. 3683 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:30,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:30,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 12:56:30,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 12:56:30,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 12:56:30,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 12:56:30,280 INFO L87 Difference]: Start difference. First operand 272 states and 272 transitions. Second operand 63 states. [2018-10-15 12:56:32,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:32,295 INFO L93 Difference]: Finished difference Result 292 states and 292 transitions. [2018-10-15 12:56:32,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 12:56:32,296 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 271 [2018-10-15 12:56:32,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:32,298 INFO L225 Difference]: With dead ends: 292 [2018-10-15 12:56:32,298 INFO L226 Difference]: Without dead ends: 288 [2018-10-15 12:56:32,299 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 12:56:32,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2018-10-15 12:56:32,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 281. [2018-10-15 12:56:32,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 281 states. [2018-10-15 12:56:32,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 281 transitions. [2018-10-15 12:56:32,303 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 281 transitions. Word has length 271 [2018-10-15 12:56:32,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:32,303 INFO L481 AbstractCegarLoop]: Abstraction has 281 states and 281 transitions. [2018-10-15 12:56:32,304 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 12:56:32,304 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 281 transitions. [2018-10-15 12:56:32,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 281 [2018-10-15 12:56:32,305 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:32,305 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:32,306 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:32,306 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:32,306 INFO L82 PathProgramCache]: Analyzing trace with hash -1542007671, now seen corresponding path program 30 times [2018-10-15 12:56:32,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:33,845 INFO L134 CoverageAnalysis]: Checked inductivity of 3945 backedges. 0 proven. 3945 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:33,845 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:33,845 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 12:56:33,846 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 12:56:33,846 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 12:56:33,846 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 12:56:33,846 INFO L87 Difference]: Start difference. First operand 281 states and 281 transitions. Second operand 65 states. [2018-10-15 12:56:37,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:37,364 INFO L93 Difference]: Finished difference Result 301 states and 301 transitions. [2018-10-15 12:56:37,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 12:56:37,365 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 280 [2018-10-15 12:56:37,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:37,367 INFO L225 Difference]: With dead ends: 301 [2018-10-15 12:56:37,367 INFO L226 Difference]: Without dead ends: 297 [2018-10-15 12:56:37,368 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 12:56:37,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2018-10-15 12:56:37,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 290. [2018-10-15 12:56:37,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 290 states. [2018-10-15 12:56:37,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 290 transitions. [2018-10-15 12:56:37,372 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 290 transitions. Word has length 280 [2018-10-15 12:56:37,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:37,372 INFO L481 AbstractCegarLoop]: Abstraction has 290 states and 290 transitions. [2018-10-15 12:56:37,373 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 12:56:37,373 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 290 transitions. [2018-10-15 12:56:37,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2018-10-15 12:56:37,374 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:37,374 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:37,375 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:37,375 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:37,375 INFO L82 PathProgramCache]: Analyzing trace with hash 2023021098, now seen corresponding path program 31 times [2018-10-15 12:56:37,376 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:37,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4216 backedges. 0 proven. 4216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:39,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:39,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 12:56:39,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 12:56:39,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 12:56:39,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 12:56:39,121 INFO L87 Difference]: Start difference. First operand 290 states and 290 transitions. Second operand 67 states. [2018-10-15 12:56:41,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:41,406 INFO L93 Difference]: Finished difference Result 310 states and 310 transitions. [2018-10-15 12:56:41,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 12:56:41,406 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 289 [2018-10-15 12:56:41,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:41,408 INFO L225 Difference]: With dead ends: 310 [2018-10-15 12:56:41,408 INFO L226 Difference]: Without dead ends: 306 [2018-10-15 12:56:41,410 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 12:56:41,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 306 states. [2018-10-15 12:56:41,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 306 to 299. [2018-10-15 12:56:41,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 299 states. [2018-10-15 12:56:41,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 299 states to 299 states and 299 transitions. [2018-10-15 12:56:41,413 INFO L78 Accepts]: Start accepts. Automaton has 299 states and 299 transitions. Word has length 289 [2018-10-15 12:56:41,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:41,414 INFO L481 AbstractCegarLoop]: Abstraction has 299 states and 299 transitions. [2018-10-15 12:56:41,414 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 12:56:41,414 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 299 transitions. [2018-10-15 12:56:41,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2018-10-15 12:56:41,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:41,415 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:41,415 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:41,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:41,416 INFO L82 PathProgramCache]: Analyzing trace with hash -482567767, now seen corresponding path program 32 times [2018-10-15 12:56:41,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:41,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:42,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4496 backedges. 0 proven. 4496 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:42,870 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:42,870 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 12:56:42,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 12:56:42,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 12:56:42,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 12:56:42,872 INFO L87 Difference]: Start difference. First operand 299 states and 299 transitions. Second operand 69 states. [2018-10-15 12:56:45,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:45,529 INFO L93 Difference]: Finished difference Result 319 states and 319 transitions. [2018-10-15 12:56:45,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 12:56:45,530 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 298 [2018-10-15 12:56:45,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:45,531 INFO L225 Difference]: With dead ends: 319 [2018-10-15 12:56:45,531 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 12:56:45,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 12:56:45,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 12:56:45,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 308. [2018-10-15 12:56:45,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2018-10-15 12:56:45,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 308 transitions. [2018-10-15 12:56:45,537 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 308 transitions. Word has length 298 [2018-10-15 12:56:45,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:45,538 INFO L481 AbstractCegarLoop]: Abstraction has 308 states and 308 transitions. [2018-10-15 12:56:45,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 12:56:45,538 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 308 transitions. [2018-10-15 12:56:45,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2018-10-15 12:56:45,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:45,540 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:45,540 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:45,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:45,541 INFO L82 PathProgramCache]: Analyzing trace with hash -2142578422, now seen corresponding path program 33 times [2018-10-15 12:56:45,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:45,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:47,494 INFO L134 CoverageAnalysis]: Checked inductivity of 4785 backedges. 0 proven. 4785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:47,494 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:47,494 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 12:56:47,495 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 12:56:47,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 12:56:47,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 12:56:47,496 INFO L87 Difference]: Start difference. First operand 308 states and 308 transitions. Second operand 71 states. [2018-10-15 12:56:50,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:50,294 INFO L93 Difference]: Finished difference Result 328 states and 328 transitions. [2018-10-15 12:56:50,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 12:56:50,295 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 307 [2018-10-15 12:56:50,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:50,297 INFO L225 Difference]: With dead ends: 328 [2018-10-15 12:56:50,297 INFO L226 Difference]: Without dead ends: 324 [2018-10-15 12:56:50,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 12:56:50,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 324 states. [2018-10-15 12:56:50,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 324 to 317. [2018-10-15 12:56:50,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 317 states. [2018-10-15 12:56:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 317 states to 317 states and 317 transitions. [2018-10-15 12:56:50,302 INFO L78 Accepts]: Start accepts. Automaton has 317 states and 317 transitions. Word has length 307 [2018-10-15 12:56:50,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:50,302 INFO L481 AbstractCegarLoop]: Abstraction has 317 states and 317 transitions. [2018-10-15 12:56:50,303 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 12:56:50,303 INFO L276 IsEmpty]: Start isEmpty. Operand 317 states and 317 transitions. [2018-10-15 12:56:50,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2018-10-15 12:56:50,304 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:50,304 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:50,305 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:50,305 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:50,305 INFO L82 PathProgramCache]: Analyzing trace with hash 1437030089, now seen corresponding path program 34 times [2018-10-15 12:56:50,306 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:51,915 INFO L134 CoverageAnalysis]: Checked inductivity of 5083 backedges. 0 proven. 5083 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:51,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:51,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 12:56:51,916 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 12:56:51,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 12:56:51,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 12:56:51,917 INFO L87 Difference]: Start difference. First operand 317 states and 317 transitions. Second operand 73 states. [2018-10-15 12:56:54,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:54,889 INFO L93 Difference]: Finished difference Result 337 states and 337 transitions. [2018-10-15 12:56:54,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 12:56:54,890 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 316 [2018-10-15 12:56:54,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:54,892 INFO L225 Difference]: With dead ends: 337 [2018-10-15 12:56:54,892 INFO L226 Difference]: Without dead ends: 333 [2018-10-15 12:56:54,894 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 12:56:54,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2018-10-15 12:56:54,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 326. [2018-10-15 12:56:54,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 326 states. [2018-10-15 12:56:54,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 326 transitions. [2018-10-15 12:56:54,897 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 326 transitions. Word has length 316 [2018-10-15 12:56:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:54,898 INFO L481 AbstractCegarLoop]: Abstraction has 326 states and 326 transitions. [2018-10-15 12:56:54,898 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 12:56:54,898 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 326 transitions. [2018-10-15 12:56:54,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2018-10-15 12:56:54,900 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:54,900 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:54,900 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:54,900 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:54,900 INFO L82 PathProgramCache]: Analyzing trace with hash -422387734, now seen corresponding path program 35 times [2018-10-15 12:56:54,901 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:54,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:56:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 5390 backedges. 0 proven. 5390 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:56:56,635 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:56:56,636 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 12:56:56,636 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 12:56:56,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 12:56:56,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 12:56:56,637 INFO L87 Difference]: Start difference. First operand 326 states and 326 transitions. Second operand 75 states. [2018-10-15 12:56:59,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:56:59,682 INFO L93 Difference]: Finished difference Result 346 states and 346 transitions. [2018-10-15 12:56:59,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 12:56:59,682 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 325 [2018-10-15 12:56:59,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:56:59,684 INFO L225 Difference]: With dead ends: 346 [2018-10-15 12:56:59,685 INFO L226 Difference]: Without dead ends: 342 [2018-10-15 12:56:59,687 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 12:56:59,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2018-10-15 12:56:59,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 335. [2018-10-15 12:56:59,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 335 states. [2018-10-15 12:56:59,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 335 transitions. [2018-10-15 12:56:59,690 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 335 transitions. Word has length 325 [2018-10-15 12:56:59,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:56:59,691 INFO L481 AbstractCegarLoop]: Abstraction has 335 states and 335 transitions. [2018-10-15 12:56:59,691 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 12:56:59,691 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 335 transitions. [2018-10-15 12:56:59,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 335 [2018-10-15 12:56:59,693 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:56:59,693 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:56:59,693 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:56:59,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:56:59,694 INFO L82 PathProgramCache]: Analyzing trace with hash 1091111913, now seen corresponding path program 36 times [2018-10-15 12:56:59,694 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:56:59,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:01,659 INFO L134 CoverageAnalysis]: Checked inductivity of 5706 backedges. 0 proven. 5706 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:01,659 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:01,660 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 12:57:01,660 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 12:57:01,660 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 12:57:01,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 12:57:01,661 INFO L87 Difference]: Start difference. First operand 335 states and 335 transitions. Second operand 77 states. [2018-10-15 12:57:04,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:04,858 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-15 12:57:04,858 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 12:57:04,858 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 334 [2018-10-15 12:57:04,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:04,860 INFO L225 Difference]: With dead ends: 355 [2018-10-15 12:57:04,861 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 12:57:04,862 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 12:57:04,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 12:57:04,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 344. [2018-10-15 12:57:04,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 344 states. [2018-10-15 12:57:04,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 344 transitions. [2018-10-15 12:57:04,867 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 344 transitions. Word has length 334 [2018-10-15 12:57:04,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:04,867 INFO L481 AbstractCegarLoop]: Abstraction has 344 states and 344 transitions. [2018-10-15 12:57:04,867 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 12:57:04,868 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 344 transitions. [2018-10-15 12:57:04,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2018-10-15 12:57:04,869 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:04,869 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:04,870 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:04,870 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:04,870 INFO L82 PathProgramCache]: Analyzing trace with hash -1363480886, now seen corresponding path program 37 times [2018-10-15 12:57:04,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:04,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 6031 backedges. 0 proven. 6031 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:06,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:06,854 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 12:57:06,854 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 12:57:06,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 12:57:06,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 12:57:06,855 INFO L87 Difference]: Start difference. First operand 344 states and 344 transitions. Second operand 79 states. [2018-10-15 12:57:10,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:10,256 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-15 12:57:10,256 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 12:57:10,257 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 343 [2018-10-15 12:57:10,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:10,259 INFO L225 Difference]: With dead ends: 364 [2018-10-15 12:57:10,259 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 12:57:10,260 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 12:57:10,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 12:57:10,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 353. [2018-10-15 12:57:10,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 12:57:10,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 12:57:10,263 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 343 [2018-10-15 12:57:10,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:10,264 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 12:57:10,264 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 12:57:10,264 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 12:57:10,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 12:57:10,265 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:10,265 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:10,266 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:10,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:10,266 INFO L82 PathProgramCache]: Analyzing trace with hash -1567377143, now seen corresponding path program 38 times [2018-10-15 12:57:10,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:10,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 6365 backedges. 0 proven. 6365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:12,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:12,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 12:57:12,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 12:57:12,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 12:57:12,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 12:57:12,190 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 81 states. [2018-10-15 12:57:15,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:15,561 INFO L93 Difference]: Finished difference Result 373 states and 373 transitions. [2018-10-15 12:57:15,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 12:57:15,561 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 352 [2018-10-15 12:57:15,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:15,563 INFO L225 Difference]: With dead ends: 373 [2018-10-15 12:57:15,563 INFO L226 Difference]: Without dead ends: 369 [2018-10-15 12:57:15,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 12:57:15,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2018-10-15 12:57:15,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 362. [2018-10-15 12:57:15,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 362 states. [2018-10-15 12:57:15,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 362 states and 362 transitions. [2018-10-15 12:57:15,569 INFO L78 Accepts]: Start accepts. Automaton has 362 states and 362 transitions. Word has length 352 [2018-10-15 12:57:15,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:15,569 INFO L481 AbstractCegarLoop]: Abstraction has 362 states and 362 transitions. [2018-10-15 12:57:15,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 12:57:15,569 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 362 transitions. [2018-10-15 12:57:15,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2018-10-15 12:57:15,571 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:15,571 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:15,572 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:15,572 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:15,572 INFO L82 PathProgramCache]: Analyzing trace with hash -1827600982, now seen corresponding path program 39 times [2018-10-15 12:57:15,573 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:17,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6708 backedges. 0 proven. 6708 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:17,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:17,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 12:57:17,638 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 12:57:17,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 12:57:17,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 12:57:17,639 INFO L87 Difference]: Start difference. First operand 362 states and 362 transitions. Second operand 83 states. [2018-10-15 12:57:21,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:21,275 INFO L93 Difference]: Finished difference Result 382 states and 382 transitions. [2018-10-15 12:57:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 12:57:21,275 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 361 [2018-10-15 12:57:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:21,277 INFO L225 Difference]: With dead ends: 382 [2018-10-15 12:57:21,278 INFO L226 Difference]: Without dead ends: 378 [2018-10-15 12:57:21,279 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 12:57:21,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 378 states. [2018-10-15 12:57:21,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 378 to 371. [2018-10-15 12:57:21,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 371 states. [2018-10-15 12:57:21,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 371 states and 371 transitions. [2018-10-15 12:57:21,283 INFO L78 Accepts]: Start accepts. Automaton has 371 states and 371 transitions. Word has length 361 [2018-10-15 12:57:21,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:21,283 INFO L481 AbstractCegarLoop]: Abstraction has 371 states and 371 transitions. [2018-10-15 12:57:21,283 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 12:57:21,283 INFO L276 IsEmpty]: Start isEmpty. Operand 371 states and 371 transitions. [2018-10-15 12:57:21,285 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 371 [2018-10-15 12:57:21,285 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:21,285 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:21,286 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:21,286 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:21,286 INFO L82 PathProgramCache]: Analyzing trace with hash 1324965417, now seen corresponding path program 40 times [2018-10-15 12:57:21,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:23,407 INFO L134 CoverageAnalysis]: Checked inductivity of 7060 backedges. 0 proven. 7060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:23,407 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:23,408 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 12:57:23,408 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 12:57:23,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 12:57:23,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 12:57:23,409 INFO L87 Difference]: Start difference. First operand 371 states and 371 transitions. Second operand 85 states. [2018-10-15 12:57:27,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:27,157 INFO L93 Difference]: Finished difference Result 391 states and 391 transitions. [2018-10-15 12:57:27,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 12:57:27,157 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 370 [2018-10-15 12:57:27,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:27,159 INFO L225 Difference]: With dead ends: 391 [2018-10-15 12:57:27,159 INFO L226 Difference]: Without dead ends: 387 [2018-10-15 12:57:27,161 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 12:57:27,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2018-10-15 12:57:27,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 380. [2018-10-15 12:57:27,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 380 states. [2018-10-15 12:57:27,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 380 transitions. [2018-10-15 12:57:27,164 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 380 transitions. Word has length 370 [2018-10-15 12:57:27,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:27,165 INFO L481 AbstractCegarLoop]: Abstraction has 380 states and 380 transitions. [2018-10-15 12:57:27,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 12:57:27,165 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 380 transitions. [2018-10-15 12:57:27,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2018-10-15 12:57:27,166 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:27,166 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:27,167 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:27,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:27,167 INFO L82 PathProgramCache]: Analyzing trace with hash -412932982, now seen corresponding path program 41 times [2018-10-15 12:57:27,167 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:27,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:29,471 INFO L134 CoverageAnalysis]: Checked inductivity of 7421 backedges. 0 proven. 7421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:29,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:29,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 12:57:29,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 12:57:29,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 12:57:29,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 12:57:29,473 INFO L87 Difference]: Start difference. First operand 380 states and 380 transitions. Second operand 87 states. [2018-10-15 12:57:33,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:33,551 INFO L93 Difference]: Finished difference Result 400 states and 400 transitions. [2018-10-15 12:57:33,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 12:57:33,552 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 379 [2018-10-15 12:57:33,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:33,554 INFO L225 Difference]: With dead ends: 400 [2018-10-15 12:57:33,554 INFO L226 Difference]: Without dead ends: 396 [2018-10-15 12:57:33,555 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 12:57:33,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 396 states. [2018-10-15 12:57:33,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 396 to 389. [2018-10-15 12:57:33,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 389 states. [2018-10-15 12:57:33,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 389 states to 389 states and 389 transitions. [2018-10-15 12:57:33,559 INFO L78 Accepts]: Start accepts. Automaton has 389 states and 389 transitions. Word has length 379 [2018-10-15 12:57:33,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:33,559 INFO L481 AbstractCegarLoop]: Abstraction has 389 states and 389 transitions. [2018-10-15 12:57:33,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 12:57:33,559 INFO L276 IsEmpty]: Start isEmpty. Operand 389 states and 389 transitions. [2018-10-15 12:57:33,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2018-10-15 12:57:33,561 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:33,561 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:33,561 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:33,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:33,562 INFO L82 PathProgramCache]: Analyzing trace with hash 309066569, now seen corresponding path program 42 times [2018-10-15 12:57:33,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:33,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:36,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7791 backedges. 0 proven. 7791 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:36,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:36,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 12:57:36,145 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 12:57:36,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 12:57:36,146 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 12:57:36,146 INFO L87 Difference]: Start difference. First operand 389 states and 389 transitions. Second operand 89 states. [2018-10-15 12:57:40,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:40,257 INFO L93 Difference]: Finished difference Result 409 states and 409 transitions. [2018-10-15 12:57:40,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 12:57:40,258 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 388 [2018-10-15 12:57:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:40,260 INFO L225 Difference]: With dead ends: 409 [2018-10-15 12:57:40,260 INFO L226 Difference]: Without dead ends: 405 [2018-10-15 12:57:40,262 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 12:57:40,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 405 states. [2018-10-15 12:57:40,265 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 405 to 398. [2018-10-15 12:57:40,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 398 states. [2018-10-15 12:57:40,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 398 transitions. [2018-10-15 12:57:40,267 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 398 transitions. Word has length 388 [2018-10-15 12:57:40,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:40,267 INFO L481 AbstractCegarLoop]: Abstraction has 398 states and 398 transitions. [2018-10-15 12:57:40,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 12:57:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 398 transitions. [2018-10-15 12:57:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2018-10-15 12:57:40,269 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:40,270 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:40,270 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:40,270 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:40,270 INFO L82 PathProgramCache]: Analyzing trace with hash 2009025386, now seen corresponding path program 43 times [2018-10-15 12:57:40,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:40,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:42,815 INFO L134 CoverageAnalysis]: Checked inductivity of 8170 backedges. 0 proven. 8170 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:42,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:42,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 12:57:42,816 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 12:57:42,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 12:57:42,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 12:57:42,817 INFO L87 Difference]: Start difference. First operand 398 states and 398 transitions. Second operand 91 states. [2018-10-15 12:57:47,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:47,027 INFO L93 Difference]: Finished difference Result 418 states and 418 transitions. [2018-10-15 12:57:47,028 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 12:57:47,028 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 397 [2018-10-15 12:57:47,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:47,030 INFO L225 Difference]: With dead ends: 418 [2018-10-15 12:57:47,030 INFO L226 Difference]: Without dead ends: 414 [2018-10-15 12:57:47,031 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 12:57:47,032 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2018-10-15 12:57:47,034 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 407. [2018-10-15 12:57:47,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 407 states. [2018-10-15 12:57:47,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 407 transitions. [2018-10-15 12:57:47,035 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 407 transitions. Word has length 397 [2018-10-15 12:57:47,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:47,036 INFO L481 AbstractCegarLoop]: Abstraction has 407 states and 407 transitions. [2018-10-15 12:57:47,036 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 12:57:47,036 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 407 transitions. [2018-10-15 12:57:47,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 407 [2018-10-15 12:57:47,038 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:47,038 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:47,039 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:47,039 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:47,039 INFO L82 PathProgramCache]: Analyzing trace with hash -794980247, now seen corresponding path program 44 times [2018-10-15 12:57:47,040 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:47,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:49,593 INFO L134 CoverageAnalysis]: Checked inductivity of 8558 backedges. 0 proven. 8558 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:49,593 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:49,593 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 12:57:49,593 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 12:57:49,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 12:57:49,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 12:57:49,594 INFO L87 Difference]: Start difference. First operand 407 states and 407 transitions. Second operand 93 states. [2018-10-15 12:57:54,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:57:54,111 INFO L93 Difference]: Finished difference Result 427 states and 427 transitions. [2018-10-15 12:57:54,111 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 12:57:54,111 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 406 [2018-10-15 12:57:54,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:57:54,114 INFO L225 Difference]: With dead ends: 427 [2018-10-15 12:57:54,114 INFO L226 Difference]: Without dead ends: 423 [2018-10-15 12:57:54,115 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.3s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 12:57:54,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-10-15 12:57:54,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 416. [2018-10-15 12:57:54,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 416 states. [2018-10-15 12:57:54,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 416 transitions. [2018-10-15 12:57:54,119 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 416 transitions. Word has length 406 [2018-10-15 12:57:54,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:57:54,119 INFO L481 AbstractCegarLoop]: Abstraction has 416 states and 416 transitions. [2018-10-15 12:57:54,119 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 12:57:54,120 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 416 transitions. [2018-10-15 12:57:54,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2018-10-15 12:57:54,122 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:57:54,122 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:57:54,122 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:57:54,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:57:54,123 INFO L82 PathProgramCache]: Analyzing trace with hash 1756592714, now seen corresponding path program 45 times [2018-10-15 12:57:54,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:57:54,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:57:57,003 INFO L134 CoverageAnalysis]: Checked inductivity of 8955 backedges. 0 proven. 8955 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:57:57,003 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:57:57,003 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 12:57:57,003 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 12:57:57,004 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 12:57:57,004 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 12:57:57,004 INFO L87 Difference]: Start difference. First operand 416 states and 416 transitions. Second operand 95 states. [2018-10-15 12:58:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:01,545 INFO L93 Difference]: Finished difference Result 436 states and 436 transitions. [2018-10-15 12:58:01,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 12:58:01,546 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 415 [2018-10-15 12:58:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:01,548 INFO L225 Difference]: With dead ends: 436 [2018-10-15 12:58:01,548 INFO L226 Difference]: Without dead ends: 432 [2018-10-15 12:58:01,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 12:58:01,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2018-10-15 12:58:01,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 425. [2018-10-15 12:58:01,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 425 states. [2018-10-15 12:58:01,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 425 states to 425 states and 425 transitions. [2018-10-15 12:58:01,553 INFO L78 Accepts]: Start accepts. Automaton has 425 states and 425 transitions. Word has length 415 [2018-10-15 12:58:01,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:01,553 INFO L481 AbstractCegarLoop]: Abstraction has 425 states and 425 transitions. [2018-10-15 12:58:01,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 12:58:01,553 INFO L276 IsEmpty]: Start isEmpty. Operand 425 states and 425 transitions. [2018-10-15 12:58:01,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2018-10-15 12:58:01,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:01,555 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:01,555 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:01,555 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:01,555 INFO L82 PathProgramCache]: Analyzing trace with hash -1530913399, now seen corresponding path program 46 times [2018-10-15 12:58:01,556 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:01,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:04,227 INFO L134 CoverageAnalysis]: Checked inductivity of 9361 backedges. 0 proven. 9361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:04,227 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:04,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 12:58:04,228 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 12:58:04,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 12:58:04,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 12:58:04,229 INFO L87 Difference]: Start difference. First operand 425 states and 425 transitions. Second operand 97 states. [2018-10-15 12:58:09,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:09,281 INFO L93 Difference]: Finished difference Result 445 states and 445 transitions. [2018-10-15 12:58:09,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 12:58:09,281 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 424 [2018-10-15 12:58:09,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:09,283 INFO L225 Difference]: With dead ends: 445 [2018-10-15 12:58:09,283 INFO L226 Difference]: Without dead ends: 441 [2018-10-15 12:58:09,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 7.0s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 12:58:09,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 441 states. [2018-10-15 12:58:09,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 441 to 434. [2018-10-15 12:58:09,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 434 states. [2018-10-15 12:58:09,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 434 transitions. [2018-10-15 12:58:09,287 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 434 transitions. Word has length 424 [2018-10-15 12:58:09,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:09,288 INFO L481 AbstractCegarLoop]: Abstraction has 434 states and 434 transitions. [2018-10-15 12:58:09,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 12:58:09,288 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 434 transitions. [2018-10-15 12:58:09,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2018-10-15 12:58:09,289 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:09,290 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:09,290 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:09,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:09,290 INFO L82 PathProgramCache]: Analyzing trace with hash 390967594, now seen corresponding path program 47 times [2018-10-15 12:58:09,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:12,244 INFO L134 CoverageAnalysis]: Checked inductivity of 9776 backedges. 0 proven. 9776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:12,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:12,244 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 12:58:12,245 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 12:58:12,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 12:58:12,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 12:58:12,246 INFO L87 Difference]: Start difference. First operand 434 states and 434 transitions. Second operand 99 states. [2018-10-15 12:58:17,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:17,184 INFO L93 Difference]: Finished difference Result 454 states and 454 transitions. [2018-10-15 12:58:17,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 12:58:17,184 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 433 [2018-10-15 12:58:17,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:17,186 INFO L225 Difference]: With dead ends: 454 [2018-10-15 12:58:17,186 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 12:58:17,188 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 12:58:17,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 12:58:17,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2018-10-15 12:58:17,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 12:58:17,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 12:58:17,191 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 433 [2018-10-15 12:58:17,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:17,192 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 12:58:17,192 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 12:58:17,192 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 12:58:17,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 12:58:17,194 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:17,194 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:17,194 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:17,194 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:17,195 INFO L82 PathProgramCache]: Analyzing trace with hash 25535145, now seen corresponding path program 48 times [2018-10-15 12:58:17,195 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:17,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:20,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10200 backedges. 0 proven. 10200 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:20,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:20,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 12:58:20,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 12:58:20,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 12:58:20,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 12:58:20,148 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 101 states. [2018-10-15 12:58:25,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:25,365 INFO L93 Difference]: Finished difference Result 463 states and 463 transitions. [2018-10-15 12:58:25,365 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 12:58:25,365 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 442 [2018-10-15 12:58:25,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:25,367 INFO L225 Difference]: With dead ends: 463 [2018-10-15 12:58:25,367 INFO L226 Difference]: Without dead ends: 459 [2018-10-15 12:58:25,369 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 12:58:25,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2018-10-15 12:58:25,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 452. [2018-10-15 12:58:25,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 452 states. [2018-10-15 12:58:25,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 452 states to 452 states and 452 transitions. [2018-10-15 12:58:25,374 INFO L78 Accepts]: Start accepts. Automaton has 452 states and 452 transitions. Word has length 442 [2018-10-15 12:58:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:25,374 INFO L481 AbstractCegarLoop]: Abstraction has 452 states and 452 transitions. [2018-10-15 12:58:25,374 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 12:58:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 452 states and 452 transitions. [2018-10-15 12:58:25,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2018-10-15 12:58:25,377 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:25,377 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:25,377 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:25,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:25,378 INFO L82 PathProgramCache]: Analyzing trace with hash -115609590, now seen corresponding path program 49 times [2018-10-15 12:58:25,378 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:25,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:28,696 INFO L134 CoverageAnalysis]: Checked inductivity of 10633 backedges. 0 proven. 10633 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:28,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:28,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 12:58:28,697 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 12:58:28,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 12:58:28,697 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 12:58:28,698 INFO L87 Difference]: Start difference. First operand 452 states and 452 transitions. Second operand 103 states. [2018-10-15 12:58:33,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:33,842 INFO L93 Difference]: Finished difference Result 472 states and 472 transitions. [2018-10-15 12:58:33,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 12:58:33,843 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 451 [2018-10-15 12:58:33,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:33,845 INFO L225 Difference]: With dead ends: 472 [2018-10-15 12:58:33,845 INFO L226 Difference]: Without dead ends: 468 [2018-10-15 12:58:33,848 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 12:58:33,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 468 states. [2018-10-15 12:58:33,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 468 to 461. [2018-10-15 12:58:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 461 states. [2018-10-15 12:58:33,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 461 states to 461 states and 461 transitions. [2018-10-15 12:58:33,852 INFO L78 Accepts]: Start accepts. Automaton has 461 states and 461 transitions. Word has length 451 [2018-10-15 12:58:33,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:33,853 INFO L481 AbstractCegarLoop]: Abstraction has 461 states and 461 transitions. [2018-10-15 12:58:33,853 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 12:58:33,853 INFO L276 IsEmpty]: Start isEmpty. Operand 461 states and 461 transitions. [2018-10-15 12:58:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2018-10-15 12:58:33,855 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:33,856 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:33,856 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:33,856 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:33,856 INFO L82 PathProgramCache]: Analyzing trace with hash -786423863, now seen corresponding path program 50 times [2018-10-15 12:58:33,857 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:33,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:37,377 INFO L134 CoverageAnalysis]: Checked inductivity of 11075 backedges. 0 proven. 11075 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:37,378 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:37,378 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 12:58:37,378 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 12:58:37,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 12:58:37,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 12:58:37,379 INFO L87 Difference]: Start difference. First operand 461 states and 461 transitions. Second operand 105 states. [2018-10-15 12:58:42,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:42,930 INFO L93 Difference]: Finished difference Result 481 states and 481 transitions. [2018-10-15 12:58:42,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 12:58:42,930 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 460 [2018-10-15 12:58:42,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:42,932 INFO L225 Difference]: With dead ends: 481 [2018-10-15 12:58:42,932 INFO L226 Difference]: Without dead ends: 477 [2018-10-15 12:58:42,934 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 8.2s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 12:58:42,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 477 states. [2018-10-15 12:58:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 477 to 470. [2018-10-15 12:58:42,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 470 states. [2018-10-15 12:58:42,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 470 states to 470 states and 470 transitions. [2018-10-15 12:58:42,937 INFO L78 Accepts]: Start accepts. Automaton has 470 states and 470 transitions. Word has length 460 [2018-10-15 12:58:42,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:42,938 INFO L481 AbstractCegarLoop]: Abstraction has 470 states and 470 transitions. [2018-10-15 12:58:42,938 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 12:58:42,938 INFO L276 IsEmpty]: Start isEmpty. Operand 470 states and 470 transitions. [2018-10-15 12:58:42,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2018-10-15 12:58:42,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:42,941 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:42,941 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:42,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:42,941 INFO L82 PathProgramCache]: Analyzing trace with hash 2083272426, now seen corresponding path program 51 times [2018-10-15 12:58:42,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:42,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:46,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11526 backedges. 0 proven. 11526 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:46,144 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:46,144 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 12:58:46,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 12:58:46,145 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 12:58:46,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 12:58:46,145 INFO L87 Difference]: Start difference. First operand 470 states and 470 transitions. Second operand 107 states. [2018-10-15 12:58:52,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:58:52,438 INFO L93 Difference]: Finished difference Result 490 states and 490 transitions. [2018-10-15 12:58:52,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 12:58:52,438 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 469 [2018-10-15 12:58:52,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:58:52,441 INFO L225 Difference]: With dead ends: 490 [2018-10-15 12:58:52,441 INFO L226 Difference]: Without dead ends: 486 [2018-10-15 12:58:52,443 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 12:58:52,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 486 states. [2018-10-15 12:58:52,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 486 to 479. [2018-10-15 12:58:52,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 479 states. [2018-10-15 12:58:52,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 479 transitions. [2018-10-15 12:58:52,446 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 479 transitions. Word has length 469 [2018-10-15 12:58:52,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:58:52,447 INFO L481 AbstractCegarLoop]: Abstraction has 479 states and 479 transitions. [2018-10-15 12:58:52,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 12:58:52,447 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 479 transitions. [2018-10-15 12:58:52,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2018-10-15 12:58:52,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:58:52,449 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:58:52,449 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:58:52,449 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:58:52,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1790864151, now seen corresponding path program 52 times [2018-10-15 12:58:52,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:58:52,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:58:55,842 INFO L134 CoverageAnalysis]: Checked inductivity of 11986 backedges. 0 proven. 11986 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:58:55,843 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:58:55,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 12:58:55,843 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 12:58:55,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 12:58:55,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 12:58:55,844 INFO L87 Difference]: Start difference. First operand 479 states and 479 transitions. Second operand 109 states. [2018-10-15 12:59:02,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:02,061 INFO L93 Difference]: Finished difference Result 499 states and 499 transitions. [2018-10-15 12:59:02,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 12:59:02,062 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 478 [2018-10-15 12:59:02,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:02,063 INFO L225 Difference]: With dead ends: 499 [2018-10-15 12:59:02,064 INFO L226 Difference]: Without dead ends: 495 [2018-10-15 12:59:02,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 12:59:02,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2018-10-15 12:59:02,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 488. [2018-10-15 12:59:02,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2018-10-15 12:59:02,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 488 transitions. [2018-10-15 12:59:02,069 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 488 transitions. Word has length 478 [2018-10-15 12:59:02,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:02,069 INFO L481 AbstractCegarLoop]: Abstraction has 488 states and 488 transitions. [2018-10-15 12:59:02,069 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 12:59:02,069 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 488 transitions. [2018-10-15 12:59:02,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2018-10-15 12:59:02,071 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:02,071 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:02,071 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:02,072 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:02,072 INFO L82 PathProgramCache]: Analyzing trace with hash -418609718, now seen corresponding path program 53 times [2018-10-15 12:59:02,072 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:02,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:05,679 INFO L134 CoverageAnalysis]: Checked inductivity of 12455 backedges. 0 proven. 12455 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:05,680 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:05,680 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 12:59:05,680 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 12:59:05,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 12:59:05,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 12:59:05,681 INFO L87 Difference]: Start difference. First operand 488 states and 488 transitions. Second operand 111 states. [2018-10-15 12:59:11,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:11,790 INFO L93 Difference]: Finished difference Result 508 states and 508 transitions. [2018-10-15 12:59:11,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 12:59:11,790 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 487 [2018-10-15 12:59:11,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:11,792 INFO L225 Difference]: With dead ends: 508 [2018-10-15 12:59:11,792 INFO L226 Difference]: Without dead ends: 504 [2018-10-15 12:59:11,793 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 8.9s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 12:59:11,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 504 states. [2018-10-15 12:59:11,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 504 to 497. [2018-10-15 12:59:11,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2018-10-15 12:59:11,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 497 transitions. [2018-10-15 12:59:11,796 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 497 transitions. Word has length 487 [2018-10-15 12:59:11,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:11,797 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 497 transitions. [2018-10-15 12:59:11,797 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 12:59:11,797 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 497 transitions. [2018-10-15 12:59:11,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 497 [2018-10-15 12:59:11,798 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:11,799 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:11,799 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:11,799 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:11,799 INFO L82 PathProgramCache]: Analyzing trace with hash -2028207607, now seen corresponding path program 54 times [2018-10-15 12:59:11,800 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:11,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:15,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12933 backedges. 0 proven. 12933 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:15,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:15,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 12:59:15,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 12:59:15,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 12:59:15,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 12:59:15,552 INFO L87 Difference]: Start difference. First operand 497 states and 497 transitions. Second operand 113 states. [2018-10-15 12:59:21,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:21,779 INFO L93 Difference]: Finished difference Result 517 states and 517 transitions. [2018-10-15 12:59:21,779 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 12:59:21,779 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 496 [2018-10-15 12:59:21,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:21,782 INFO L225 Difference]: With dead ends: 517 [2018-10-15 12:59:21,782 INFO L226 Difference]: Without dead ends: 513 [2018-10-15 12:59:21,783 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 12:59:21,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 513 states. [2018-10-15 12:59:21,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 513 to 506. [2018-10-15 12:59:21,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 506 states. [2018-10-15 12:59:21,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 506 states to 506 states and 506 transitions. [2018-10-15 12:59:21,787 INFO L78 Accepts]: Start accepts. Automaton has 506 states and 506 transitions. Word has length 496 [2018-10-15 12:59:21,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:21,787 INFO L481 AbstractCegarLoop]: Abstraction has 506 states and 506 transitions. [2018-10-15 12:59:21,787 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 12:59:21,787 INFO L276 IsEmpty]: Start isEmpty. Operand 506 states and 506 transitions. [2018-10-15 12:59:21,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 506 [2018-10-15 12:59:21,789 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:21,789 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:21,790 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:21,790 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:21,790 INFO L82 PathProgramCache]: Analyzing trace with hash 952818858, now seen corresponding path program 55 times [2018-10-15 12:59:21,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:21,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 13420 backedges. 0 proven. 13420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:25,838 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:25,838 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 12:59:25,839 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 12:59:25,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 12:59:25,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 12:59:25,840 INFO L87 Difference]: Start difference. First operand 506 states and 506 transitions. Second operand 115 states. [2018-10-15 12:59:32,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:32,727 INFO L93 Difference]: Finished difference Result 526 states and 526 transitions. [2018-10-15 12:59:32,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 12:59:32,727 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 505 [2018-10-15 12:59:32,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:32,730 INFO L225 Difference]: With dead ends: 526 [2018-10-15 12:59:32,730 INFO L226 Difference]: Without dead ends: 522 [2018-10-15 12:59:32,732 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 12:59:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 522 states. [2018-10-15 12:59:32,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 522 to 515. [2018-10-15 12:59:32,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 515 states. [2018-10-15 12:59:32,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 515 states to 515 states and 515 transitions. [2018-10-15 12:59:32,736 INFO L78 Accepts]: Start accepts. Automaton has 515 states and 515 transitions. Word has length 505 [2018-10-15 12:59:32,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:32,736 INFO L481 AbstractCegarLoop]: Abstraction has 515 states and 515 transitions. [2018-10-15 12:59:32,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 12:59:32,736 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 515 transitions. [2018-10-15 12:59:32,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 515 [2018-10-15 12:59:32,738 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:32,738 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:32,738 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:32,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:32,739 INFO L82 PathProgramCache]: Analyzing trace with hash -1218353367, now seen corresponding path program 56 times [2018-10-15 12:59:32,739 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:36,543 INFO L134 CoverageAnalysis]: Checked inductivity of 13916 backedges. 0 proven. 13916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:36,543 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:36,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 12:59:36,544 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 12:59:36,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 12:59:36,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 12:59:36,545 INFO L87 Difference]: Start difference. First operand 515 states and 515 transitions. Second operand 117 states. [2018-10-15 12:59:43,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:43,577 INFO L93 Difference]: Finished difference Result 535 states and 535 transitions. [2018-10-15 12:59:43,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 12:59:43,577 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 514 [2018-10-15 12:59:43,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:43,579 INFO L225 Difference]: With dead ends: 535 [2018-10-15 12:59:43,579 INFO L226 Difference]: Without dead ends: 531 [2018-10-15 12:59:43,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 12:59:43,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 531 states. [2018-10-15 12:59:43,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 531 to 524. [2018-10-15 12:59:43,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 524 states. [2018-10-15 12:59:43,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 524 transitions. [2018-10-15 12:59:43,585 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 524 transitions. Word has length 514 [2018-10-15 12:59:43,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:43,585 INFO L481 AbstractCegarLoop]: Abstraction has 524 states and 524 transitions. [2018-10-15 12:59:43,585 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 12:59:43,585 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 524 transitions. [2018-10-15 12:59:43,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 524 [2018-10-15 12:59:43,587 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:43,587 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:43,588 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:43,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:43,588 INFO L82 PathProgramCache]: Analyzing trace with hash 150289290, now seen corresponding path program 57 times [2018-10-15 12:59:43,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:43,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:47,577 INFO L134 CoverageAnalysis]: Checked inductivity of 14421 backedges. 0 proven. 14421 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:47,577 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:47,577 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 12:59:47,578 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 12:59:47,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 12:59:47,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 12:59:47,579 INFO L87 Difference]: Start difference. First operand 524 states and 524 transitions. Second operand 119 states. [2018-10-15 12:59:54,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:59:54,892 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 12:59:54,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 12:59:54,892 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 523 [2018-10-15 12:59:54,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:59:54,894 INFO L225 Difference]: With dead ends: 544 [2018-10-15 12:59:54,894 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 12:59:54,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.1s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 12:59:54,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 12:59:54,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 533. [2018-10-15 12:59:54,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 12:59:54,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-10-15 12:59:54,899 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 523 [2018-10-15 12:59:54,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:59:54,899 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-10-15 12:59:54,899 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 12:59:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-10-15 12:59:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 12:59:54,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:59:54,902 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:59:54,902 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:59:54,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:59:54,902 INFO L82 PathProgramCache]: Analyzing trace with hash 776193097, now seen corresponding path program 58 times [2018-10-15 12:59:54,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:59:54,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:59:59,200 INFO L134 CoverageAnalysis]: Checked inductivity of 14935 backedges. 0 proven. 14935 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:59:59,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:59:59,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 12:59:59,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 12:59:59,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 12:59:59,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 12:59:59,202 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 121 states. [2018-10-15 13:00:06,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:06,621 INFO L93 Difference]: Finished difference Result 553 states and 553 transitions. [2018-10-15 13:00:06,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 13:00:06,621 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 532 [2018-10-15 13:00:06,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:06,623 INFO L225 Difference]: With dead ends: 553 [2018-10-15 13:00:06,623 INFO L226 Difference]: Without dead ends: 549 [2018-10-15 13:00:06,625 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.6s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 13:00:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 549 states. [2018-10-15 13:00:06,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 549 to 542. [2018-10-15 13:00:06,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2018-10-15 13:00:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 542 transitions. [2018-10-15 13:00:06,629 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 542 transitions. Word has length 532 [2018-10-15 13:00:06,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:06,629 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 542 transitions. [2018-10-15 13:00:06,629 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 13:00:06,630 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 542 transitions. [2018-10-15 13:00:06,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2018-10-15 13:00:06,631 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:06,632 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:06,632 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:06,632 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:06,632 INFO L82 PathProgramCache]: Analyzing trace with hash 1738121834, now seen corresponding path program 59 times [2018-10-15 13:00:06,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 15458 backedges. 0 proven. 15458 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:11,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:11,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 13:00:11,185 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 13:00:11,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 13:00:11,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 13:00:11,186 INFO L87 Difference]: Start difference. First operand 542 states and 542 transitions. Second operand 123 states. [2018-10-15 13:00:19,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:19,060 INFO L93 Difference]: Finished difference Result 562 states and 562 transitions. [2018-10-15 13:00:19,061 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 13:00:19,061 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 541 [2018-10-15 13:00:19,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:19,063 INFO L225 Difference]: With dead ends: 562 [2018-10-15 13:00:19,064 INFO L226 Difference]: Without dead ends: 558 [2018-10-15 13:00:19,066 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 13:00:19,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 558 states. [2018-10-15 13:00:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 558 to 551. [2018-10-15 13:00:19,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 551 states. [2018-10-15 13:00:19,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 551 states to 551 states and 551 transitions. [2018-10-15 13:00:19,070 INFO L78 Accepts]: Start accepts. Automaton has 551 states and 551 transitions. Word has length 541 [2018-10-15 13:00:19,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:19,070 INFO L481 AbstractCegarLoop]: Abstraction has 551 states and 551 transitions. [2018-10-15 13:00:19,070 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 13:00:19,070 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 551 transitions. [2018-10-15 13:00:19,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 551 [2018-10-15 13:00:19,072 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:19,073 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:19,073 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:19,073 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:19,073 INFO L82 PathProgramCache]: Analyzing trace with hash 192223593, now seen corresponding path program 60 times [2018-10-15 13:00:19,074 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:19,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:23,432 INFO L134 CoverageAnalysis]: Checked inductivity of 15990 backedges. 0 proven. 15990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:23,432 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:23,432 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 13:00:23,433 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 13:00:23,433 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 13:00:23,433 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 13:00:23,434 INFO L87 Difference]: Start difference. First operand 551 states and 551 transitions. Second operand 125 states. [2018-10-15 13:00:31,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:31,475 INFO L93 Difference]: Finished difference Result 571 states and 571 transitions. [2018-10-15 13:00:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 13:00:31,476 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 550 [2018-10-15 13:00:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:31,477 INFO L225 Difference]: With dead ends: 571 [2018-10-15 13:00:31,477 INFO L226 Difference]: Without dead ends: 567 [2018-10-15 13:00:31,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.1s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 13:00:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 567 states. [2018-10-15 13:00:31,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 567 to 560. [2018-10-15 13:00:31,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 560 states. [2018-10-15 13:00:31,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 560 states to 560 states and 560 transitions. [2018-10-15 13:00:31,483 INFO L78 Accepts]: Start accepts. Automaton has 560 states and 560 transitions. Word has length 550 [2018-10-15 13:00:31,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:31,483 INFO L481 AbstractCegarLoop]: Abstraction has 560 states and 560 transitions. [2018-10-15 13:00:31,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 13:00:31,483 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 560 transitions. [2018-10-15 13:00:31,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2018-10-15 13:00:31,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:31,485 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:31,486 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:31,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:31,486 INFO L82 PathProgramCache]: Analyzing trace with hash -1119481526, now seen corresponding path program 61 times [2018-10-15 13:00:31,487 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:31,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:36,374 INFO L134 CoverageAnalysis]: Checked inductivity of 16531 backedges. 0 proven. 16531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:36,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 13:00:36,375 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 13:00:36,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 13:00:36,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 13:00:36,376 INFO L87 Difference]: Start difference. First operand 560 states and 560 transitions. Second operand 127 states. [2018-10-15 13:00:44,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:44,546 INFO L93 Difference]: Finished difference Result 580 states and 580 transitions. [2018-10-15 13:00:44,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 13:00:44,547 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 559 [2018-10-15 13:00:44,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:44,549 INFO L225 Difference]: With dead ends: 580 [2018-10-15 13:00:44,549 INFO L226 Difference]: Without dead ends: 576 [2018-10-15 13:00:44,551 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.9s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 13:00:44,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2018-10-15 13:00:44,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 569. [2018-10-15 13:00:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2018-10-15 13:00:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 569 transitions. [2018-10-15 13:00:44,555 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 569 transitions. Word has length 559 [2018-10-15 13:00:44,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:44,555 INFO L481 AbstractCegarLoop]: Abstraction has 569 states and 569 transitions. [2018-10-15 13:00:44,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 13:00:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 569 transitions. [2018-10-15 13:00:44,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2018-10-15 13:00:44,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:44,558 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:44,558 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:44,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:44,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1507367287, now seen corresponding path program 62 times [2018-10-15 13:00:44,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:44,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:00:49,338 INFO L134 CoverageAnalysis]: Checked inductivity of 17081 backedges. 0 proven. 17081 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:00:49,338 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:00:49,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 13:00:49,339 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 13:00:49,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 13:00:49,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 13:00:49,340 INFO L87 Difference]: Start difference. First operand 569 states and 569 transitions. Second operand 129 states. [2018-10-15 13:00:57,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:00:57,314 INFO L93 Difference]: Finished difference Result 589 states and 589 transitions. [2018-10-15 13:00:57,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 13:00:57,314 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 568 [2018-10-15 13:00:57,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:00:57,316 INFO L225 Difference]: With dead ends: 589 [2018-10-15 13:00:57,316 INFO L226 Difference]: Without dead ends: 585 [2018-10-15 13:00:57,318 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 11.6s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 13:00:57,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2018-10-15 13:00:57,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 578. [2018-10-15 13:00:57,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 578 states. [2018-10-15 13:00:57,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 578 transitions. [2018-10-15 13:00:57,322 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 578 transitions. Word has length 568 [2018-10-15 13:00:57,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:00:57,323 INFO L481 AbstractCegarLoop]: Abstraction has 578 states and 578 transitions. [2018-10-15 13:00:57,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 13:00:57,323 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 578 transitions. [2018-10-15 13:00:57,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2018-10-15 13:00:57,325 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:00:57,325 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:00:57,325 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:00:57,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:00:57,326 INFO L82 PathProgramCache]: Analyzing trace with hash -1425504214, now seen corresponding path program 63 times [2018-10-15 13:00:57,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:00:57,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:02,364 INFO L134 CoverageAnalysis]: Checked inductivity of 17640 backedges. 0 proven. 17640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:02,365 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:02,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 13:01:02,366 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 13:01:02,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 13:01:02,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 13:01:02,367 INFO L87 Difference]: Start difference. First operand 578 states and 578 transitions. Second operand 131 states. [2018-10-15 13:01:11,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:11,102 INFO L93 Difference]: Finished difference Result 598 states and 598 transitions. [2018-10-15 13:01:11,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 13:01:11,103 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 577 [2018-10-15 13:01:11,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:11,105 INFO L225 Difference]: With dead ends: 598 [2018-10-15 13:01:11,105 INFO L226 Difference]: Without dead ends: 594 [2018-10-15 13:01:11,107 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 12.6s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 13:01:11,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2018-10-15 13:01:11,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 587. [2018-10-15 13:01:11,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2018-10-15 13:01:11,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 587 transitions. [2018-10-15 13:01:11,112 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 587 transitions. Word has length 577 [2018-10-15 13:01:11,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:11,112 INFO L481 AbstractCegarLoop]: Abstraction has 587 states and 587 transitions. [2018-10-15 13:01:11,112 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 13:01:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 587 transitions. [2018-10-15 13:01:11,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 587 [2018-10-15 13:01:11,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:11,115 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:11,115 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:11,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:11,116 INFO L82 PathProgramCache]: Analyzing trace with hash -1391678551, now seen corresponding path program 64 times [2018-10-15 13:01:11,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:11,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:16,216 INFO L134 CoverageAnalysis]: Checked inductivity of 18208 backedges. 0 proven. 18208 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:16,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:16,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 13:01:16,217 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 13:01:16,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 13:01:16,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 13:01:16,218 INFO L87 Difference]: Start difference. First operand 587 states and 587 transitions. Second operand 133 states. [2018-10-15 13:01:25,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:25,259 INFO L93 Difference]: Finished difference Result 607 states and 607 transitions. [2018-10-15 13:01:25,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 13:01:25,259 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 586 [2018-10-15 13:01:25,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:25,261 INFO L225 Difference]: With dead ends: 607 [2018-10-15 13:01:25,261 INFO L226 Difference]: Without dead ends: 603 [2018-10-15 13:01:25,263 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 13:01:25,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2018-10-15 13:01:25,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 596. [2018-10-15 13:01:25,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2018-10-15 13:01:25,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 596 transitions. [2018-10-15 13:01:25,268 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 596 transitions. Word has length 586 [2018-10-15 13:01:25,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:25,268 INFO L481 AbstractCegarLoop]: Abstraction has 596 states and 596 transitions. [2018-10-15 13:01:25,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 13:01:25,268 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 596 transitions. [2018-10-15 13:01:25,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 596 [2018-10-15 13:01:25,271 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:25,271 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:25,271 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:25,271 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:25,272 INFO L82 PathProgramCache]: Analyzing trace with hash -361822454, now seen corresponding path program 65 times [2018-10-15 13:01:25,272 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:25,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:30,688 INFO L134 CoverageAnalysis]: Checked inductivity of 18785 backedges. 0 proven. 18785 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:30,688 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:30,689 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 13:01:30,689 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 13:01:30,690 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 13:01:30,690 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 13:01:30,690 INFO L87 Difference]: Start difference. First operand 596 states and 596 transitions. Second operand 135 states. [2018-10-15 13:01:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:39,650 INFO L93 Difference]: Finished difference Result 616 states and 616 transitions. [2018-10-15 13:01:39,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 13:01:39,650 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 595 [2018-10-15 13:01:39,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:39,652 INFO L225 Difference]: With dead ends: 616 [2018-10-15 13:01:39,652 INFO L226 Difference]: Without dead ends: 612 [2018-10-15 13:01:39,654 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 13.1s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 13:01:39,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-10-15 13:01:39,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 605. [2018-10-15 13:01:39,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 605 states. [2018-10-15 13:01:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 605 states and 605 transitions. [2018-10-15 13:01:39,658 INFO L78 Accepts]: Start accepts. Automaton has 605 states and 605 transitions. Word has length 595 [2018-10-15 13:01:39,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:39,658 INFO L481 AbstractCegarLoop]: Abstraction has 605 states and 605 transitions. [2018-10-15 13:01:39,658 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 13:01:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 605 states and 605 transitions. [2018-10-15 13:01:39,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 605 [2018-10-15 13:01:39,661 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:39,661 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:39,661 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:39,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:39,662 INFO L82 PathProgramCache]: Analyzing trace with hash 1180100809, now seen corresponding path program 66 times [2018-10-15 13:01:39,662 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:01:45,188 INFO L134 CoverageAnalysis]: Checked inductivity of 19371 backedges. 0 proven. 19371 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:01:45,189 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:01:45,189 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 13:01:45,189 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 13:01:45,190 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 13:01:45,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 13:01:45,190 INFO L87 Difference]: Start difference. First operand 605 states and 605 transitions. Second operand 137 states. [2018-10-15 13:01:54,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:01:54,543 INFO L93 Difference]: Finished difference Result 625 states and 625 transitions. [2018-10-15 13:01:54,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 13:01:54,544 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 604 [2018-10-15 13:01:54,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:01:54,545 INFO L225 Difference]: With dead ends: 625 [2018-10-15 13:01:54,546 INFO L226 Difference]: Without dead ends: 621 [2018-10-15 13:01:54,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 13.7s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 13:01:54,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2018-10-15 13:01:54,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 614. [2018-10-15 13:01:54,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2018-10-15 13:01:54,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 614 transitions. [2018-10-15 13:01:54,552 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 614 transitions. Word has length 604 [2018-10-15 13:01:54,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:01:54,553 INFO L481 AbstractCegarLoop]: Abstraction has 614 states and 614 transitions. [2018-10-15 13:01:54,553 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 13:01:54,553 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 614 transitions. [2018-10-15 13:01:54,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 614 [2018-10-15 13:01:54,555 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:01:54,556 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:01:54,556 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:01:54,556 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:01:54,556 INFO L82 PathProgramCache]: Analyzing trace with hash 763858410, now seen corresponding path program 67 times [2018-10-15 13:01:54,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:01:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:00,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19966 backedges. 0 proven. 19966 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:00,211 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:00,211 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 13:02:00,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 13:02:00,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 13:02:00,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4764, Invalid=14418, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 13:02:00,213 INFO L87 Difference]: Start difference. First operand 614 states and 614 transitions. Second operand 139 states. [2018-10-15 13:02:10,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:10,069 INFO L93 Difference]: Finished difference Result 634 states and 634 transitions. [2018-10-15 13:02:10,070 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 13:02:10,070 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 613 [2018-10-15 13:02:10,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:10,072 INFO L225 Difference]: With dead ends: 634 [2018-10-15 13:02:10,072 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 13:02:10,073 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 14.0s TimeCoverageRelationStatistics Valid=23132, Invalid=52218, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 13:02:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 13:02:10,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2018-10-15 13:02:10,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 13:02:10,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-10-15 13:02:10,078 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 613 [2018-10-15 13:02:10,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:10,078 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-10-15 13:02:10,078 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 13:02:10,078 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-10-15 13:02:10,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 13:02:10,081 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:10,081 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:10,081 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:10,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:10,082 INFO L82 PathProgramCache]: Analyzing trace with hash 800595433, now seen corresponding path program 68 times [2018-10-15 13:02:10,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:10,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:15,914 INFO L134 CoverageAnalysis]: Checked inductivity of 20570 backedges. 0 proven. 20570 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:15,915 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:15,915 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 13:02:15,915 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 13:02:15,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 13:02:15,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4903, Invalid=14837, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 13:02:15,917 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 141 states. [2018-10-15 13:02:25,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:25,954 INFO L93 Difference]: Finished difference Result 643 states and 643 transitions. [2018-10-15 13:02:25,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 13:02:25,955 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 622 [2018-10-15 13:02:25,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:25,958 INFO L225 Difference]: With dead ends: 643 [2018-10-15 13:02:25,958 INFO L226 Difference]: Without dead ends: 639 [2018-10-15 13:02:25,960 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 14.5s TimeCoverageRelationStatistics Valid=23817, Invalid=53745, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 13:02:25,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 639 states. [2018-10-15 13:02:25,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 639 to 632. [2018-10-15 13:02:25,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 632 states. [2018-10-15 13:02:25,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 632 states and 632 transitions. [2018-10-15 13:02:25,964 INFO L78 Accepts]: Start accepts. Automaton has 632 states and 632 transitions. Word has length 622 [2018-10-15 13:02:25,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:25,965 INFO L481 AbstractCegarLoop]: Abstraction has 632 states and 632 transitions. [2018-10-15 13:02:25,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 13:02:25,965 INFO L276 IsEmpty]: Start isEmpty. Operand 632 states and 632 transitions. [2018-10-15 13:02:25,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2018-10-15 13:02:25,967 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:25,968 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:25,968 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:25,968 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:25,968 INFO L82 PathProgramCache]: Analyzing trace with hash -18866998, now seen corresponding path program 69 times [2018-10-15 13:02:25,969 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:26,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:32,249 INFO L134 CoverageAnalysis]: Checked inductivity of 21183 backedges. 0 proven. 21183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:32,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:32,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 13:02:32,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 13:02:32,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 13:02:32,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5044, Invalid=15262, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 13:02:32,251 INFO L87 Difference]: Start difference. First operand 632 states and 632 transitions. Second operand 143 states. [2018-10-15 13:02:42,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:42,426 INFO L93 Difference]: Finished difference Result 652 states and 652 transitions. [2018-10-15 13:02:42,426 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 13:02:42,426 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 631 [2018-10-15 13:02:42,427 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:42,429 INFO L225 Difference]: With dead ends: 652 [2018-10-15 13:02:42,429 INFO L226 Difference]: Without dead ends: 648 [2018-10-15 13:02:42,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 15.0s TimeCoverageRelationStatistics Valid=24512, Invalid=55294, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 13:02:42,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2018-10-15 13:02:42,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 641. [2018-10-15 13:02:42,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 641 states. [2018-10-15 13:02:42,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 641 states and 641 transitions. [2018-10-15 13:02:42,435 INFO L78 Accepts]: Start accepts. Automaton has 641 states and 641 transitions. Word has length 631 [2018-10-15 13:02:42,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:42,436 INFO L481 AbstractCegarLoop]: Abstraction has 641 states and 641 transitions. [2018-10-15 13:02:42,436 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 13:02:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand 641 states and 641 transitions. [2018-10-15 13:02:42,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 641 [2018-10-15 13:02:42,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:42,439 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:42,439 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:42,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:42,440 INFO L82 PathProgramCache]: Analyzing trace with hash -563983607, now seen corresponding path program 70 times [2018-10-15 13:02:42,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:42,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:02:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 21805 backedges. 0 proven. 21805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:02:48,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:02:48,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 13:02:48,466 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 13:02:48,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 13:02:48,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=15693, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 13:02:48,467 INFO L87 Difference]: Start difference. First operand 641 states and 641 transitions. Second operand 145 states. [2018-10-15 13:02:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:02:58,999 INFO L93 Difference]: Finished difference Result 661 states and 661 transitions. [2018-10-15 13:02:58,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 13:02:58,999 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 640 [2018-10-15 13:02:59,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:02:59,002 INFO L225 Difference]: With dead ends: 661 [2018-10-15 13:02:59,002 INFO L226 Difference]: Without dead ends: 657 [2018-10-15 13:02:59,004 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 15.1s TimeCoverageRelationStatistics Valid=25217, Invalid=56865, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 13:02:59,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 657 states. [2018-10-15 13:02:59,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 657 to 650. [2018-10-15 13:02:59,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 650 states. [2018-10-15 13:02:59,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 650 states to 650 states and 650 transitions. [2018-10-15 13:02:59,009 INFO L78 Accepts]: Start accepts. Automaton has 650 states and 650 transitions. Word has length 640 [2018-10-15 13:02:59,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:02:59,009 INFO L481 AbstractCegarLoop]: Abstraction has 650 states and 650 transitions. [2018-10-15 13:02:59,009 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 13:02:59,009 INFO L276 IsEmpty]: Start isEmpty. Operand 650 states and 650 transitions. [2018-10-15 13:02:59,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 650 [2018-10-15 13:02:59,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:02:59,012 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:02:59,012 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:02:59,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:02:59,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1585007702, now seen corresponding path program 71 times [2018-10-15 13:02:59,013 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:02:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:05,453 INFO L134 CoverageAnalysis]: Checked inductivity of 22436 backedges. 0 proven. 22436 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:05,453 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:05,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 13:03:05,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 13:03:05,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 13:03:05,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5332, Invalid=16130, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 13:03:05,456 INFO L87 Difference]: Start difference. First operand 650 states and 650 transitions. Second operand 147 states. [2018-10-15 13:03:15,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:15,990 INFO L93 Difference]: Finished difference Result 670 states and 670 transitions. [2018-10-15 13:03:15,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-15 13:03:15,991 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 649 [2018-10-15 13:03:15,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:15,994 INFO L225 Difference]: With dead ends: 670 [2018-10-15 13:03:15,994 INFO L226 Difference]: Without dead ends: 666 [2018-10-15 13:03:15,996 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 15.7s TimeCoverageRelationStatistics Valid=25932, Invalid=58458, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 13:03:15,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2018-10-15 13:03:16,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 659. [2018-10-15 13:03:16,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 659 states. [2018-10-15 13:03:16,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 659 states to 659 states and 659 transitions. [2018-10-15 13:03:16,001 INFO L78 Accepts]: Start accepts. Automaton has 659 states and 659 transitions. Word has length 649 [2018-10-15 13:03:16,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:16,001 INFO L481 AbstractCegarLoop]: Abstraction has 659 states and 659 transitions. [2018-10-15 13:03:16,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 13:03:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 659 transitions. [2018-10-15 13:03:16,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 659 [2018-10-15 13:03:16,004 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:16,004 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:16,004 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:16,005 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:16,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1626902487, now seen corresponding path program 72 times [2018-10-15 13:03:16,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:16,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:22,461 INFO L134 CoverageAnalysis]: Checked inductivity of 23076 backedges. 0 proven. 23076 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:22,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:22,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 13:03:22,462 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 13:03:22,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 13:03:22,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5479, Invalid=16573, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 13:03:22,463 INFO L87 Difference]: Start difference. First operand 659 states and 659 transitions. Second operand 149 states. [2018-10-15 13:03:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:33,980 INFO L93 Difference]: Finished difference Result 679 states and 679 transitions. [2018-10-15 13:03:33,980 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 13:03:33,981 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 658 [2018-10-15 13:03:33,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:33,984 INFO L225 Difference]: With dead ends: 679 [2018-10-15 13:03:33,984 INFO L226 Difference]: Without dead ends: 675 [2018-10-15 13:03:33,986 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=26657, Invalid=60073, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 13:03:33,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 675 states. [2018-10-15 13:03:33,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 675 to 668. [2018-10-15 13:03:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 668 states. [2018-10-15 13:03:33,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 668 transitions. [2018-10-15 13:03:33,991 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 668 transitions. Word has length 658 [2018-10-15 13:03:33,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:33,991 INFO L481 AbstractCegarLoop]: Abstraction has 668 states and 668 transitions. [2018-10-15 13:03:33,991 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 13:03:33,991 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 668 transitions. [2018-10-15 13:03:33,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2018-10-15 13:03:33,994 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:33,994 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:33,995 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:33,995 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:33,995 INFO L82 PathProgramCache]: Analyzing trace with hash -251047286, now seen corresponding path program 73 times [2018-10-15 13:03:33,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:40,584 INFO L134 CoverageAnalysis]: Checked inductivity of 23725 backedges. 0 proven. 23725 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:40,585 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:40,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 13:03:40,585 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 13:03:40,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 13:03:40,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5628, Invalid=17022, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 13:03:40,587 INFO L87 Difference]: Start difference. First operand 668 states and 668 transitions. Second operand 151 states. [2018-10-15 13:03:52,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 13:03:52,007 INFO L93 Difference]: Finished difference Result 688 states and 688 transitions. [2018-10-15 13:03:52,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-15 13:03:52,008 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 667 [2018-10-15 13:03:52,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 13:03:52,011 INFO L225 Difference]: With dead ends: 688 [2018-10-15 13:03:52,011 INFO L226 Difference]: Without dead ends: 684 [2018-10-15 13:03:52,014 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=27392, Invalid=61710, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 13:03:52,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2018-10-15 13:03:52,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 677. [2018-10-15 13:03:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 677 states. [2018-10-15 13:03:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 677 transitions. [2018-10-15 13:03:52,018 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 677 transitions. Word has length 667 [2018-10-15 13:03:52,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 13:03:52,019 INFO L481 AbstractCegarLoop]: Abstraction has 677 states and 677 transitions. [2018-10-15 13:03:52,019 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 13:03:52,019 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 677 transitions. [2018-10-15 13:03:52,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 677 [2018-10-15 13:03:52,022 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 13:03:52,022 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 13:03:52,022 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 13:03:52,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 13:03:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1244033719, now seen corresponding path program 74 times [2018-10-15 13:03:52,023 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 13:03:52,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 13:03:58,979 INFO L134 CoverageAnalysis]: Checked inductivity of 24383 backedges. 0 proven. 24383 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 13:03:58,979 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 13:03:58,979 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [153] total 153 [2018-10-15 13:03:58,980 INFO L460 AbstractCegarLoop]: Interpolant automaton has 153 states [2018-10-15 13:03:58,980 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 153 interpolants. [2018-10-15 13:03:58,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5779, Invalid=17477, Unknown=0, NotChecked=0, Total=23256 [2018-10-15 13:03:58,981 INFO L87 Difference]: Start difference. First operand 677 states and 677 transitions. Second operand 153 states.