java -Xmx8000000000 -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data --generate-csv --csv-dir csv -tc ../../../trunk/examples/toolchains/AutomizerBpl.xml -s ../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf -i ../../../trunk/examples/programs/20181015-LoopsPathprograms/gj2007_true-unreach-call_true-termination.c.i_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-2d08e6e [2018-10-15 12:34:59,423 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 12:34:59,425 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 12:34:59,442 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 12:34:59,442 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 12:34:59,443 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 12:34:59,445 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 12:34:59,447 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 12:34:59,448 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 12:34:59,449 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 12:34:59,450 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 12:34:59,450 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 12:34:59,451 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 12:34:59,452 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 12:34:59,453 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 12:34:59,454 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 12:34:59,455 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 12:34:59,457 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 12:34:59,459 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 12:34:59,461 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 12:34:59,462 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 12:34:59,463 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 12:34:59,466 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 12:34:59,466 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 12:34:59,466 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 12:34:59,467 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 12:34:59,468 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 12:34:59,469 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 12:34:59,470 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 12:34:59,471 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 12:34:59,472 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 12:34:59,472 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 12:34:59,473 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 12:34:59,473 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 12:34:59,474 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 12:34:59,475 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 12:34:59,475 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:34:59,485 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 12:34:59,485 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 12:34:59,486 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 12:34:59,486 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 12:34:59,486 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 12:34:59,487 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 12:34:59,487 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 12:34:59,488 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 12:34:59,488 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 12:34:59,488 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 12:34:59,488 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 12:34:59,488 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 12:34:59,489 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 12:34:59,489 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 12:34:59,490 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 12:34:59,564 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 12:34:59,577 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 12:34:59,581 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 12:34:59,583 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 12:34:59,583 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 12:34:59,584 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/gj2007_true-unreach-call_true-termination.c.i_4.bpl [2018-10-15 12:34:59,584 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181015-LoopsPathprograms/gj2007_true-unreach-call_true-termination.c.i_4.bpl' [2018-10-15 12:34:59,637 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 12:34:59,639 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 12:34:59,640 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 12:34:59,640 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 12:34:59,640 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 12:34:59,674 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,676 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,689 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,693 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/1) ... [2018-10-15 12:34:59,699 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 12:34:59,700 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 12:34:59,700 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 12:34:59,701 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 12:34:59,702 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (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:34:59,787 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-15 12:34:59,787 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 12:34:59,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 12:35:00,123 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 12:35:00,124 INFO L202 PluginConnector]: Adding new model gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:00 BoogieIcfgContainer [2018-10-15 12:35:00,124 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 12:35:00,125 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 12:35:00,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 12:35:00,133 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 12:35:00,134 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 12:34:59" (1/2) ... [2018-10-15 12:35:00,135 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@104000be and model type gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 12:35:00, skipping insertion in model container [2018-10-15 12:35:00,135 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 12:35:00" (2/2) ... [2018-10-15 12:35:00,142 INFO L112 eAbstractionObserver]: Analyzing ICFG gj2007_true-unreach-call_true-termination.c.i_4.bpl [2018-10-15 12:35:00,154 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 12:35:00,166 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 12:35:00,188 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 12:35:00,225 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 12:35:00,226 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 12:35:00,226 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 12:35:00,226 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 12:35:00,227 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 12:35:00,227 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 12:35:00,227 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 12:35:00,227 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 12:35:00,227 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 12:35:00,252 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states. [2018-10-15 12:35:00,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-10-15 12:35:00,264 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,266 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,267 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,275 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1513587639, now seen corresponding path program 1 times [2018-10-15 12:35:00,331 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:00,444 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:35:00,448 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:35:00,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 12:35:00,454 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 12:35:00,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 12:35:00,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 12:35:00,488 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 3 states. [2018-10-15 12:35:00,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,605 INFO L93 Difference]: Finished difference Result 18 states and 19 transitions. [2018-10-15 12:35:00,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 12:35:00,608 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-10-15 12:35:00,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,618 INFO L225 Difference]: With dead ends: 18 [2018-10-15 12:35:00,619 INFO L226 Difference]: Without dead ends: 18 [2018-10-15 12:35:00,621 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:35:00,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-10-15 12:35:00,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-10-15 12:35:00,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-10-15 12:35:00,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2018-10-15 12:35:00,663 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 10 [2018-10-15 12:35:00,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,663 INFO L481 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2018-10-15 12:35:00,663 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 12:35:00,664 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2018-10-15 12:35:00,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-10-15 12:35:00,664 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,665 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,665 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,665 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,665 INFO L82 PathProgramCache]: Analyzing trace with hash 727666386, now seen corresponding path program 1 times [2018-10-15 12:35:00,666 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:00,746 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:35:00,746 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:00,747 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-10-15 12:35:00,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:35:00,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:35:00,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:35:00,750 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 4 states. [2018-10-15 12:35:00,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,851 INFO L93 Difference]: Finished difference Result 21 states and 22 transitions. [2018-10-15 12:35:00,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:35:00,852 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-10-15 12:35:00,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,853 INFO L225 Difference]: With dead ends: 21 [2018-10-15 12:35:00,853 INFO L226 Difference]: Without dead ends: 21 [2018-10-15 12:35:00,855 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:35:00,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-10-15 12:35:00,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 20. [2018-10-15 12:35:00,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-10-15 12:35:00,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2018-10-15 12:35:00,858 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 13 [2018-10-15 12:35:00,859 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,859 INFO L481 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2018-10-15 12:35:00,859 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:35:00,859 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2018-10-15 12:35:00,860 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-10-15 12:35:00,860 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:00,860 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:00,860 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:00,861 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:00,861 INFO L82 PathProgramCache]: Analyzing trace with hash 364741545, now seen corresponding path program 2 times [2018-10-15 12:35:00,862 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:00,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:00,900 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-10-15 12:35:00,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:35:00,901 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-15 12:35:00,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-15 12:35:00,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-15 12:35:00,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:35:00,902 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2018-10-15 12:35:00,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:00,986 INFO L93 Difference]: Finished difference Result 23 states and 25 transitions. [2018-10-15 12:35:00,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-15 12:35:00,988 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-10-15 12:35:00,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:00,989 INFO L225 Difference]: With dead ends: 23 [2018-10-15 12:35:00,989 INFO L226 Difference]: Without dead ends: 23 [2018-10-15 12:35:00,990 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-15 12:35:00,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-10-15 12:35:00,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2018-10-15 12:35:00,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-15 12:35:00,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2018-10-15 12:35:00,997 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2018-10-15 12:35:00,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:00,998 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2018-10-15 12:35:00,998 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-15 12:35:00,998 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2018-10-15 12:35:01,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-10-15 12:35:01,000 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:01,001 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:01,001 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:01,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:01,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1060472748, now seen corresponding path program 1 times [2018-10-15 12:35:01,004 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:01,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,146 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,146 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:35:01,148 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:35:01,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:35:01,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:01,149 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand 5 states. [2018-10-15 12:35:01,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:01,281 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2018-10-15 12:35:01,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:35:01,282 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2018-10-15 12:35:01,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:01,283 INFO L225 Difference]: With dead ends: 25 [2018-10-15 12:35:01,283 INFO L226 Difference]: Without dead ends: 25 [2018-10-15 12:35:01,284 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:01,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-10-15 12:35:01,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-10-15 12:35:01,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-10-15 12:35:01,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-10-15 12:35:01,288 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 20 [2018-10-15 12:35:01,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:01,289 INFO L481 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-10-15 12:35:01,289 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:35:01,289 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-10-15 12:35:01,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-10-15 12:35:01,290 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:01,290 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:01,290 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:01,291 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:01,291 INFO L82 PathProgramCache]: Analyzing trace with hash 199652253, now seen corresponding path program 2 times [2018-10-15 12:35:01,292 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:01,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,515 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,515 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-15 12:35:01,516 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-15 12:35:01,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-15 12:35:01,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:35:01,517 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 6 states. [2018-10-15 12:35:01,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:01,576 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-10-15 12:35:01,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-15 12:35:01,577 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 23 [2018-10-15 12:35:01,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:01,578 INFO L225 Difference]: With dead ends: 28 [2018-10-15 12:35:01,578 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 12:35:01,579 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-10-15 12:35:01,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 12:35:01,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2018-10-15 12:35:01,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-10-15 12:35:01,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2018-10-15 12:35:01,583 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 23 [2018-10-15 12:35:01,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:01,584 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2018-10-15 12:35:01,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-15 12:35:01,584 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2018-10-15 12:35:01,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-10-15 12:35:01,586 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:01,586 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:01,586 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:01,587 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:01,587 INFO L82 PathProgramCache]: Analyzing trace with hash -1725577292, now seen corresponding path program 3 times [2018-10-15 12:35:01,588 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:01,696 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 5 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:01,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:01,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-15 12:35:01,698 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-15 12:35:01,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-15 12:35:01,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:35:01,699 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand 7 states. [2018-10-15 12:35:01,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:01,875 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-10-15 12:35:01,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-15 12:35:01,876 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 26 [2018-10-15 12:35:01,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:01,877 INFO L225 Difference]: With dead ends: 31 [2018-10-15 12:35:01,877 INFO L226 Difference]: Without dead ends: 31 [2018-10-15 12:35:01,877 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2018-10-15 12:35:01,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-10-15 12:35:01,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-10-15 12:35:01,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-10-15 12:35:01,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-10-15 12:35:01,884 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 26 [2018-10-15 12:35:01,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:01,885 INFO L481 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-10-15 12:35:01,885 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-15 12:35:01,885 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-10-15 12:35:01,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-10-15 12:35:01,886 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:01,886 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:01,886 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:01,887 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:01,887 INFO L82 PathProgramCache]: Analyzing trace with hash -1245681603, now seen corresponding path program 4 times [2018-10-15 12:35:01,888 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:01,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:02,017 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 6 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:02,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:02,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:35:02,019 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:35:02,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:35:02,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:35:02,020 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 8 states. [2018-10-15 12:35:02,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:02,091 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2018-10-15 12:35:02,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:35:02,092 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 29 [2018-10-15 12:35:02,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:02,093 INFO L225 Difference]: With dead ends: 34 [2018-10-15 12:35:02,093 INFO L226 Difference]: Without dead ends: 34 [2018-10-15 12:35:02,094 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:35:02,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-10-15 12:35:02,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-10-15 12:35:02,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 12:35:02,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2018-10-15 12:35:02,098 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 29 [2018-10-15 12:35:02,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:02,099 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2018-10-15 12:35:02,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:35:02,099 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2018-10-15 12:35:02,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 12:35:02,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:02,100 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:02,101 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:02,101 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:02,101 INFO L82 PathProgramCache]: Analyzing trace with hash 1675628308, now seen corresponding path program 5 times [2018-10-15 12:35:02,102 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:02,533 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 7 proven. 57 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:02,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:02,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 12:35:02,534 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 12:35:02,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 12:35:02,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:35:02,535 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand 9 states. [2018-10-15 12:35:02,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:02,625 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2018-10-15 12:35:02,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-15 12:35:02,630 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-10-15 12:35:02,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:02,630 INFO L225 Difference]: With dead ends: 37 [2018-10-15 12:35:02,631 INFO L226 Difference]: Without dead ends: 37 [2018-10-15 12:35:02,631 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2018-10-15 12:35:02,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-10-15 12:35:02,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-10-15 12:35:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-10-15 12:35:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2018-10-15 12:35:02,635 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 32 [2018-10-15 12:35:02,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:02,636 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2018-10-15 12:35:02,636 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 12:35:02,636 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2018-10-15 12:35:02,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-15 12:35:02,637 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:02,638 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:02,638 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:02,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:02,638 INFO L82 PathProgramCache]: Analyzing trace with hash 1496868061, now seen corresponding path program 6 times [2018-10-15 12:35:02,639 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:02,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:02,753 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 8 proven. 77 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:02,753 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:02,754 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-15 12:35:02,754 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-15 12:35:02,754 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-15 12:35:02,754 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:35:02,755 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand 10 states. [2018-10-15 12:35:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:02,839 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2018-10-15 12:35:02,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-15 12:35:02,841 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 35 [2018-10-15 12:35:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:02,842 INFO L225 Difference]: With dead ends: 40 [2018-10-15 12:35:02,842 INFO L226 Difference]: Without dead ends: 40 [2018-10-15 12:35:02,843 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-10-15 12:35:02,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-10-15 12:35:02,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-10-15 12:35:02,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-10-15 12:35:02,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2018-10-15 12:35:02,847 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 35 [2018-10-15 12:35:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:02,847 INFO L481 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2018-10-15 12:35:02,847 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-15 12:35:02,847 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2018-10-15 12:35:02,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-10-15 12:35:02,849 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:02,849 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:02,849 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:02,849 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:02,850 INFO L82 PathProgramCache]: Analyzing trace with hash 1809796724, now seen corresponding path program 7 times [2018-10-15 12:35:02,850 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:02,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:03,078 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 9 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:03,079 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:03,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:35:03,080 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:35:03,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:35:03,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:35:03,081 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand 11 states. [2018-10-15 12:35:03,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:03,562 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2018-10-15 12:35:03,562 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:35:03,562 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 38 [2018-10-15 12:35:03,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:03,563 INFO L225 Difference]: With dead ends: 43 [2018-10-15 12:35:03,563 INFO L226 Difference]: Without dead ends: 43 [2018-10-15 12:35:03,564 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:35:03,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-15 12:35:03,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-15 12:35:03,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-15 12:35:03,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2018-10-15 12:35:03,568 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 38 [2018-10-15 12:35:03,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:03,568 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2018-10-15 12:35:03,569 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:35:03,569 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2018-10-15 12:35:03,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-15 12:35:03,570 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:03,570 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:03,570 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:03,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:03,571 INFO L82 PathProgramCache]: Analyzing trace with hash -106403459, now seen corresponding path program 8 times [2018-10-15 12:35:03,572 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:03,792 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 10 proven. 126 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:03,793 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:03,793 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-15 12:35:03,793 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-15 12:35:03,794 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-15 12:35:03,794 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:35:03,794 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand 12 states. [2018-10-15 12:35:03,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:03,902 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2018-10-15 12:35:03,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-15 12:35:03,904 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 41 [2018-10-15 12:35:03,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:03,905 INFO L225 Difference]: With dead ends: 46 [2018-10-15 12:35:03,905 INFO L226 Difference]: Without dead ends: 46 [2018-10-15 12:35:03,906 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-10-15 12:35:03,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-10-15 12:35:03,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 45. [2018-10-15 12:35:03,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-10-15 12:35:03,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2018-10-15 12:35:03,910 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 41 [2018-10-15 12:35:03,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:03,910 INFO L481 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2018-10-15 12:35:03,910 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-15 12:35:03,911 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2018-10-15 12:35:03,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-10-15 12:35:03,912 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:03,912 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:03,912 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:03,912 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:03,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1215724076, now seen corresponding path program 9 times [2018-10-15 12:35:03,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:04,087 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 11 proven. 155 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:04,088 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:04,088 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 12:35:04,088 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 12:35:04,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 12:35:04,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:35:04,089 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand 13 states. [2018-10-15 12:35:04,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:04,189 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2018-10-15 12:35:04,189 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-15 12:35:04,189 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 44 [2018-10-15 12:35:04,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:04,191 INFO L225 Difference]: With dead ends: 49 [2018-10-15 12:35:04,191 INFO L226 Difference]: Without dead ends: 49 [2018-10-15 12:35:04,192 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-10-15 12:35:04,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-15 12:35:04,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-15 12:35:04,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-15 12:35:04,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2018-10-15 12:35:04,196 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 44 [2018-10-15 12:35:04,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:04,197 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2018-10-15 12:35:04,197 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 12:35:04,197 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2018-10-15 12:35:04,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-15 12:35:04,198 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:04,198 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:04,199 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:04,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:04,199 INFO L82 PathProgramCache]: Analyzing trace with hash 787117597, now seen corresponding path program 10 times [2018-10-15 12:35:04,200 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:04,368 INFO L134 CoverageAnalysis]: Checked inductivity of 199 backedges. 12 proven. 187 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:04,368 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:04,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:35:04,369 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:35:04,369 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:35:04,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:35:04,369 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand 14 states. [2018-10-15 12:35:04,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:04,485 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2018-10-15 12:35:04,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:35:04,486 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 47 [2018-10-15 12:35:04,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:04,487 INFO L225 Difference]: With dead ends: 52 [2018-10-15 12:35:04,487 INFO L226 Difference]: Without dead ends: 52 [2018-10-15 12:35:04,487 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:35:04,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-10-15 12:35:04,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-10-15 12:35:04,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-10-15 12:35:04,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2018-10-15 12:35:04,492 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 47 [2018-10-15 12:35:04,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:04,492 INFO L481 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2018-10-15 12:35:04,492 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:35:04,493 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2018-10-15 12:35:04,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-10-15 12:35:04,494 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:04,494 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:04,494 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:04,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:04,495 INFO L82 PathProgramCache]: Analyzing trace with hash 1757721908, now seen corresponding path program 11 times [2018-10-15 12:35:04,495 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:04,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:04,689 INFO L134 CoverageAnalysis]: Checked inductivity of 235 backedges. 13 proven. 222 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:04,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:04,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 12:35:04,690 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 12:35:04,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 12:35:04,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:35:04,691 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand 15 states. [2018-10-15 12:35:04,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:04,809 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2018-10-15 12:35:04,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-15 12:35:04,810 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 50 [2018-10-15 12:35:04,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:04,811 INFO L225 Difference]: With dead ends: 55 [2018-10-15 12:35:04,811 INFO L226 Difference]: Without dead ends: 55 [2018-10-15 12:35:04,812 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2018-10-15 12:35:04,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-15 12:35:04,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-15 12:35:04,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-15 12:35:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2018-10-15 12:35:04,816 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 50 [2018-10-15 12:35:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:04,816 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2018-10-15 12:35:04,817 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 12:35:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2018-10-15 12:35:04,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-15 12:35:04,818 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:04,818 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:04,818 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:04,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:04,819 INFO L82 PathProgramCache]: Analyzing trace with hash -984053059, now seen corresponding path program 12 times [2018-10-15 12:35:04,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:05,017 INFO L134 CoverageAnalysis]: Checked inductivity of 274 backedges. 14 proven. 260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:05,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:05,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-15 12:35:05,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-15 12:35:05,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-15 12:35:05,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:35:05,019 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand 16 states. [2018-10-15 12:35:05,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:05,138 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2018-10-15 12:35:05,141 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-15 12:35:05,141 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 53 [2018-10-15 12:35:05,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:05,142 INFO L225 Difference]: With dead ends: 58 [2018-10-15 12:35:05,142 INFO L226 Difference]: Without dead ends: 58 [2018-10-15 12:35:05,143 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-10-15 12:35:05,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2018-10-15 12:35:05,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 57. [2018-10-15 12:35:05,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-10-15 12:35:05,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2018-10-15 12:35:05,156 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 53 [2018-10-15 12:35:05,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:05,156 INFO L481 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2018-10-15 12:35:05,156 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-15 12:35:05,157 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2018-10-15 12:35:05,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-10-15 12:35:05,159 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:05,159 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:05,159 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:05,160 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:05,160 INFO L82 PathProgramCache]: Analyzing trace with hash 485940372, now seen corresponding path program 13 times [2018-10-15 12:35:05,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:05,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:05,420 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 15 proven. 301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:05,421 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:05,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:35:05,421 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:35:05,422 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:35:05,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:35:05,422 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand 17 states. [2018-10-15 12:35:05,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:05,530 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2018-10-15 12:35:05,530 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:35:05,531 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 56 [2018-10-15 12:35:05,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:05,532 INFO L225 Difference]: With dead ends: 61 [2018-10-15 12:35:05,532 INFO L226 Difference]: Without dead ends: 61 [2018-10-15 12:35:05,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:35:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-15 12:35:05,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-15 12:35:05,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-15 12:35:05,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2018-10-15 12:35:05,536 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 56 [2018-10-15 12:35:05,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:05,537 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2018-10-15 12:35:05,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:35:05,537 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2018-10-15 12:35:05,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-15 12:35:05,538 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:05,538 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:05,538 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:05,539 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:05,539 INFO L82 PathProgramCache]: Analyzing trace with hash 1573693277, now seen corresponding path program 14 times [2018-10-15 12:35:05,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:05,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,285 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 16 proven. 345 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:06,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:06,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-15 12:35:06,286 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-15 12:35:06,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-15 12:35:06,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:35:06,287 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand 18 states. [2018-10-15 12:35:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:06,382 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2018-10-15 12:35:06,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-15 12:35:06,383 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 59 [2018-10-15 12:35:06,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:06,384 INFO L225 Difference]: With dead ends: 64 [2018-10-15 12:35:06,384 INFO L226 Difference]: Without dead ends: 64 [2018-10-15 12:35:06,385 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-10-15 12:35:06,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2018-10-15 12:35:06,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2018-10-15 12:35:06,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 12:35:06,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2018-10-15 12:35:06,388 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 59 [2018-10-15 12:35:06,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:06,389 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2018-10-15 12:35:06,389 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-15 12:35:06,389 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2018-10-15 12:35:06,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 12:35:06,390 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:06,390 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:06,391 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:06,391 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:06,391 INFO L82 PathProgramCache]: Analyzing trace with hash 1292237812, now seen corresponding path program 15 times [2018-10-15 12:35:06,392 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:06,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:06,797 INFO L134 CoverageAnalysis]: Checked inductivity of 409 backedges. 17 proven. 392 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:06,797 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:06,797 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 12:35:06,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 12:35:06,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 12:35:06,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:35:06,799 INFO L87 Difference]: Start difference. First operand 63 states and 64 transitions. Second operand 19 states. [2018-10-15 12:35:07,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,073 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2018-10-15 12:35:07,073 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-15 12:35:07,073 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 62 [2018-10-15 12:35:07,074 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,074 INFO L225 Difference]: With dead ends: 67 [2018-10-15 12:35:07,074 INFO L226 Difference]: Without dead ends: 67 [2018-10-15 12:35:07,075 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2018-10-15 12:35:07,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-15 12:35:07,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-15 12:35:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-15 12:35:07,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 67 transitions. [2018-10-15 12:35:07,078 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 67 transitions. Word has length 62 [2018-10-15 12:35:07,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,079 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 67 transitions. [2018-10-15 12:35:07,079 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 12:35:07,079 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 67 transitions. [2018-10-15 12:35:07,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-15 12:35:07,080 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,080 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,080 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,081 INFO L82 PathProgramCache]: Analyzing trace with hash 228641789, now seen corresponding path program 16 times [2018-10-15 12:35:07,082 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:07,307 INFO L134 CoverageAnalysis]: Checked inductivity of 460 backedges. 18 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:07,308 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:07,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:35:07,308 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:35:07,309 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:35:07,309 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:07,309 INFO L87 Difference]: Start difference. First operand 66 states and 67 transitions. Second operand 20 states. [2018-10-15 12:35:07,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,459 INFO L93 Difference]: Finished difference Result 70 states and 71 transitions. [2018-10-15 12:35:07,459 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:35:07,459 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 65 [2018-10-15 12:35:07,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,460 INFO L225 Difference]: With dead ends: 70 [2018-10-15 12:35:07,460 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 12:35:07,461 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:07,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 12:35:07,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-10-15 12:35:07,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-10-15 12:35:07,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 70 transitions. [2018-10-15 12:35:07,464 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 70 transitions. Word has length 65 [2018-10-15 12:35:07,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,464 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 70 transitions. [2018-10-15 12:35:07,464 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:35:07,465 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 70 transitions. [2018-10-15 12:35:07,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-10-15 12:35:07,465 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,466 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,466 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,466 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,466 INFO L82 PathProgramCache]: Analyzing trace with hash -1386736812, now seen corresponding path program 17 times [2018-10-15 12:35:07,467 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:07,742 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 19 proven. 495 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:07,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:07,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 12:35:07,742 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 12:35:07,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 12:35:07,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:35:07,743 INFO L87 Difference]: Start difference. First operand 69 states and 70 transitions. Second operand 21 states. [2018-10-15 12:35:07,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:07,954 INFO L93 Difference]: Finished difference Result 73 states and 74 transitions. [2018-10-15 12:35:07,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-15 12:35:07,955 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 68 [2018-10-15 12:35:07,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:07,956 INFO L225 Difference]: With dead ends: 73 [2018-10-15 12:35:07,956 INFO L226 Difference]: Without dead ends: 73 [2018-10-15 12:35:07,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2018-10-15 12:35:07,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-15 12:35:07,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-15 12:35:07,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-15 12:35:07,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 73 transitions. [2018-10-15 12:35:07,958 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 73 transitions. Word has length 68 [2018-10-15 12:35:07,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:07,959 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 73 transitions. [2018-10-15 12:35:07,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 12:35:07,959 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 73 transitions. [2018-10-15 12:35:07,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-15 12:35:07,960 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:07,960 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:07,960 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:07,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:07,961 INFO L82 PathProgramCache]: Analyzing trace with hash -22087523, now seen corresponding path program 18 times [2018-10-15 12:35:07,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:07,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:09,097 INFO L134 CoverageAnalysis]: Checked inductivity of 571 backedges. 20 proven. 551 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:09,098 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:09,098 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-15 12:35:09,098 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-15 12:35:09,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-15 12:35:09,099 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:35:09,099 INFO L87 Difference]: Start difference. First operand 72 states and 73 transitions. Second operand 22 states. [2018-10-15 12:35:09,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:09,236 INFO L93 Difference]: Finished difference Result 76 states and 77 transitions. [2018-10-15 12:35:09,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-15 12:35:09,237 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-10-15 12:35:09,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:09,238 INFO L225 Difference]: With dead ends: 76 [2018-10-15 12:35:09,238 INFO L226 Difference]: Without dead ends: 76 [2018-10-15 12:35:09,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-10-15 12:35:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2018-10-15 12:35:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 75. [2018-10-15 12:35:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-10-15 12:35:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 76 transitions. [2018-10-15 12:35:09,241 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 76 transitions. Word has length 71 [2018-10-15 12:35:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:09,241 INFO L481 AbstractCegarLoop]: Abstraction has 75 states and 76 transitions. [2018-10-15 12:35:09,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-15 12:35:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 76 transitions. [2018-10-15 12:35:09,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-10-15 12:35:09,243 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:09,243 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:09,243 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:09,243 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:09,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1915542860, now seen corresponding path program 19 times [2018-10-15 12:35:09,244 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:09,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:09,729 INFO L134 CoverageAnalysis]: Checked inductivity of 631 backedges. 21 proven. 610 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:09,730 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:09,730 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:35:09,730 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:35:09,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:35:09,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:09,731 INFO L87 Difference]: Start difference. First operand 75 states and 76 transitions. Second operand 23 states. [2018-10-15 12:35:09,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:09,882 INFO L93 Difference]: Finished difference Result 79 states and 80 transitions. [2018-10-15 12:35:09,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:35:09,886 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 74 [2018-10-15 12:35:09,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:09,887 INFO L225 Difference]: With dead ends: 79 [2018-10-15 12:35:09,887 INFO L226 Difference]: Without dead ends: 79 [2018-10-15 12:35:09,888 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:09,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-15 12:35:09,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-15 12:35:09,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-15 12:35:09,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2018-10-15 12:35:09,890 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 74 [2018-10-15 12:35:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:09,890 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2018-10-15 12:35:09,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2018-10-15 12:35:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-15 12:35:09,891 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:09,891 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:09,892 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:09,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:09,892 INFO L82 PathProgramCache]: Analyzing trace with hash 256978237, now seen corresponding path program 20 times [2018-10-15 12:35:09,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:09,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,310 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 22 proven. 672 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:10,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-15 12:35:10,311 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-15 12:35:10,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-15 12:35:10,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:35:10,312 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand 24 states. [2018-10-15 12:35:10,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:10,469 INFO L93 Difference]: Finished difference Result 82 states and 83 transitions. [2018-10-15 12:35:10,470 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-15 12:35:10,470 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 77 [2018-10-15 12:35:10,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:10,471 INFO L225 Difference]: With dead ends: 82 [2018-10-15 12:35:10,471 INFO L226 Difference]: Without dead ends: 82 [2018-10-15 12:35:10,472 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-10-15 12:35:10,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-10-15 12:35:10,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-10-15 12:35:10,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-10-15 12:35:10,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 82 transitions. [2018-10-15 12:35:10,475 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 82 transitions. Word has length 77 [2018-10-15 12:35:10,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:10,475 INFO L481 AbstractCegarLoop]: Abstraction has 81 states and 82 transitions. [2018-10-15 12:35:10,475 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-15 12:35:10,476 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 82 transitions. [2018-10-15 12:35:10,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-10-15 12:35:10,476 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:10,477 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:10,477 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:10,477 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:10,477 INFO L82 PathProgramCache]: Analyzing trace with hash 970795540, now seen corresponding path program 21 times [2018-10-15 12:35:10,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:10,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:10,859 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 23 proven. 737 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:10,859 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:10,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 12:35:10,859 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 12:35:10,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 12:35:10,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:10,860 INFO L87 Difference]: Start difference. First operand 81 states and 82 transitions. Second operand 25 states. [2018-10-15 12:35:11,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:11,046 INFO L93 Difference]: Finished difference Result 85 states and 86 transitions. [2018-10-15 12:35:11,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-15 12:35:11,047 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 80 [2018-10-15 12:35:11,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:11,048 INFO L225 Difference]: With dead ends: 85 [2018-10-15 12:35:11,048 INFO L226 Difference]: Without dead ends: 85 [2018-10-15 12:35:11,049 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=300, Invalid=300, Unknown=0, NotChecked=0, Total=600 [2018-10-15 12:35:11,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-15 12:35:11,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-15 12:35:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-15 12:35:11,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 85 transitions. [2018-10-15 12:35:11,051 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 85 transitions. Word has length 80 [2018-10-15 12:35:11,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:11,051 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 85 transitions. [2018-10-15 12:35:11,051 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 12:35:11,051 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 85 transitions. [2018-10-15 12:35:11,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-15 12:35:11,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:11,052 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:11,052 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:11,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:11,053 INFO L82 PathProgramCache]: Analyzing trace with hash 1918986717, now seen corresponding path program 22 times [2018-10-15 12:35:11,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:11,388 INFO L134 CoverageAnalysis]: Checked inductivity of 829 backedges. 24 proven. 805 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:11,388 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:11,388 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:35:11,388 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:35:11,389 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:35:11,389 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:11,389 INFO L87 Difference]: Start difference. First operand 84 states and 85 transitions. Second operand 26 states. [2018-10-15 12:35:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:11,583 INFO L93 Difference]: Finished difference Result 88 states and 89 transitions. [2018-10-15 12:35:11,583 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:35:11,584 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 83 [2018-10-15 12:35:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:11,585 INFO L225 Difference]: With dead ends: 88 [2018-10-15 12:35:11,585 INFO L226 Difference]: Without dead ends: 88 [2018-10-15 12:35:11,586 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:11,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2018-10-15 12:35:11,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 87. [2018-10-15 12:35:11,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-10-15 12:35:11,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 88 transitions. [2018-10-15 12:35:11,589 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 88 transitions. Word has length 83 [2018-10-15 12:35:11,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:11,590 INFO L481 AbstractCegarLoop]: Abstraction has 87 states and 88 transitions. [2018-10-15 12:35:11,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:35:11,590 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 88 transitions. [2018-10-15 12:35:11,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-10-15 12:35:11,591 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:11,591 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:11,591 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:11,592 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:11,592 INFO L82 PathProgramCache]: Analyzing trace with hash 1482434932, now seen corresponding path program 23 times [2018-10-15 12:35:11,593 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:11,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:12,267 INFO L134 CoverageAnalysis]: Checked inductivity of 901 backedges. 25 proven. 876 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:12,267 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:12,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 12:35:12,267 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 12:35:12,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 12:35:12,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:12,268 INFO L87 Difference]: Start difference. First operand 87 states and 88 transitions. Second operand 27 states. [2018-10-15 12:35:12,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:12,429 INFO L93 Difference]: Finished difference Result 91 states and 92 transitions. [2018-10-15 12:35:12,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-15 12:35:12,430 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 86 [2018-10-15 12:35:12,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:12,431 INFO L225 Difference]: With dead ends: 91 [2018-10-15 12:35:12,431 INFO L226 Difference]: Without dead ends: 91 [2018-10-15 12:35:12,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=351, Invalid=351, Unknown=0, NotChecked=0, Total=702 [2018-10-15 12:35:12,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-15 12:35:12,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-15 12:35:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-15 12:35:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 91 transitions. [2018-10-15 12:35:12,434 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 91 transitions. Word has length 86 [2018-10-15 12:35:12,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:12,434 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 91 transitions. [2018-10-15 12:35:12,434 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 12:35:12,434 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 91 transitions. [2018-10-15 12:35:12,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-15 12:35:12,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:12,435 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:12,435 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:12,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:12,436 INFO L82 PathProgramCache]: Analyzing trace with hash 1329180285, now seen corresponding path program 24 times [2018-10-15 12:35:12,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:12,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:13,122 INFO L134 CoverageAnalysis]: Checked inductivity of 976 backedges. 26 proven. 950 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:13,122 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:13,122 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-15 12:35:13,123 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-15 12:35:13,123 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-15 12:35:13,123 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:13,124 INFO L87 Difference]: Start difference. First operand 90 states and 91 transitions. Second operand 28 states. [2018-10-15 12:35:13,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:13,386 INFO L93 Difference]: Finished difference Result 94 states and 95 transitions. [2018-10-15 12:35:13,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-15 12:35:13,387 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 89 [2018-10-15 12:35:13,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:13,387 INFO L225 Difference]: With dead ends: 94 [2018-10-15 12:35:13,388 INFO L226 Difference]: Without dead ends: 94 [2018-10-15 12:35:13,388 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-10-15 12:35:13,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2018-10-15 12:35:13,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2018-10-15 12:35:13,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 12:35:13,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 94 transitions. [2018-10-15 12:35:13,391 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 94 transitions. Word has length 89 [2018-10-15 12:35:13,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:13,391 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 94 transitions. [2018-10-15 12:35:13,391 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-15 12:35:13,391 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 94 transitions. [2018-10-15 12:35:13,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 12:35:13,392 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:13,392 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:13,392 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:13,393 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:13,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1270227156, now seen corresponding path program 25 times [2018-10-15 12:35:13,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:13,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:14,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1054 backedges. 27 proven. 1027 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:14,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:14,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:35:14,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:35:14,528 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:35:14,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:14,528 INFO L87 Difference]: Start difference. First operand 93 states and 94 transitions. Second operand 29 states. [2018-10-15 12:35:14,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:14,765 INFO L93 Difference]: Finished difference Result 97 states and 98 transitions. [2018-10-15 12:35:14,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:35:14,765 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 92 [2018-10-15 12:35:14,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:14,766 INFO L225 Difference]: With dead ends: 97 [2018-10-15 12:35:14,767 INFO L226 Difference]: Without dead ends: 97 [2018-10-15 12:35:14,767 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:14,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-15 12:35:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-15 12:35:14,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-15 12:35:14,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 97 transitions. [2018-10-15 12:35:14,770 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 97 transitions. Word has length 92 [2018-10-15 12:35:14,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:14,770 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 97 transitions. [2018-10-15 12:35:14,770 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:35:14,770 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 97 transitions. [2018-10-15 12:35:14,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-15 12:35:14,770 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:14,771 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:14,771 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:14,771 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:14,771 INFO L82 PathProgramCache]: Analyzing trace with hash 1639185181, now seen corresponding path program 26 times [2018-10-15 12:35:14,772 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:14,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:15,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1135 backedges. 28 proven. 1107 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:15,251 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:15,251 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-15 12:35:15,252 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-15 12:35:15,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-15 12:35:15,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:15,252 INFO L87 Difference]: Start difference. First operand 96 states and 97 transitions. Second operand 30 states. [2018-10-15 12:35:15,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:15,443 INFO L93 Difference]: Finished difference Result 100 states and 101 transitions. [2018-10-15 12:35:15,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-15 12:35:15,450 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 95 [2018-10-15 12:35:15,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:15,451 INFO L225 Difference]: With dead ends: 100 [2018-10-15 12:35:15,451 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 12:35:15,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-10-15 12:35:15,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 12:35:15,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-10-15 12:35:15,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-10-15 12:35:15,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 100 transitions. [2018-10-15 12:35:15,454 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 100 transitions. Word has length 95 [2018-10-15 12:35:15,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:15,455 INFO L481 AbstractCegarLoop]: Abstraction has 99 states and 100 transitions. [2018-10-15 12:35:15,455 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-15 12:35:15,455 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 100 transitions. [2018-10-15 12:35:15,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-10-15 12:35:15,455 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:15,456 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:15,456 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:15,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:15,456 INFO L82 PathProgramCache]: Analyzing trace with hash -1848569804, now seen corresponding path program 27 times [2018-10-15 12:35:15,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:16,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 29 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:16,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:16,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 12:35:16,579 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 12:35:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 12:35:16,580 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:16,580 INFO L87 Difference]: Start difference. First operand 99 states and 100 transitions. Second operand 31 states. [2018-10-15 12:35:16,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:16,763 INFO L93 Difference]: Finished difference Result 103 states and 104 transitions. [2018-10-15 12:35:16,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-15 12:35:16,763 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 98 [2018-10-15 12:35:16,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:16,764 INFO L225 Difference]: With dead ends: 103 [2018-10-15 12:35:16,764 INFO L226 Difference]: Without dead ends: 103 [2018-10-15 12:35:16,765 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=465, Invalid=465, Unknown=0, NotChecked=0, Total=930 [2018-10-15 12:35:16,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-15 12:35:16,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-15 12:35:16,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-15 12:35:16,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 103 transitions. [2018-10-15 12:35:16,768 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 103 transitions. Word has length 98 [2018-10-15 12:35:16,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:16,769 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 103 transitions. [2018-10-15 12:35:16,769 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 12:35:16,769 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 103 transitions. [2018-10-15 12:35:16,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-15 12:35:16,769 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:16,770 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:16,770 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:16,770 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:16,770 INFO L82 PathProgramCache]: Analyzing trace with hash -1708503107, now seen corresponding path program 28 times [2018-10-15 12:35:16,771 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:17,201 INFO L134 CoverageAnalysis]: Checked inductivity of 1306 backedges. 30 proven. 1276 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:17,201 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:17,201 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:35:17,201 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:35:17,202 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:35:17,202 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:17,202 INFO L87 Difference]: Start difference. First operand 102 states and 103 transitions. Second operand 32 states. [2018-10-15 12:35:17,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:17,442 INFO L93 Difference]: Finished difference Result 106 states and 107 transitions. [2018-10-15 12:35:17,442 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:35:17,442 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 101 [2018-10-15 12:35:17,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:17,444 INFO L225 Difference]: With dead ends: 106 [2018-10-15 12:35:17,444 INFO L226 Difference]: Without dead ends: 106 [2018-10-15 12:35:17,445 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:17,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-10-15 12:35:17,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2018-10-15 12:35:17,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-10-15 12:35:17,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2018-10-15 12:35:17,447 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 101 [2018-10-15 12:35:17,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:17,448 INFO L481 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2018-10-15 12:35:17,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:35:17,448 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2018-10-15 12:35:17,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-10-15 12:35:17,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:17,449 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:17,449 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:17,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:17,450 INFO L82 PathProgramCache]: Analyzing trace with hash 605222804, now seen corresponding path program 29 times [2018-10-15 12:35:17,450 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:17,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:18,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1396 backedges. 31 proven. 1365 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:18,127 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:18,127 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 12:35:18,127 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 12:35:18,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 12:35:18,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:18,128 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand 33 states. [2018-10-15 12:35:18,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:18,478 INFO L93 Difference]: Finished difference Result 109 states and 110 transitions. [2018-10-15 12:35:18,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-15 12:35:18,478 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 104 [2018-10-15 12:35:18,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:18,479 INFO L225 Difference]: With dead ends: 109 [2018-10-15 12:35:18,479 INFO L226 Difference]: Without dead ends: 109 [2018-10-15 12:35:18,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=528, Invalid=528, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 12:35:18,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-15 12:35:18,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-15 12:35:18,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-15 12:35:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 109 transitions. [2018-10-15 12:35:18,483 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 109 transitions. Word has length 104 [2018-10-15 12:35:18,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:18,483 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 109 transitions. [2018-10-15 12:35:18,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 12:35:18,483 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 109 transitions. [2018-10-15 12:35:18,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-15 12:35:18,484 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:18,484 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:18,484 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:18,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:18,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1116296099, now seen corresponding path program 30 times [2018-10-15 12:35:18,485 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:18,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:18,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1489 backedges. 32 proven. 1457 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:18,967 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:18,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-15 12:35:18,967 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-15 12:35:18,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-15 12:35:18,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:35:18,968 INFO L87 Difference]: Start difference. First operand 108 states and 109 transitions. Second operand 34 states. [2018-10-15 12:35:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:19,181 INFO L93 Difference]: Finished difference Result 112 states and 113 transitions. [2018-10-15 12:35:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-15 12:35:19,182 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 107 [2018-10-15 12:35:19,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:19,183 INFO L225 Difference]: With dead ends: 112 [2018-10-15 12:35:19,183 INFO L226 Difference]: Without dead ends: 112 [2018-10-15 12:35:19,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-10-15 12:35:19,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2018-10-15 12:35:19,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2018-10-15 12:35:19,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-10-15 12:35:19,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 112 transitions. [2018-10-15 12:35:19,187 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 112 transitions. Word has length 107 [2018-10-15 12:35:19,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:19,187 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 112 transitions. [2018-10-15 12:35:19,187 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-15 12:35:19,188 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 112 transitions. [2018-10-15 12:35:19,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-10-15 12:35:19,188 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:19,188 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:19,188 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:19,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:19,189 INFO L82 PathProgramCache]: Analyzing trace with hash -681453836, now seen corresponding path program 31 times [2018-10-15 12:35:19,189 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:19,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:19,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1585 backedges. 33 proven. 1552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:19,772 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:19,773 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:35:19,773 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:35:19,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:35:19,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:19,774 INFO L87 Difference]: Start difference. First operand 111 states and 112 transitions. Second operand 35 states. [2018-10-15 12:35:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:20,005 INFO L93 Difference]: Finished difference Result 115 states and 116 transitions. [2018-10-15 12:35:20,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:35:20,006 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 110 [2018-10-15 12:35:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:20,007 INFO L225 Difference]: With dead ends: 115 [2018-10-15 12:35:20,007 INFO L226 Difference]: Without dead ends: 115 [2018-10-15 12:35:20,008 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-15 12:35:20,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-15 12:35:20,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-15 12:35:20,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 115 transitions. [2018-10-15 12:35:20,011 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 115 transitions. Word has length 110 [2018-10-15 12:35:20,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:20,011 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 115 transitions. [2018-10-15 12:35:20,012 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:35:20,012 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 115 transitions. [2018-10-15 12:35:20,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-15 12:35:20,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:20,012 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:20,013 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:20,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:20,013 INFO L82 PathProgramCache]: Analyzing trace with hash 83038461, now seen corresponding path program 32 times [2018-10-15 12:35:20,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:20,582 INFO L134 CoverageAnalysis]: Checked inductivity of 1684 backedges. 34 proven. 1650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:20,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:20,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-15 12:35:20,583 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-15 12:35:20,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-15 12:35:20,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:35:20,584 INFO L87 Difference]: Start difference. First operand 114 states and 115 transitions. Second operand 36 states. [2018-10-15 12:35:20,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:20,807 INFO L93 Difference]: Finished difference Result 118 states and 119 transitions. [2018-10-15 12:35:20,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-15 12:35:20,808 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 113 [2018-10-15 12:35:20,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:20,809 INFO L225 Difference]: With dead ends: 118 [2018-10-15 12:35:20,809 INFO L226 Difference]: Without dead ends: 118 [2018-10-15 12:35:20,810 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-10-15 12:35:20,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2018-10-15 12:35:20,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 117. [2018-10-15 12:35:20,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-10-15 12:35:20,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 118 transitions. [2018-10-15 12:35:20,813 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 118 transitions. Word has length 113 [2018-10-15 12:35:20,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:20,814 INFO L481 AbstractCegarLoop]: Abstraction has 117 states and 118 transitions. [2018-10-15 12:35:20,814 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-15 12:35:20,814 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 118 transitions. [2018-10-15 12:35:20,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-10-15 12:35:20,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:20,814 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:20,814 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:20,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:20,815 INFO L82 PathProgramCache]: Analyzing trace with hash -1138512300, now seen corresponding path program 33 times [2018-10-15 12:35:20,815 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:21,366 INFO L134 CoverageAnalysis]: Checked inductivity of 1786 backedges. 35 proven. 1751 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:21,366 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:21,366 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 12:35:21,367 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 12:35:21,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 12:35:21,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:21,367 INFO L87 Difference]: Start difference. First operand 117 states and 118 transitions. Second operand 37 states. [2018-10-15 12:35:21,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:21,531 INFO L93 Difference]: Finished difference Result 121 states and 122 transitions. [2018-10-15 12:35:21,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-15 12:35:21,532 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 116 [2018-10-15 12:35:21,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:21,533 INFO L225 Difference]: With dead ends: 121 [2018-10-15 12:35:21,533 INFO L226 Difference]: Without dead ends: 121 [2018-10-15 12:35:21,535 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=666, Invalid=666, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 12:35:21,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-15 12:35:21,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-10-15 12:35:21,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-15 12:35:21,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 121 transitions. [2018-10-15 12:35:21,538 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 121 transitions. Word has length 116 [2018-10-15 12:35:21,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:21,539 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 121 transitions. [2018-10-15 12:35:21,539 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 12:35:21,539 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 121 transitions. [2018-10-15 12:35:21,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-15 12:35:21,540 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:21,540 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:21,540 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:21,540 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:21,540 INFO L82 PathProgramCache]: Analyzing trace with hash -1099334243, now seen corresponding path program 34 times [2018-10-15 12:35:21,541 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:21,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:22,471 INFO L134 CoverageAnalysis]: Checked inductivity of 1891 backedges. 36 proven. 1855 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:22,471 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:22,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:35:22,472 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:35:22,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:35:22,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:22,473 INFO L87 Difference]: Start difference. First operand 120 states and 121 transitions. Second operand 38 states. [2018-10-15 12:35:22,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:22,701 INFO L93 Difference]: Finished difference Result 124 states and 125 transitions. [2018-10-15 12:35:22,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:35:22,701 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 119 [2018-10-15 12:35:22,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:22,702 INFO L225 Difference]: With dead ends: 124 [2018-10-15 12:35:22,703 INFO L226 Difference]: Without dead ends: 124 [2018-10-15 12:35:22,703 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:22,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2018-10-15 12:35:22,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2018-10-15 12:35:22,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 12:35:22,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 124 transitions. [2018-10-15 12:35:22,707 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 124 transitions. Word has length 119 [2018-10-15 12:35:22,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:22,707 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 124 transitions. [2018-10-15 12:35:22,707 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:35:22,707 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 124 transitions. [2018-10-15 12:35:22,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 12:35:22,708 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:22,708 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:22,708 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:22,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:22,709 INFO L82 PathProgramCache]: Analyzing trace with hash 2118024628, now seen corresponding path program 35 times [2018-10-15 12:35:22,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:24,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1999 backedges. 37 proven. 1962 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:24,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:24,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 12:35:24,107 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 12:35:24,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 12:35:24,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:24,108 INFO L87 Difference]: Start difference. First operand 123 states and 124 transitions. Second operand 39 states. [2018-10-15 12:35:24,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:24,354 INFO L93 Difference]: Finished difference Result 127 states and 128 transitions. [2018-10-15 12:35:24,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-15 12:35:24,354 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 122 [2018-10-15 12:35:24,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:24,356 INFO L225 Difference]: With dead ends: 127 [2018-10-15 12:35:24,356 INFO L226 Difference]: Without dead ends: 127 [2018-10-15 12:35:24,357 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 12:35:24,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-15 12:35:24,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-10-15 12:35:24,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-15 12:35:24,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 127 transitions. [2018-10-15 12:35:24,360 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 127 transitions. Word has length 122 [2018-10-15 12:35:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:24,361 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 127 transitions. [2018-10-15 12:35:24,361 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 12:35:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 127 transitions. [2018-10-15 12:35:24,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-15 12:35:24,362 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:24,362 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:24,362 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:24,362 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:24,362 INFO L82 PathProgramCache]: Analyzing trace with hash -328994243, now seen corresponding path program 36 times [2018-10-15 12:35:24,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:24,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:25,105 INFO L134 CoverageAnalysis]: Checked inductivity of 2110 backedges. 38 proven. 2072 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:25,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:25,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-15 12:35:25,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-15 12:35:25,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-15 12:35:25,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:35:25,107 INFO L87 Difference]: Start difference. First operand 126 states and 127 transitions. Second operand 40 states. [2018-10-15 12:35:26,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:26,333 INFO L93 Difference]: Finished difference Result 130 states and 131 transitions. [2018-10-15 12:35:26,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-15 12:35:26,334 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 125 [2018-10-15 12:35:26,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:26,336 INFO L225 Difference]: With dead ends: 130 [2018-10-15 12:35:26,336 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 12:35:26,337 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-10-15 12:35:26,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 12:35:26,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 129. [2018-10-15 12:35:26,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-10-15 12:35:26,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 130 transitions. [2018-10-15 12:35:26,340 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 130 transitions. Word has length 125 [2018-10-15 12:35:26,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:26,341 INFO L481 AbstractCegarLoop]: Abstraction has 129 states and 130 transitions. [2018-10-15 12:35:26,341 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-15 12:35:26,341 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 130 transitions. [2018-10-15 12:35:26,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-10-15 12:35:26,342 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:26,342 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:26,342 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:26,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:26,342 INFO L82 PathProgramCache]: Analyzing trace with hash -988265196, now seen corresponding path program 37 times [2018-10-15 12:35:26,343 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:26,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:27,009 INFO L134 CoverageAnalysis]: Checked inductivity of 2224 backedges. 39 proven. 2185 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:27,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:27,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:35:27,009 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:35:27,010 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:35:27,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:27,011 INFO L87 Difference]: Start difference. First operand 129 states and 130 transitions. Second operand 41 states. [2018-10-15 12:35:27,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:27,289 INFO L93 Difference]: Finished difference Result 133 states and 134 transitions. [2018-10-15 12:35:27,295 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:35:27,295 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 128 [2018-10-15 12:35:27,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:27,296 INFO L225 Difference]: With dead ends: 133 [2018-10-15 12:35:27,296 INFO L226 Difference]: Without dead ends: 133 [2018-10-15 12:35:27,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:27,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-15 12:35:27,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-15 12:35:27,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-15 12:35:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 133 transitions. [2018-10-15 12:35:27,300 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 133 transitions. Word has length 128 [2018-10-15 12:35:27,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:27,300 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 133 transitions. [2018-10-15 12:35:27,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:35:27,300 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 133 transitions. [2018-10-15 12:35:27,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-15 12:35:27,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:27,301 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:27,301 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:27,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:27,302 INFO L82 PathProgramCache]: Analyzing trace with hash -443781411, now seen corresponding path program 38 times [2018-10-15 12:35:27,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:27,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:28,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2341 backedges. 40 proven. 2301 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:28,018 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:28,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-15 12:35:28,018 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-15 12:35:28,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-15 12:35:28,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:35:28,019 INFO L87 Difference]: Start difference. First operand 132 states and 133 transitions. Second operand 42 states. [2018-10-15 12:35:28,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:28,213 INFO L93 Difference]: Finished difference Result 136 states and 137 transitions. [2018-10-15 12:35:28,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-15 12:35:28,214 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 131 [2018-10-15 12:35:28,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:28,215 INFO L225 Difference]: With dead ends: 136 [2018-10-15 12:35:28,215 INFO L226 Difference]: Without dead ends: 136 [2018-10-15 12:35:28,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-10-15 12:35:28,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2018-10-15 12:35:28,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 135. [2018-10-15 12:35:28,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-10-15 12:35:28,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 136 transitions. [2018-10-15 12:35:28,220 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 136 transitions. Word has length 131 [2018-10-15 12:35:28,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:28,221 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 136 transitions. [2018-10-15 12:35:28,221 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-15 12:35:28,221 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 136 transitions. [2018-10-15 12:35:28,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-10-15 12:35:28,222 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:28,222 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:28,222 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:28,222 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:28,234 INFO L82 PathProgramCache]: Analyzing trace with hash -1818819468, now seen corresponding path program 39 times [2018-10-15 12:35:28,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:28,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2461 backedges. 41 proven. 2420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:29,376 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:29,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 12:35:29,377 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 12:35:29,377 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 12:35:29,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:29,378 INFO L87 Difference]: Start difference. First operand 135 states and 136 transitions. Second operand 43 states. [2018-10-15 12:35:31,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:31,196 INFO L93 Difference]: Finished difference Result 139 states and 140 transitions. [2018-10-15 12:35:31,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-15 12:35:31,196 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 134 [2018-10-15 12:35:31,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:31,197 INFO L225 Difference]: With dead ends: 139 [2018-10-15 12:35:31,198 INFO L226 Difference]: Without dead ends: 139 [2018-10-15 12:35:31,198 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=903, Invalid=903, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 12:35:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-15 12:35:31,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-15 12:35:31,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-15 12:35:31,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 139 transitions. [2018-10-15 12:35:31,202 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 139 transitions. Word has length 134 [2018-10-15 12:35:31,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:31,203 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 139 transitions. [2018-10-15 12:35:31,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 12:35:31,203 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 139 transitions. [2018-10-15 12:35:31,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-15 12:35:31,204 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:31,204 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:31,204 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:31,205 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:31,205 INFO L82 PathProgramCache]: Analyzing trace with hash -179506307, now seen corresponding path program 40 times [2018-10-15 12:35:31,205 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:31,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:32,119 INFO L134 CoverageAnalysis]: Checked inductivity of 2584 backedges. 42 proven. 2542 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:32,120 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:32,120 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:35:32,120 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:35:32,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:35:32,121 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:35:32,121 INFO L87 Difference]: Start difference. First operand 138 states and 139 transitions. Second operand 44 states. [2018-10-15 12:35:32,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:32,398 INFO L93 Difference]: Finished difference Result 142 states and 143 transitions. [2018-10-15 12:35:32,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:35:32,399 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 137 [2018-10-15 12:35:32,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:32,400 INFO L225 Difference]: With dead ends: 142 [2018-10-15 12:35:32,400 INFO L226 Difference]: Without dead ends: 142 [2018-10-15 12:35:32,402 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:35:32,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2018-10-15 12:35:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 141. [2018-10-15 12:35:32,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-10-15 12:35:32,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 142 transitions. [2018-10-15 12:35:32,404 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 142 transitions. Word has length 137 [2018-10-15 12:35:32,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:32,405 INFO L481 AbstractCegarLoop]: Abstraction has 141 states and 142 transitions. [2018-10-15 12:35:32,405 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:35:32,405 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 142 transitions. [2018-10-15 12:35:32,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-10-15 12:35:32,406 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:32,406 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:32,406 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:32,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:32,407 INFO L82 PathProgramCache]: Analyzing trace with hash -1474249772, now seen corresponding path program 41 times [2018-10-15 12:35:32,407 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:32,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:34,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2710 backedges. 43 proven. 2667 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:34,030 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:34,030 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 12:35:34,030 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 12:35:34,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 12:35:34,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:35:34,031 INFO L87 Difference]: Start difference. First operand 141 states and 142 transitions. Second operand 45 states. [2018-10-15 12:35:34,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:34,224 INFO L93 Difference]: Finished difference Result 145 states and 146 transitions. [2018-10-15 12:35:34,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-15 12:35:34,224 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 140 [2018-10-15 12:35:34,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:34,226 INFO L225 Difference]: With dead ends: 145 [2018-10-15 12:35:34,227 INFO L226 Difference]: Without dead ends: 145 [2018-10-15 12:35:34,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=990, Invalid=990, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 12:35:34,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-15 12:35:34,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-15 12:35:34,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-15 12:35:34,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 145 transitions. [2018-10-15 12:35:34,230 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 145 transitions. Word has length 140 [2018-10-15 12:35:34,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:34,230 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 145 transitions. [2018-10-15 12:35:34,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 12:35:34,231 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 145 transitions. [2018-10-15 12:35:34,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-15 12:35:34,231 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:34,231 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:34,231 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:34,232 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:34,232 INFO L82 PathProgramCache]: Analyzing trace with hash -75530211, now seen corresponding path program 42 times [2018-10-15 12:35:34,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 2839 backedges. 44 proven. 2795 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:35,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:35,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-15 12:35:35,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-15 12:35:35,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-15 12:35:35,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:35:35,841 INFO L87 Difference]: Start difference. First operand 144 states and 145 transitions. Second operand 46 states. [2018-10-15 12:35:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:36,103 INFO L93 Difference]: Finished difference Result 148 states and 149 transitions. [2018-10-15 12:35:36,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-15 12:35:36,109 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 143 [2018-10-15 12:35:36,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:36,110 INFO L225 Difference]: With dead ends: 148 [2018-10-15 12:35:36,110 INFO L226 Difference]: Without dead ends: 148 [2018-10-15 12:35:36,111 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1035, Invalid=1035, Unknown=0, NotChecked=0, Total=2070 [2018-10-15 12:35:36,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2018-10-15 12:35:36,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 147. [2018-10-15 12:35:36,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-10-15 12:35:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 148 transitions. [2018-10-15 12:35:36,113 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 148 transitions. Word has length 143 [2018-10-15 12:35:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:36,114 INFO L481 AbstractCegarLoop]: Abstraction has 147 states and 148 transitions. [2018-10-15 12:35:36,114 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-15 12:35:36,114 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 148 transitions. [2018-10-15 12:35:36,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-10-15 12:35:36,114 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:36,115 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:36,115 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:36,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:36,115 INFO L82 PathProgramCache]: Analyzing trace with hash -593794252, now seen corresponding path program 43 times [2018-10-15 12:35:36,116 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:36,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:36,950 INFO L134 CoverageAnalysis]: Checked inductivity of 2971 backedges. 45 proven. 2926 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:36,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:36,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:35:36,951 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:35:36,951 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:35:36,951 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:36,951 INFO L87 Difference]: Start difference. First operand 147 states and 148 transitions. Second operand 47 states. [2018-10-15 12:35:37,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:37,344 INFO L93 Difference]: Finished difference Result 151 states and 152 transitions. [2018-10-15 12:35:37,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:35:37,344 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 146 [2018-10-15 12:35:37,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:37,345 INFO L225 Difference]: With dead ends: 151 [2018-10-15 12:35:37,345 INFO L226 Difference]: Without dead ends: 151 [2018-10-15 12:35:37,346 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:37,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-15 12:35:37,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-10-15 12:35:37,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-15 12:35:37,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 151 transitions. [2018-10-15 12:35:37,349 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 151 transitions. Word has length 146 [2018-10-15 12:35:37,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:37,349 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 151 transitions. [2018-10-15 12:35:37,349 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:35:37,349 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 151 transitions. [2018-10-15 12:35:37,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-15 12:35:37,350 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:37,350 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:37,350 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:37,351 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:37,351 INFO L82 PathProgramCache]: Analyzing trace with hash 209589437, now seen corresponding path program 44 times [2018-10-15 12:35:37,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:37,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:38,651 INFO L134 CoverageAnalysis]: Checked inductivity of 3106 backedges. 46 proven. 3060 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:38,651 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:38,652 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-15 12:35:38,652 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-15 12:35:38,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-15 12:35:38,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:35:38,653 INFO L87 Difference]: Start difference. First operand 150 states and 151 transitions. Second operand 48 states. [2018-10-15 12:35:38,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:38,955 INFO L93 Difference]: Finished difference Result 154 states and 155 transitions. [2018-10-15 12:35:38,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-15 12:35:38,955 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 149 [2018-10-15 12:35:38,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:38,956 INFO L225 Difference]: With dead ends: 154 [2018-10-15 12:35:38,956 INFO L226 Difference]: Without dead ends: 154 [2018-10-15 12:35:38,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1128, Invalid=1128, Unknown=0, NotChecked=0, Total=2256 [2018-10-15 12:35:38,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2018-10-15 12:35:38,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 153. [2018-10-15 12:35:38,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 12:35:38,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 154 transitions. [2018-10-15 12:35:38,959 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 154 transitions. Word has length 149 [2018-10-15 12:35:38,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:38,960 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 154 transitions. [2018-10-15 12:35:38,960 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-15 12:35:38,960 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 154 transitions. [2018-10-15 12:35:38,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 12:35:38,961 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:38,961 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:38,961 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:38,961 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:38,962 INFO L82 PathProgramCache]: Analyzing trace with hash -2039672172, now seen corresponding path program 45 times [2018-10-15 12:35:38,962 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:38,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:40,380 INFO L134 CoverageAnalysis]: Checked inductivity of 3244 backedges. 47 proven. 3197 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:40,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:40,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 12:35:40,381 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 12:35:40,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 12:35:40,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:35:40,382 INFO L87 Difference]: Start difference. First operand 153 states and 154 transitions. Second operand 49 states. [2018-10-15 12:35:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:40,688 INFO L93 Difference]: Finished difference Result 157 states and 158 transitions. [2018-10-15 12:35:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-15 12:35:40,689 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 152 [2018-10-15 12:35:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:40,690 INFO L225 Difference]: With dead ends: 157 [2018-10-15 12:35:40,690 INFO L226 Difference]: Without dead ends: 157 [2018-10-15 12:35:40,691 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1176, Invalid=1176, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 12:35:40,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-15 12:35:40,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-10-15 12:35:40,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-15 12:35:40,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 157 transitions. [2018-10-15 12:35:40,694 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 157 transitions. Word has length 152 [2018-10-15 12:35:40,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:40,694 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 157 transitions. [2018-10-15 12:35:40,694 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 12:35:40,694 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 157 transitions. [2018-10-15 12:35:40,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-15 12:35:40,695 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:40,695 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:40,695 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:40,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:40,696 INFO L82 PathProgramCache]: Analyzing trace with hash 287486301, now seen corresponding path program 46 times [2018-10-15 12:35:40,696 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:40,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:41,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3385 backedges. 48 proven. 3337 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:41,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:41,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:35:41,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:35:41,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:35:41,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:35:41,744 INFO L87 Difference]: Start difference. First operand 156 states and 157 transitions. Second operand 50 states. [2018-10-15 12:35:41,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:41,989 INFO L93 Difference]: Finished difference Result 160 states and 161 transitions. [2018-10-15 12:35:41,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:35:41,989 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 155 [2018-10-15 12:35:41,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:41,991 INFO L225 Difference]: With dead ends: 160 [2018-10-15 12:35:41,991 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 12:35:41,992 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:35:41,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 12:35:41,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 159. [2018-10-15 12:35:41,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-10-15 12:35:41,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 160 transitions. [2018-10-15 12:35:41,994 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 160 transitions. Word has length 155 [2018-10-15 12:35:41,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:41,995 INFO L481 AbstractCegarLoop]: Abstraction has 159 states and 160 transitions. [2018-10-15 12:35:41,995 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:35:41,995 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 160 transitions. [2018-10-15 12:35:41,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-10-15 12:35:41,996 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:41,996 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:41,996 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:41,996 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:41,996 INFO L82 PathProgramCache]: Analyzing trace with hash -696536588, now seen corresponding path program 47 times [2018-10-15 12:35:41,997 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:42,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:43,213 INFO L134 CoverageAnalysis]: Checked inductivity of 3529 backedges. 49 proven. 3480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:43,213 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:43,213 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 12:35:43,214 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 12:35:43,214 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 12:35:43,215 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:43,215 INFO L87 Difference]: Start difference. First operand 159 states and 160 transitions. Second operand 51 states. [2018-10-15 12:35:43,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:43,528 INFO L93 Difference]: Finished difference Result 163 states and 164 transitions. [2018-10-15 12:35:43,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-15 12:35:43,529 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 158 [2018-10-15 12:35:43,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:43,530 INFO L225 Difference]: With dead ends: 163 [2018-10-15 12:35:43,530 INFO L226 Difference]: Without dead ends: 163 [2018-10-15 12:35:43,531 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1275, Invalid=1275, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 12:35:43,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-15 12:35:43,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-10-15 12:35:43,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-15 12:35:43,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 163 transitions. [2018-10-15 12:35:43,534 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 163 transitions. Word has length 158 [2018-10-15 12:35:43,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:43,534 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 163 transitions. [2018-10-15 12:35:43,534 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 12:35:43,534 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 163 transitions. [2018-10-15 12:35:43,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-15 12:35:43,535 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:43,535 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:43,535 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:43,535 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:43,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1724339709, now seen corresponding path program 48 times [2018-10-15 12:35:43,536 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:43,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:45,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3676 backedges. 50 proven. 3626 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 12:35:45,532 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:45,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-15 12:35:45,533 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-15 12:35:45,533 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-15 12:35:45,533 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:35:45,534 INFO L87 Difference]: Start difference. First operand 162 states and 163 transitions. Second operand 52 states. [2018-10-15 12:35:45,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:45,861 INFO L93 Difference]: Finished difference Result 165 states and 166 transitions. [2018-10-15 12:35:45,862 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-15 12:35:45,862 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 161 [2018-10-15 12:35:45,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:45,864 INFO L225 Difference]: With dead ends: 165 [2018-10-15 12:35:45,864 INFO L226 Difference]: Without dead ends: 165 [2018-10-15 12:35:45,864 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=1326, Invalid=1326, Unknown=0, NotChecked=0, Total=2652 [2018-10-15 12:35:45,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-15 12:35:45,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-10-15 12:35:45,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-10-15 12:35:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 166 transitions. [2018-10-15 12:35:45,867 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 166 transitions. Word has length 161 [2018-10-15 12:35:45,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:45,867 INFO L481 AbstractCegarLoop]: Abstraction has 165 states and 166 transitions. [2018-10-15 12:35:45,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-15 12:35:45,868 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 166 transitions. [2018-10-15 12:35:45,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-10-15 12:35:45,868 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:45,869 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:45,869 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:45,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:45,869 INFO L82 PathProgramCache]: Analyzing trace with hash 959269204, now seen corresponding path program 49 times [2018-10-15 12:35:45,870 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:45,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:46,039 INFO L134 CoverageAnalysis]: Checked inductivity of 3826 backedges. 199 proven. 1 refuted. 0 times theorem prover too weak. 3626 trivial. 0 not checked. [2018-10-15 12:35:46,039 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:46,039 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 12:35:46,039 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 12:35:46,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 12:35:46,040 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:46,040 INFO L87 Difference]: Start difference. First operand 165 states and 166 transitions. Second operand 5 states. [2018-10-15 12:35:46,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:46,064 INFO L93 Difference]: Finished difference Result 171 states and 174 transitions. [2018-10-15 12:35:46,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 12:35:46,065 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2018-10-15 12:35:46,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:46,068 INFO L225 Difference]: With dead ends: 171 [2018-10-15 12:35:46,068 INFO L226 Difference]: Without dead ends: 171 [2018-10-15 12:35:46,068 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2018-10-15 12:35:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-15 12:35:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 169. [2018-10-15 12:35:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-10-15 12:35:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 171 transitions. [2018-10-15 12:35:46,075 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 171 transitions. Word has length 164 [2018-10-15 12:35:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:46,075 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 171 transitions. [2018-10-15 12:35:46,075 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 12:35:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 171 transitions. [2018-10-15 12:35:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-10-15 12:35:46,076 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:46,076 INFO L375 BasicCegarLoop]: trace histogram [52, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:46,076 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:46,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:46,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1983475839, now seen corresponding path program 50 times [2018-10-15 12:35:46,077 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:46,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:46,728 INFO L134 CoverageAnalysis]: Checked inductivity of 3931 backedges. 573 proven. 21 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:46,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:46,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-15 12:35:46,729 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-15 12:35:46,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-15 12:35:46,729 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:35:46,730 INFO L87 Difference]: Start difference. First operand 169 states and 171 transitions. Second operand 8 states. [2018-10-15 12:35:47,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:47,264 INFO L93 Difference]: Finished difference Result 183 states and 189 transitions. [2018-10-15 12:35:47,264 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-15 12:35:47,264 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 168 [2018-10-15 12:35:47,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:47,266 INFO L225 Difference]: With dead ends: 183 [2018-10-15 12:35:47,266 INFO L226 Difference]: Without dead ends: 183 [2018-10-15 12:35:47,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-10-15 12:35:47,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-15 12:35:47,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2018-10-15 12:35:47,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-10-15 12:35:47,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 186 transitions. [2018-10-15 12:35:47,270 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 186 transitions. Word has length 168 [2018-10-15 12:35:47,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:47,270 INFO L481 AbstractCegarLoop]: Abstraction has 181 states and 186 transitions. [2018-10-15 12:35:47,270 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-15 12:35:47,271 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 186 transitions. [2018-10-15 12:35:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-10-15 12:35:47,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:47,272 INFO L375 BasicCegarLoop]: trace histogram [55, 50, 50, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:47,272 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:47,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash 1270322432, now seen corresponding path program 51 times [2018-10-15 12:35:47,273 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:47,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:47,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4270 backedges. 861 proven. 72 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:47,851 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:47,852 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 12:35:47,852 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 12:35:47,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 12:35:47,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:35:47,852 INFO L87 Difference]: Start difference. First operand 181 states and 186 transitions. Second operand 11 states. [2018-10-15 12:35:47,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:47,930 INFO L93 Difference]: Finished difference Result 195 states and 204 transitions. [2018-10-15 12:35:47,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 12:35:47,931 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 180 [2018-10-15 12:35:47,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:47,933 INFO L225 Difference]: With dead ends: 195 [2018-10-15 12:35:47,933 INFO L226 Difference]: Without dead ends: 195 [2018-10-15 12:35:47,933 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2018-10-15 12:35:47,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-15 12:35:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 193. [2018-10-15 12:35:47,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 12:35:47,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 201 transitions. [2018-10-15 12:35:47,939 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 201 transitions. Word has length 180 [2018-10-15 12:35:47,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:47,939 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 201 transitions. [2018-10-15 12:35:47,939 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 12:35:47,939 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 201 transitions. [2018-10-15 12:35:47,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 12:35:47,940 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:47,940 INFO L375 BasicCegarLoop]: trace histogram [58, 50, 50, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:47,941 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:47,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:47,942 INFO L82 PathProgramCache]: Analyzing trace with hash 1898315777, now seen corresponding path program 52 times [2018-10-15 12:35:47,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:47,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:48,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4645 backedges. 1149 proven. 159 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:48,493 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:48,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-15 12:35:48,494 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-15 12:35:48,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-15 12:35:48,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:35:48,494 INFO L87 Difference]: Start difference. First operand 193 states and 201 transitions. Second operand 14 states. [2018-10-15 12:35:48,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:48,593 INFO L93 Difference]: Finished difference Result 207 states and 219 transitions. [2018-10-15 12:35:48,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 12:35:48,594 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 192 [2018-10-15 12:35:48,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:48,596 INFO L225 Difference]: With dead ends: 207 [2018-10-15 12:35:48,596 INFO L226 Difference]: Without dead ends: 207 [2018-10-15 12:35:48,597 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-10-15 12:35:48,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-10-15 12:35:48,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 205. [2018-10-15 12:35:48,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-10-15 12:35:48,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 216 transitions. [2018-10-15 12:35:48,600 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 216 transitions. Word has length 192 [2018-10-15 12:35:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:48,601 INFO L481 AbstractCegarLoop]: Abstraction has 205 states and 216 transitions. [2018-10-15 12:35:48,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-15 12:35:48,601 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 216 transitions. [2018-10-15 12:35:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-10-15 12:35:48,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:48,602 INFO L375 BasicCegarLoop]: trace histogram [61, 50, 50, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:48,602 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:48,603 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:48,603 INFO L82 PathProgramCache]: Analyzing trace with hash -1815154302, now seen corresponding path program 53 times [2018-10-15 12:35:48,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:48,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:49,392 INFO L134 CoverageAnalysis]: Checked inductivity of 5056 backedges. 1437 proven. 282 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:49,393 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:49,393 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 12:35:49,393 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 12:35:49,393 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 12:35:49,393 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:35:49,394 INFO L87 Difference]: Start difference. First operand 205 states and 216 transitions. Second operand 17 states. [2018-10-15 12:35:49,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:49,481 INFO L93 Difference]: Finished difference Result 219 states and 234 transitions. [2018-10-15 12:35:49,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 12:35:49,481 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 204 [2018-10-15 12:35:49,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:49,483 INFO L225 Difference]: With dead ends: 219 [2018-10-15 12:35:49,483 INFO L226 Difference]: Without dead ends: 219 [2018-10-15 12:35:49,483 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2018-10-15 12:35:49,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-10-15 12:35:49,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 217. [2018-10-15 12:35:49,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-10-15 12:35:49,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 231 transitions. [2018-10-15 12:35:49,488 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 231 transitions. Word has length 204 [2018-10-15 12:35:49,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:49,489 INFO L481 AbstractCegarLoop]: Abstraction has 217 states and 231 transitions. [2018-10-15 12:35:49,489 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 12:35:49,489 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 231 transitions. [2018-10-15 12:35:49,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-10-15 12:35:49,490 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:49,491 INFO L375 BasicCegarLoop]: trace histogram [64, 50, 50, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:49,491 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:49,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:49,491 INFO L82 PathProgramCache]: Analyzing trace with hash -2086884989, now seen corresponding path program 54 times [2018-10-15 12:35:49,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:49,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:50,467 INFO L134 CoverageAnalysis]: Checked inductivity of 5503 backedges. 1725 proven. 441 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:50,467 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:50,467 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-15 12:35:50,468 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-15 12:35:50,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-15 12:35:50,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:50,468 INFO L87 Difference]: Start difference. First operand 217 states and 231 transitions. Second operand 20 states. [2018-10-15 12:35:50,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:50,625 INFO L93 Difference]: Finished difference Result 231 states and 249 transitions. [2018-10-15 12:35:50,627 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 12:35:50,627 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 216 [2018-10-15 12:35:50,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:50,629 INFO L225 Difference]: With dead ends: 231 [2018-10-15 12:35:50,629 INFO L226 Difference]: Without dead ends: 231 [2018-10-15 12:35:50,629 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-10-15 12:35:50,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-10-15 12:35:50,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2018-10-15 12:35:50,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-10-15 12:35:50,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 246 transitions. [2018-10-15 12:35:50,633 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 246 transitions. Word has length 216 [2018-10-15 12:35:50,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:50,634 INFO L481 AbstractCegarLoop]: Abstraction has 229 states and 246 transitions. [2018-10-15 12:35:50,634 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-15 12:35:50,634 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 246 transitions. [2018-10-15 12:35:50,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-10-15 12:35:50,635 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:50,635 INFO L375 BasicCegarLoop]: trace histogram [67, 50, 50, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:50,635 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:50,635 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:50,636 INFO L82 PathProgramCache]: Analyzing trace with hash 1125738500, now seen corresponding path program 55 times [2018-10-15 12:35:50,637 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:50,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:50,957 INFO L134 CoverageAnalysis]: Checked inductivity of 5986 backedges. 2013 proven. 636 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:50,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:50,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 12:35:50,958 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 12:35:50,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 12:35:50,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:50,958 INFO L87 Difference]: Start difference. First operand 229 states and 246 transitions. Second operand 23 states. [2018-10-15 12:35:51,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:51,090 INFO L93 Difference]: Finished difference Result 243 states and 264 transitions. [2018-10-15 12:35:51,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 12:35:51,091 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 228 [2018-10-15 12:35:51,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:51,093 INFO L225 Difference]: With dead ends: 243 [2018-10-15 12:35:51,093 INFO L226 Difference]: Without dead ends: 243 [2018-10-15 12:35:51,093 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2018-10-15 12:35:51,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-10-15 12:35:51,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 241. [2018-10-15 12:35:51,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-10-15 12:35:51,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 261 transitions. [2018-10-15 12:35:51,097 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 261 transitions. Word has length 228 [2018-10-15 12:35:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:51,097 INFO L481 AbstractCegarLoop]: Abstraction has 241 states and 261 transitions. [2018-10-15 12:35:51,097 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 12:35:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 261 transitions. [2018-10-15 12:35:51,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-10-15 12:35:51,099 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:51,099 INFO L375 BasicCegarLoop]: trace histogram [70, 50, 50, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:51,099 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:51,099 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:51,099 INFO L82 PathProgramCache]: Analyzing trace with hash 393178373, now seen corresponding path program 56 times [2018-10-15 12:35:51,100 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:51,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:51,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6505 backedges. 2301 proven. 867 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:51,448 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:51,448 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-15 12:35:51,448 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-15 12:35:51,448 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-15 12:35:51,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:51,449 INFO L87 Difference]: Start difference. First operand 241 states and 261 transitions. Second operand 26 states. [2018-10-15 12:35:51,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:51,689 INFO L93 Difference]: Finished difference Result 255 states and 279 transitions. [2018-10-15 12:35:51,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 12:35:51,689 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 240 [2018-10-15 12:35:51,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:51,692 INFO L225 Difference]: With dead ends: 255 [2018-10-15 12:35:51,692 INFO L226 Difference]: Without dead ends: 255 [2018-10-15 12:35:51,692 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-10-15 12:35:51,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-10-15 12:35:51,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 253. [2018-10-15 12:35:51,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 12:35:51,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 276 transitions. [2018-10-15 12:35:51,696 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 276 transitions. Word has length 240 [2018-10-15 12:35:51,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:51,697 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 276 transitions. [2018-10-15 12:35:51,697 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-15 12:35:51,697 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 276 transitions. [2018-10-15 12:35:51,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 12:35:51,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:51,698 INFO L375 BasicCegarLoop]: trace histogram [73, 50, 50, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:51,699 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:51,699 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:51,699 INFO L82 PathProgramCache]: Analyzing trace with hash -1737951098, now seen corresponding path program 57 times [2018-10-15 12:35:51,700 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:51,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:52,123 INFO L134 CoverageAnalysis]: Checked inductivity of 7060 backedges. 2589 proven. 1134 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:52,123 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:52,124 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 12:35:52,124 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 12:35:52,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 12:35:52,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:52,125 INFO L87 Difference]: Start difference. First operand 253 states and 276 transitions. Second operand 29 states. [2018-10-15 12:35:52,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:52,406 INFO L93 Difference]: Finished difference Result 267 states and 294 transitions. [2018-10-15 12:35:52,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 12:35:52,406 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 252 [2018-10-15 12:35:52,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:52,409 INFO L225 Difference]: With dead ends: 267 [2018-10-15 12:35:52,409 INFO L226 Difference]: Without dead ends: 267 [2018-10-15 12:35:52,409 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=406, Invalid=406, Unknown=0, NotChecked=0, Total=812 [2018-10-15 12:35:52,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-10-15 12:35:52,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 265. [2018-10-15 12:35:52,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-10-15 12:35:52,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 291 transitions. [2018-10-15 12:35:52,413 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 291 transitions. Word has length 252 [2018-10-15 12:35:52,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:52,413 INFO L481 AbstractCegarLoop]: Abstraction has 265 states and 291 transitions. [2018-10-15 12:35:52,413 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 12:35:52,414 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 291 transitions. [2018-10-15 12:35:52,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-10-15 12:35:52,415 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:52,415 INFO L375 BasicCegarLoop]: trace histogram [76, 50, 50, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:52,415 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:52,415 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:52,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1066382713, now seen corresponding path program 58 times [2018-10-15 12:35:52,416 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:52,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:53,218 INFO L134 CoverageAnalysis]: Checked inductivity of 7651 backedges. 2877 proven. 1437 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:53,218 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:53,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-15 12:35:53,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-15 12:35:53,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-15 12:35:53,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:53,219 INFO L87 Difference]: Start difference. First operand 265 states and 291 transitions. Second operand 32 states. [2018-10-15 12:35:53,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:53,448 INFO L93 Difference]: Finished difference Result 279 states and 309 transitions. [2018-10-15 12:35:53,449 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 12:35:53,449 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 264 [2018-10-15 12:35:53,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:53,451 INFO L225 Difference]: With dead ends: 279 [2018-10-15 12:35:53,451 INFO L226 Difference]: Without dead ends: 279 [2018-10-15 12:35:53,452 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-10-15 12:35:53,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2018-10-15 12:35:53,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2018-10-15 12:35:53,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-10-15 12:35:53,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 306 transitions. [2018-10-15 12:35:53,457 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 306 transitions. Word has length 264 [2018-10-15 12:35:53,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:53,457 INFO L481 AbstractCegarLoop]: Abstraction has 277 states and 306 transitions. [2018-10-15 12:35:53,457 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-15 12:35:53,457 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 306 transitions. [2018-10-15 12:35:53,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-10-15 12:35:53,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:53,459 INFO L375 BasicCegarLoop]: trace histogram [79, 50, 50, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:53,459 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:53,459 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:53,460 INFO L82 PathProgramCache]: Analyzing trace with hash -57695480, now seen corresponding path program 59 times [2018-10-15 12:35:53,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:53,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:54,051 INFO L134 CoverageAnalysis]: Checked inductivity of 8278 backedges. 3165 proven. 1776 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:54,051 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:54,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 12:35:54,052 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 12:35:54,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 12:35:54,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:54,052 INFO L87 Difference]: Start difference. First operand 277 states and 306 transitions. Second operand 35 states. [2018-10-15 12:35:54,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:54,428 INFO L93 Difference]: Finished difference Result 291 states and 324 transitions. [2018-10-15 12:35:54,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 12:35:54,428 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 276 [2018-10-15 12:35:54,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:54,431 INFO L225 Difference]: With dead ends: 291 [2018-10-15 12:35:54,431 INFO L226 Difference]: Without dead ends: 291 [2018-10-15 12:35:54,431 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=595, Invalid=595, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 12:35:54,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2018-10-15 12:35:54,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 289. [2018-10-15 12:35:54,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 289 states. [2018-10-15 12:35:54,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 321 transitions. [2018-10-15 12:35:54,436 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 321 transitions. Word has length 276 [2018-10-15 12:35:54,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:54,437 INFO L481 AbstractCegarLoop]: Abstraction has 289 states and 321 transitions. [2018-10-15 12:35:54,437 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 12:35:54,437 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 321 transitions. [2018-10-15 12:35:54,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2018-10-15 12:35:54,439 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:54,439 INFO L375 BasicCegarLoop]: trace histogram [82, 50, 50, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:54,439 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:54,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:54,439 INFO L82 PathProgramCache]: Analyzing trace with hash 1014055433, now seen corresponding path program 60 times [2018-10-15 12:35:54,440 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:55,171 INFO L134 CoverageAnalysis]: Checked inductivity of 8941 backedges. 3453 proven. 2151 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:55,171 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:55,171 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-15 12:35:55,171 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-15 12:35:55,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-15 12:35:55,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:55,172 INFO L87 Difference]: Start difference. First operand 289 states and 321 transitions. Second operand 38 states. [2018-10-15 12:35:55,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:55,734 INFO L93 Difference]: Finished difference Result 303 states and 339 transitions. [2018-10-15 12:35:55,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 12:35:55,735 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 288 [2018-10-15 12:35:55,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:55,736 INFO L225 Difference]: With dead ends: 303 [2018-10-15 12:35:55,736 INFO L226 Difference]: Without dead ends: 303 [2018-10-15 12:35:55,737 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-10-15 12:35:55,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states. [2018-10-15 12:35:55,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 301. [2018-10-15 12:35:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 301 states. [2018-10-15 12:35:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 301 states to 301 states and 336 transitions. [2018-10-15 12:35:55,741 INFO L78 Accepts]: Start accepts. Automaton has 301 states and 336 transitions. Word has length 288 [2018-10-15 12:35:55,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:55,742 INFO L481 AbstractCegarLoop]: Abstraction has 301 states and 336 transitions. [2018-10-15 12:35:55,742 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-15 12:35:55,742 INFO L276 IsEmpty]: Start isEmpty. Operand 301 states and 336 transitions. [2018-10-15 12:35:55,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2018-10-15 12:35:55,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:55,744 INFO L375 BasicCegarLoop]: trace histogram [85, 50, 50, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:55,744 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:55,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:55,744 INFO L82 PathProgramCache]: Analyzing trace with hash 39806858, now seen corresponding path program 61 times [2018-10-15 12:35:55,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:55,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:56,775 INFO L134 CoverageAnalysis]: Checked inductivity of 9640 backedges. 3741 proven. 2562 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:56,776 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:56,776 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 12:35:56,776 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 12:35:56,777 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 12:35:56,777 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:56,777 INFO L87 Difference]: Start difference. First operand 301 states and 336 transitions. Second operand 41 states. [2018-10-15 12:35:57,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:57,117 INFO L93 Difference]: Finished difference Result 315 states and 354 transitions. [2018-10-15 12:35:57,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 12:35:57,117 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 300 [2018-10-15 12:35:57,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:57,120 INFO L225 Difference]: With dead ends: 315 [2018-10-15 12:35:57,120 INFO L226 Difference]: Without dead ends: 315 [2018-10-15 12:35:57,121 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=820, Invalid=820, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 12:35:57,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2018-10-15 12:35:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 313. [2018-10-15 12:35:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 12:35:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 351 transitions. [2018-10-15 12:35:57,125 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 351 transitions. Word has length 300 [2018-10-15 12:35:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:57,126 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 351 transitions. [2018-10-15 12:35:57,126 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 12:35:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 351 transitions. [2018-10-15 12:35:57,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 12:35:57,127 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:57,128 INFO L375 BasicCegarLoop]: trace histogram [88, 50, 50, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:57,128 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:57,128 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:57,128 INFO L82 PathProgramCache]: Analyzing trace with hash 1933857675, now seen corresponding path program 62 times [2018-10-15 12:35:57,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:57,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:57,949 INFO L134 CoverageAnalysis]: Checked inductivity of 10375 backedges. 4029 proven. 3009 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:57,950 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:57,950 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-15 12:35:57,950 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-15 12:35:57,950 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-15 12:35:57,950 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:35:57,951 INFO L87 Difference]: Start difference. First operand 313 states and 351 transitions. Second operand 44 states. [2018-10-15 12:35:58,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:35:58,284 INFO L93 Difference]: Finished difference Result 327 states and 369 transitions. [2018-10-15 12:35:58,284 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 12:35:58,285 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 312 [2018-10-15 12:35:58,285 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:35:58,287 INFO L225 Difference]: With dead ends: 327 [2018-10-15 12:35:58,287 INFO L226 Difference]: Without dead ends: 327 [2018-10-15 12:35:58,288 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=946, Invalid=946, Unknown=0, NotChecked=0, Total=1892 [2018-10-15 12:35:58,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2018-10-15 12:35:58,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 325. [2018-10-15 12:35:58,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 325 states. [2018-10-15 12:35:58,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 366 transitions. [2018-10-15 12:35:58,292 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 366 transitions. Word has length 312 [2018-10-15 12:35:58,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:35:58,292 INFO L481 AbstractCegarLoop]: Abstraction has 325 states and 366 transitions. [2018-10-15 12:35:58,292 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-15 12:35:58,292 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 366 transitions. [2018-10-15 12:35:58,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2018-10-15 12:35:58,294 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:35:58,295 INFO L375 BasicCegarLoop]: trace histogram [91, 50, 50, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:35:58,295 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:35:58,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:35:58,295 INFO L82 PathProgramCache]: Analyzing trace with hash 1722435084, now seen corresponding path program 63 times [2018-10-15 12:35:58,296 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:35:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:35:59,860 INFO L134 CoverageAnalysis]: Checked inductivity of 11146 backedges. 4317 proven. 3492 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:35:59,860 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:35:59,860 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 12:35:59,860 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 12:35:59,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 12:35:59,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:35:59,861 INFO L87 Difference]: Start difference. First operand 325 states and 366 transitions. Second operand 47 states. [2018-10-15 12:36:00,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:00,240 INFO L93 Difference]: Finished difference Result 339 states and 384 transitions. [2018-10-15 12:36:00,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 12:36:00,240 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 324 [2018-10-15 12:36:00,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:00,241 INFO L225 Difference]: With dead ends: 339 [2018-10-15 12:36:00,241 INFO L226 Difference]: Without dead ends: 339 [2018-10-15 12:36:00,242 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1081, Invalid=1081, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 12:36:00,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2018-10-15 12:36:00,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 337. [2018-10-15 12:36:00,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 337 states. [2018-10-15 12:36:00,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 381 transitions. [2018-10-15 12:36:00,246 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 381 transitions. Word has length 324 [2018-10-15 12:36:00,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:00,247 INFO L481 AbstractCegarLoop]: Abstraction has 337 states and 381 transitions. [2018-10-15 12:36:00,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 12:36:00,247 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 381 transitions. [2018-10-15 12:36:00,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 337 [2018-10-15 12:36:00,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:00,249 INFO L375 BasicCegarLoop]: trace histogram [94, 50, 50, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:00,249 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:00,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:00,250 INFO L82 PathProgramCache]: Analyzing trace with hash 1991999245, now seen corresponding path program 64 times [2018-10-15 12:36:00,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:00,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:01,232 INFO L134 CoverageAnalysis]: Checked inductivity of 11953 backedges. 4605 proven. 4011 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:36:01,232 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:01,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-15 12:36:01,233 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-15 12:36:01,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-15 12:36:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:01,233 INFO L87 Difference]: Start difference. First operand 337 states and 381 transitions. Second operand 50 states. [2018-10-15 12:36:01,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:01,602 INFO L93 Difference]: Finished difference Result 351 states and 399 transitions. [2018-10-15 12:36:01,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 12:36:01,603 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 336 [2018-10-15 12:36:01,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:01,606 INFO L225 Difference]: With dead ends: 351 [2018-10-15 12:36:01,606 INFO L226 Difference]: Without dead ends: 351 [2018-10-15 12:36:01,607 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1225, Invalid=1225, Unknown=0, NotChecked=0, Total=2450 [2018-10-15 12:36:01,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2018-10-15 12:36:01,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2018-10-15 12:36:01,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 349 states. [2018-10-15 12:36:01,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 396 transitions. [2018-10-15 12:36:01,611 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 396 transitions. Word has length 336 [2018-10-15 12:36:01,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:01,611 INFO L481 AbstractCegarLoop]: Abstraction has 349 states and 396 transitions. [2018-10-15 12:36:01,611 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-15 12:36:01,612 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 396 transitions. [2018-10-15 12:36:01,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2018-10-15 12:36:01,613 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:01,614 INFO L375 BasicCegarLoop]: trace histogram [97, 50, 50, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:01,614 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:01,614 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:01,614 INFO L82 PathProgramCache]: Analyzing trace with hash 272776846, now seen corresponding path program 65 times [2018-10-15 12:36:01,615 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:01,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:02,849 INFO L134 CoverageAnalysis]: Checked inductivity of 12796 backedges. 4893 proven. 4566 refuted. 0 times theorem prover too weak. 3337 trivial. 0 not checked. [2018-10-15 12:36:02,850 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:02,850 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 12:36:02,850 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:36:02,850 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:36:02,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:36:02,851 INFO L87 Difference]: Start difference. First operand 349 states and 396 transitions. Second operand 53 states. [2018-10-15 12:36:03,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:03,317 INFO L93 Difference]: Finished difference Result 361 states and 411 transitions. [2018-10-15 12:36:03,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:36:03,324 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 348 [2018-10-15 12:36:03,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:03,326 INFO L225 Difference]: With dead ends: 361 [2018-10-15 12:36:03,326 INFO L226 Difference]: Without dead ends: 361 [2018-10-15 12:36:03,326 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:36:03,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2018-10-15 12:36:03,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 361. [2018-10-15 12:36:03,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-10-15 12:36:03,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 411 transitions. [2018-10-15 12:36:03,330 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 411 transitions. Word has length 348 [2018-10-15 12:36:03,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:03,331 INFO L481 AbstractCegarLoop]: Abstraction has 361 states and 411 transitions. [2018-10-15 12:36:03,331 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:36:03,331 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 411 transitions. [2018-10-15 12:36:03,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2018-10-15 12:36:03,333 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:03,333 INFO L375 BasicCegarLoop]: trace histogram [100, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:03,333 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:03,333 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:03,334 INFO L82 PathProgramCache]: Analyzing trace with hash -2102868849, now seen corresponding path program 66 times [2018-10-15 12:36:03,334 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:03,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:06,148 INFO L134 CoverageAnalysis]: Checked inductivity of 13675 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 3775 trivial. 0 not checked. [2018-10-15 12:36:06,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 12:36:06,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 12:36:06,149 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 12:36:06,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 12:36:06,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 12:36:06,149 INFO L87 Difference]: Start difference. First operand 361 states and 411 transitions. Second operand 55 states. [2018-10-15 12:36:08,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:08,161 INFO L93 Difference]: Finished difference Result 5717 states and 7092 transitions. [2018-10-15 12:36:08,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-15 12:36:08,162 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 360 [2018-10-15 12:36:08,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:08,184 INFO L225 Difference]: With dead ends: 5717 [2018-10-15 12:36:08,184 INFO L226 Difference]: Without dead ends: 5713 [2018-10-15 12:36:08,184 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=117, Invalid=3075, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 12:36:08,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5713 states. [2018-10-15 12:36:08,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5713 to 366. [2018-10-15 12:36:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 366 states. [2018-10-15 12:36:08,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 417 transitions. [2018-10-15 12:36:08,219 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 417 transitions. Word has length 360 [2018-10-15 12:36:08,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:08,220 INFO L481 AbstractCegarLoop]: Abstraction has 366 states and 417 transitions. [2018-10-15 12:36:08,220 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 12:36:08,220 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 417 transitions. [2018-10-15 12:36:08,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 365 [2018-10-15 12:36:08,223 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 12:36:08,223 INFO L375 BasicCegarLoop]: trace histogram [101, 51, 51, 51, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 12:36:08,223 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 12:36:08,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 12:36:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1388238394, now seen corresponding path program 67 times [2018-10-15 12:36:08,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 12:36:08,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 12:36:10,492 INFO L134 CoverageAnalysis]: Checked inductivity of 13976 backedges. 10201 proven. 0 refuted. 0 times theorem prover too weak. 3775 trivial. 0 not checked. [2018-10-15 12:36:10,493 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 12:36:10,493 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [53] imperfect sequences [] total 53 [2018-10-15 12:36:10,493 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 12:36:10,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 12:36:10,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:36:10,494 INFO L87 Difference]: Start difference. First operand 366 states and 417 transitions. Second operand 53 states. [2018-10-15 12:36:10,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 12:36:10,819 INFO L93 Difference]: Finished difference Result 355 states and 355 transitions. [2018-10-15 12:36:10,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 12:36:10,819 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 364 [2018-10-15 12:36:10,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 12:36:10,820 INFO L225 Difference]: With dead ends: 355 [2018-10-15 12:36:10,820 INFO L226 Difference]: Without dead ends: 0 [2018-10-15 12:36:10,821 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=1378, Invalid=1378, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 12:36:10,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-15 12:36:10,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-15 12:36:10,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-15 12:36:10,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-15 12:36:10,822 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 364 [2018-10-15 12:36:10,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 12:36:10,822 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-15 12:36:10,822 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 12:36:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-15 12:36:10,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-15 12:36:10,827 INFO L202 PluginConnector]: Adding new model gj2007_true-unreach-call_true-termination.c.i_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.10 12:36:10 BoogieIcfgContainer [2018-10-15 12:36:10,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-15 12:36:10,828 INFO L168 Benchmark]: Toolchain (without parser) took 71190.39 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 553.1 MB). Free memory was 1.5 GB in the beginning and 1.6 GB in the end (delta: -113.0 MB). Peak memory consumption was 440.2 MB. Max. memory is 7.1 GB. [2018-10-15 12:36:10,830 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:36:10,830 INFO L168 Benchmark]: Boogie Preprocessor took 59.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-15 12:36:10,831 INFO L168 Benchmark]: RCFGBuilder took 423.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-15 12:36:10,831 INFO L168 Benchmark]: TraceAbstraction took 70702.10 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 553.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.1 MB). Peak memory consumption was 419.0 MB. Max. memory is 7.1 GB. [2018-10-15 12:36:10,834 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.19 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 59.55 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 423.98 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70702.10 ms. Allocated memory was 1.5 GB in the beginning and 2.1 GB in the end (delta: 553.1 MB). Free memory was 1.4 GB in the beginning and 1.6 GB in the end (delta: -134.1 MB). Peak memory consumption was 419.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 31]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 70.6s OverallTime, 70 OverallIterations, 101 TraceHistogramMax, 20.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 1169 SDtfs, 2629 SDslu, 22995 SDs, 0 SdLazy, 13292 SolverSat, 730 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 15.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1982 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 1842 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 46.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=366occurred in iteration=69, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 70 MinimizatonAttempts, 5430 StatesRemovedByMinimization, 67 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 47.8s InterpolantComputationTime, 9399 NumberOfCodeBlocks, 9399 NumberOfCodeBlocksAsserted, 70 NumberOfCheckSat, 9329 ConstructedInterpolants, 0 QuantifiedInterpolants, 4586365 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 70 InterpolantComputations, 3 PerfectInterpolantSequences, 119973/217739 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007_true-unreach-call_true-termination.c.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-15_12-36-10-844.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/gj2007_true-unreach-call_true-termination.c.i_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-15_12-36-10-844.csv Received shutdown request...