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/20181010-MemSafetyPathprograms/memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-b8f97f7-m [2018-10-10 15:37:39,543 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-10 15:37:39,545 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-10 15:37:39,559 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-10 15:37:39,560 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-10 15:37:39,560 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-10 15:37:39,562 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-10 15:37:39,563 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-10 15:37:39,565 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-10 15:37:39,566 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-10 15:37:39,567 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-10 15:37:39,567 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-10 15:37:39,568 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-10 15:37:39,569 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-10 15:37:39,570 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-10 15:37:39,571 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-10 15:37:39,572 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-10 15:37:39,574 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-10 15:37:39,576 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-10 15:37:39,577 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-10 15:37:39,579 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-10 15:37:39,580 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-10 15:37:39,582 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-10 15:37:39,583 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-10 15:37:39,583 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-10 15:37:39,584 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-10 15:37:39,585 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-10 15:37:39,586 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-10 15:37:39,587 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-10 15:37:39,588 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-10 15:37:39,588 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-10 15:37:39,589 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-10 15:37:39,589 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-10 15:37:39,589 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-10 15:37:39,590 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-10 15:37:39,591 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-10 15:37:39,591 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-10 15:37:39,610 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-10 15:37:39,610 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-10 15:37:39,613 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-10 15:37:39,613 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-10 15:37:39,614 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-10 15:37:39,614 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-10 15:37:39,614 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-10 15:37:39,615 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-10 15:37:39,615 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-10 15:37:39,615 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-10 15:37:39,615 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-10 15:37:39,615 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-10 15:37:39,616 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-10 15:37:39,616 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-10 15:37:39,619 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-10 15:37:39,666 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-10 15:37:39,680 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-10 15:37:39,684 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-10 15:37:39,685 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-10 15:37:39,685 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-10 15:37:39,686 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 15:37:39,686 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl' [2018-10-10 15:37:39,740 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-10 15:37:39,741 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-10 15:37:39,742 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-10 15:37:39,742 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-10 15:37:39,742 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-10 15:37:39,768 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,769 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,785 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,787 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,788 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/1) ... [2018-10-10 15:37:39,790 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-10 15:37:39,791 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-10 15:37:39,791 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-10 15:37:39,791 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-10 15:37:39,792 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (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-10 15:37:39,868 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2018-10-10 15:37:39,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-10 15:37:39,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-10 15:37:40,408 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-10 15:37:40,409 INFO L202 PluginConnector]: Adding new model memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:37:40 BoogieIcfgContainer [2018-10-10 15:37:40,409 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-10 15:37:40,410 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-10 15:37:40,410 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-10 15:37:40,414 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-10 15:37:40,414 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 10.10 03:37:39" (1/2) ... [2018-10-10 15:37:40,416 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ee6448 and model type memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.10 03:37:40, skipping insertion in model container [2018-10-10 15:37:40,416 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.10 03:37:40" (2/2) ... [2018-10-10 15:37:40,418 INFO L112 eAbstractionObserver]: Analyzing ICFG memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl [2018-10-10 15:37:40,428 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-10 15:37:40,437 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-10 15:37:40,456 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-10 15:37:40,486 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-10 15:37:40,487 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-10 15:37:40,487 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-10 15:37:40,487 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-10 15:37:40,487 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-10 15:37:40,488 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-10 15:37:40,488 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-10 15:37:40,488 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-10 15:37:40,488 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-10 15:37:40,505 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states. [2018-10-10 15:37:40,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-10-10 15:37:40,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:40,516 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:40,517 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:40,523 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:40,524 INFO L82 PathProgramCache]: Analyzing trace with hash 180571921, now seen corresponding path program 1 times [2018-10-10 15:37:40,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:40,851 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-10 15:37:40,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:37:40,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-10-10 15:37:40,862 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-10-10 15:37:40,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-10-10 15:37:40,876 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:37:40,878 INFO L87 Difference]: Start difference. First operand 39 states. Second operand 4 states. [2018-10-10 15:37:40,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:40,985 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-10-10 15:37:40,985 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-10-10 15:37:40,987 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2018-10-10 15:37:40,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:40,999 INFO L225 Difference]: With dead ends: 39 [2018-10-10 15:37:40,999 INFO L226 Difference]: Without dead ends: 39 [2018-10-10 15:37:41,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2018-10-10 15:37:41,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-10-10 15:37:41,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2018-10-10 15:37:41,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2018-10-10 15:37:41,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2018-10-10 15:37:41,040 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 35 [2018-10-10 15:37:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:41,040 INFO L481 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2018-10-10 15:37:41,040 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-10-10 15:37:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2018-10-10 15:37:41,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-10-10 15:37:41,042 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:41,042 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:41,042 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:41,043 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:41,043 INFO L82 PathProgramCache]: Analyzing trace with hash 1856720466, now seen corresponding path program 1 times [2018-10-10 15:37:41,044 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:41,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:41,191 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-10 15:37:41,191 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:41,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-10 15:37:41,194 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-10 15:37:41,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-10 15:37:41,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-10-10 15:37:41,195 INFO L87 Difference]: Start difference. First operand 38 states and 38 transitions. Second operand 5 states. [2018-10-10 15:37:41,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:41,324 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-10-10 15:37:41,324 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-10 15:37:41,325 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2018-10-10 15:37:41,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:41,326 INFO L225 Difference]: With dead ends: 41 [2018-10-10 15:37:41,326 INFO L226 Difference]: Without dead ends: 41 [2018-10-10 15:37:41,327 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:37:41,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-10-10 15:37:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 40. [2018-10-10 15:37:41,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40 states. [2018-10-10 15:37:41,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 40 transitions. [2018-10-10 15:37:41,334 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 40 transitions. Word has length 37 [2018-10-10 15:37:41,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:41,334 INFO L481 AbstractCegarLoop]: Abstraction has 40 states and 40 transitions. [2018-10-10 15:37:41,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-10 15:37:41,335 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 40 transitions. [2018-10-10 15:37:41,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-10-10 15:37:41,336 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:41,336 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:41,337 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:41,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:41,337 INFO L82 PathProgramCache]: Analyzing trace with hash 2022736211, now seen corresponding path program 2 times [2018-10-10 15:37:41,338 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:41,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:41,565 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:41,566 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:41,566 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-10-10 15:37:41,566 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-10-10 15:37:41,567 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-10-10 15:37:41,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-10 15:37:41,567 INFO L87 Difference]: Start difference. First operand 40 states and 40 transitions. Second operand 6 states. [2018-10-10 15:37:41,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:41,788 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-10-10 15:37:41,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-10-10 15:37:41,791 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 39 [2018-10-10 15:37:41,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:41,792 INFO L225 Difference]: With dead ends: 43 [2018-10-10 15:37:41,792 INFO L226 Difference]: Without dead ends: 43 [2018-10-10 15:37:41,797 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:37:41,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-10-10 15:37:41,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2018-10-10 15:37:41,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2018-10-10 15:37:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 42 transitions. [2018-10-10 15:37:41,808 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 42 transitions. Word has length 39 [2018-10-10 15:37:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:41,809 INFO L481 AbstractCegarLoop]: Abstraction has 42 states and 42 transitions. [2018-10-10 15:37:41,809 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-10-10 15:37:41,810 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 42 transitions. [2018-10-10 15:37:41,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2018-10-10 15:37:41,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:41,814 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:41,816 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:41,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:41,817 INFO L82 PathProgramCache]: Analyzing trace with hash -1644890092, now seen corresponding path program 3 times [2018-10-10 15:37:41,818 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:41,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:42,031 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:42,032 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:42,032 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-10-10 15:37:42,032 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-10-10 15:37:42,033 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-10-10 15:37:42,033 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2018-10-10 15:37:42,034 INFO L87 Difference]: Start difference. First operand 42 states and 42 transitions. Second operand 7 states. [2018-10-10 15:37:42,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:42,184 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-10-10 15:37:42,193 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-10-10 15:37:42,194 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 41 [2018-10-10 15:37:42,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:42,195 INFO L225 Difference]: With dead ends: 45 [2018-10-10 15:37:42,195 INFO L226 Difference]: Without dead ends: 45 [2018-10-10 15:37:42,196 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:37:42,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-10-10 15:37:42,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-10-10 15:37:42,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-10-10 15:37:42,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-10-10 15:37:42,203 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 41 [2018-10-10 15:37:42,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:42,203 INFO L481 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-10-10 15:37:42,203 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-10-10 15:37:42,203 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-10-10 15:37:42,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2018-10-10 15:37:42,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:42,205 INFO L375 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:42,206 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:42,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:42,206 INFO L82 PathProgramCache]: Analyzing trace with hash -65617259, now seen corresponding path program 4 times [2018-10-10 15:37:42,207 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:42,317 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:42,317 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:42,318 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-10-10 15:37:42,318 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-10-10 15:37:42,318 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-10-10 15:37:42,319 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2018-10-10 15:37:42,319 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 8 states. [2018-10-10 15:37:42,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:42,805 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-10-10 15:37:42,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-10-10 15:37:42,807 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 43 [2018-10-10 15:37:42,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:42,808 INFO L225 Difference]: With dead ends: 47 [2018-10-10 15:37:42,808 INFO L226 Difference]: Without dead ends: 47 [2018-10-10 15:37:42,809 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=56, Invalid=76, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:37:42,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-10-10 15:37:42,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-10-10 15:37:42,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-10-10 15:37:42,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-10-10 15:37:42,815 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 43 [2018-10-10 15:37:42,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:42,816 INFO L481 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-10-10 15:37:42,816 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-10-10 15:37:42,816 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-10-10 15:37:42,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-10-10 15:37:42,817 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:42,817 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:42,818 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:42,818 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:42,818 INFO L82 PathProgramCache]: Analyzing trace with hash 1492119766, now seen corresponding path program 5 times [2018-10-10 15:37:42,819 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:43,014 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:43,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-10 15:37:43,014 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:37:43,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:37:43,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:37:43,015 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 9 states. [2018-10-10 15:37:43,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:43,194 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-10-10 15:37:43,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-10-10 15:37:43,197 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 45 [2018-10-10 15:37:43,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:43,198 INFO L225 Difference]: With dead ends: 49 [2018-10-10 15:37:43,198 INFO L226 Difference]: Without dead ends: 49 [2018-10-10 15:37:43,199 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=106, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:37:43,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-10-10 15:37:43,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 48. [2018-10-10 15:37:43,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2018-10-10 15:37:43,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 48 transitions. [2018-10-10 15:37:43,204 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 48 transitions. Word has length 45 [2018-10-10 15:37:43,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:43,205 INFO L481 AbstractCegarLoop]: Abstraction has 48 states and 48 transitions. [2018-10-10 15:37:43,205 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:37:43,205 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 48 transitions. [2018-10-10 15:37:43,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-10-10 15:37:43,206 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:43,206 INFO L375 BasicCegarLoop]: trace histogram [6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:43,207 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:43,207 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:43,207 INFO L82 PathProgramCache]: Analyzing trace with hash -466185513, now seen corresponding path program 6 times [2018-10-10 15:37:43,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:43,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:43,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:43,369 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:43,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-10-10 15:37:43,370 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-10-10 15:37:43,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-10-10 15:37:43,370 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2018-10-10 15:37:43,371 INFO L87 Difference]: Start difference. First operand 48 states and 48 transitions. Second operand 10 states. [2018-10-10 15:37:43,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:43,545 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-10-10 15:37:43,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-10-10 15:37:43,548 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 47 [2018-10-10 15:37:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:43,549 INFO L225 Difference]: With dead ends: 51 [2018-10-10 15:37:43,549 INFO L226 Difference]: Without dead ends: 51 [2018-10-10 15:37:43,549 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=141, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:37:43,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-10-10 15:37:43,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2018-10-10 15:37:43,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2018-10-10 15:37:43,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 50 transitions. [2018-10-10 15:37:43,554 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 50 transitions. Word has length 47 [2018-10-10 15:37:43,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:43,555 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 50 transitions. [2018-10-10 15:37:43,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-10-10 15:37:43,555 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 50 transitions. [2018-10-10 15:37:43,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-10-10 15:37:43,556 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:43,556 INFO L375 BasicCegarLoop]: trace histogram [7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:43,556 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:43,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:43,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1201882984, now seen corresponding path program 7 times [2018-10-10 15:37:43,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:43,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:43,767 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:43,768 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:43,768 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-10 15:37:43,768 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-10 15:37:43,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-10 15:37:43,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=62, Unknown=0, NotChecked=0, Total=110 [2018-10-10 15:37:43,769 INFO L87 Difference]: Start difference. First operand 50 states and 50 transitions. Second operand 11 states. [2018-10-10 15:37:44,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:44,223 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-10-10 15:37:44,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-10 15:37:44,224 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-10-10 15:37:44,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:44,226 INFO L225 Difference]: With dead ends: 53 [2018-10-10 15:37:44,226 INFO L226 Difference]: Without dead ends: 53 [2018-10-10 15:37:44,227 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:37:44,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-10-10 15:37:44,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 52. [2018-10-10 15:37:44,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2018-10-10 15:37:44,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2018-10-10 15:37:44,231 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 49 [2018-10-10 15:37:44,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:44,231 INFO L481 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2018-10-10 15:37:44,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-10 15:37:44,232 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2018-10-10 15:37:44,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2018-10-10 15:37:44,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:44,233 INFO L375 BasicCegarLoop]: trace histogram [8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:44,233 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:44,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:44,234 INFO L82 PathProgramCache]: Analyzing trace with hash 462451225, now seen corresponding path program 8 times [2018-10-10 15:37:44,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:44,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:44,399 INFO L134 CoverageAnalysis]: Checked inductivity of 64 backedges. 0 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:44,399 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:44,400 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-10-10 15:37:44,400 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-10-10 15:37:44,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-10-10 15:37:44,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=74, Unknown=0, NotChecked=0, Total=132 [2018-10-10 15:37:44,401 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 12 states. [2018-10-10 15:37:44,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:44,573 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-10-10 15:37:44,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-10-10 15:37:44,581 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 51 [2018-10-10 15:37:44,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:44,582 INFO L225 Difference]: With dead ends: 55 [2018-10-10 15:37:44,582 INFO L226 Difference]: Without dead ends: 55 [2018-10-10 15:37:44,583 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=154, Invalid=226, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:37:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-10-10 15:37:44,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-10-10 15:37:44,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-10-10 15:37:44,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-10-10 15:37:44,593 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 51 [2018-10-10 15:37:44,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:44,593 INFO L481 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-10-10 15:37:44,593 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-10-10 15:37:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-10-10 15:37:44,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-10-10 15:37:44,595 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:44,595 INFO L375 BasicCegarLoop]: trace histogram [9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:44,595 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:44,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:44,596 INFO L82 PathProgramCache]: Analyzing trace with hash -2135175334, now seen corresponding path program 9 times [2018-10-10 15:37:44,596 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:44,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:44,922 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 81 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:44,922 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:44,922 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-10 15:37:44,923 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-10 15:37:44,923 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-10 15:37:44,923 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=87, Unknown=0, NotChecked=0, Total=156 [2018-10-10 15:37:44,923 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 13 states. [2018-10-10 15:37:45,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:45,117 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-10-10 15:37:45,117 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:37:45,117 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 53 [2018-10-10 15:37:45,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:45,118 INFO L225 Difference]: With dead ends: 57 [2018-10-10 15:37:45,118 INFO L226 Difference]: Without dead ends: 57 [2018-10-10 15:37:45,119 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=186, Invalid=276, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:37:45,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-10-10 15:37:45,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-10-10 15:37:45,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-10-10 15:37:45,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-10-10 15:37:45,123 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 53 [2018-10-10 15:37:45,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:45,124 INFO L481 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-10-10 15:37:45,124 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-10 15:37:45,124 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-10-10 15:37:45,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-10-10 15:37:45,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:45,125 INFO L375 BasicCegarLoop]: trace histogram [10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:45,126 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:45,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:45,126 INFO L82 PathProgramCache]: Analyzing trace with hash 1216667739, now seen corresponding path program 10 times [2018-10-10 15:37:45,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:45,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:45,314 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:45,314 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:45,314 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-10-10 15:37:45,315 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-10-10 15:37:45,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-10-10 15:37:45,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=101, Unknown=0, NotChecked=0, Total=182 [2018-10-10 15:37:45,315 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 14 states. [2018-10-10 15:37:45,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:45,592 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-10-10 15:37:45,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-10 15:37:45,601 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 55 [2018-10-10 15:37:45,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:45,602 INFO L225 Difference]: With dead ends: 59 [2018-10-10 15:37:45,602 INFO L226 Difference]: Without dead ends: 59 [2018-10-10 15:37:45,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=221, Invalid=331, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:37:45,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-10-10 15:37:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 58. [2018-10-10 15:37:45,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58 states. [2018-10-10 15:37:45,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2018-10-10 15:37:45,609 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 55 [2018-10-10 15:37:45,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:45,610 INFO L481 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2018-10-10 15:37:45,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-10-10 15:37:45,610 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2018-10-10 15:37:45,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-10-10 15:37:45,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:45,611 INFO L375 BasicCegarLoop]: trace histogram [11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:45,611 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:45,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:45,612 INFO L82 PathProgramCache]: Analyzing trace with hash 1112388892, now seen corresponding path program 11 times [2018-10-10 15:37:45,613 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:45,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:45,870 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 0 proven. 121 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:45,871 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:45,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-10 15:37:45,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-10 15:37:45,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-10 15:37:45,872 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=116, Unknown=0, NotChecked=0, Total=210 [2018-10-10 15:37:45,872 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand 15 states. [2018-10-10 15:37:46,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:46,409 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-10-10 15:37:46,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-10-10 15:37:46,409 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 57 [2018-10-10 15:37:46,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:46,410 INFO L225 Difference]: With dead ends: 61 [2018-10-10 15:37:46,410 INFO L226 Difference]: Without dead ends: 61 [2018-10-10 15:37:46,411 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=259, Invalid=391, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:37:46,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-10-10 15:37:46,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 60. [2018-10-10 15:37:46,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-10-10 15:37:46,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2018-10-10 15:37:46,415 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 57 [2018-10-10 15:37:46,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:46,416 INFO L481 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2018-10-10 15:37:46,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-10 15:37:46,416 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2018-10-10 15:37:46,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-10-10 15:37:46,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:46,419 INFO L375 BasicCegarLoop]: trace histogram [12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:46,419 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:46,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:46,419 INFO L82 PathProgramCache]: Analyzing trace with hash -315335267, now seen corresponding path program 12 times [2018-10-10 15:37:46,420 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:46,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:46,797 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 0 proven. 144 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:46,798 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:46,798 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-10-10 15:37:46,798 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-10-10 15:37:46,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-10-10 15:37:46,799 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=108, Invalid=132, Unknown=0, NotChecked=0, Total=240 [2018-10-10 15:37:46,799 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 16 states. [2018-10-10 15:37:47,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:47,166 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-10-10 15:37:47,167 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-10-10 15:37:47,167 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 59 [2018-10-10 15:37:47,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:47,168 INFO L225 Difference]: With dead ends: 63 [2018-10-10 15:37:47,168 INFO L226 Difference]: Without dead ends: 63 [2018-10-10 15:37:47,169 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=300, Invalid=456, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:37:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-10-10 15:37:47,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2018-10-10 15:37:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2018-10-10 15:37:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 62 transitions. [2018-10-10 15:37:47,173 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 62 transitions. Word has length 59 [2018-10-10 15:37:47,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:47,174 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 62 transitions. [2018-10-10 15:37:47,174 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-10-10 15:37:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 62 transitions. [2018-10-10 15:37:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-10-10 15:37:47,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:47,175 INFO L375 BasicCegarLoop]: trace histogram [13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:47,175 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:47,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:47,176 INFO L82 PathProgramCache]: Analyzing trace with hash 2031282654, now seen corresponding path program 13 times [2018-10-10 15:37:47,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:47,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:47,412 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 0 proven. 169 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:47,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:47,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-10 15:37:47,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-10 15:37:47,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-10 15:37:47,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=149, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:37:47,413 INFO L87 Difference]: Start difference. First operand 62 states and 62 transitions. Second operand 17 states. [2018-10-10 15:37:47,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:47,890 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-10-10 15:37:47,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-10 15:37:47,890 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 61 [2018-10-10 15:37:47,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:47,891 INFO L225 Difference]: With dead ends: 65 [2018-10-10 15:37:47,891 INFO L226 Difference]: Without dead ends: 65 [2018-10-10 15:37:47,892 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=344, Invalid=526, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:37:47,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-10-10 15:37:47,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-10-10 15:37:47,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-10-10 15:37:47,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-10-10 15:37:47,896 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 61 [2018-10-10 15:37:47,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:47,896 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-10-10 15:37:47,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-10 15:37:47,896 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-10-10 15:37:47,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2018-10-10 15:37:47,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:47,897 INFO L375 BasicCegarLoop]: trace histogram [14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:47,898 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:47,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:47,898 INFO L82 PathProgramCache]: Analyzing trace with hash -2021692961, now seen corresponding path program 14 times [2018-10-10 15:37:47,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:47,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:48,717 INFO L134 CoverageAnalysis]: Checked inductivity of 196 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:48,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:48,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-10-10 15:37:48,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-10-10 15:37:48,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-10-10 15:37:48,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=167, Unknown=0, NotChecked=0, Total=306 [2018-10-10 15:37:48,719 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 18 states. [2018-10-10 15:37:48,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:48,993 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-10-10 15:37:48,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-10-10 15:37:48,993 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 63 [2018-10-10 15:37:48,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:48,994 INFO L225 Difference]: With dead ends: 67 [2018-10-10 15:37:48,994 INFO L226 Difference]: Without dead ends: 67 [2018-10-10 15:37:48,995 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=391, Invalid=601, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:37:48,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-10-10 15:37:48,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-10-10 15:37:49,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-10-10 15:37:49,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-10-10 15:37:49,000 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 63 [2018-10-10 15:37:49,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:49,001 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-10-10 15:37:49,001 INFO L482 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-10-10 15:37:49,001 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-10-10 15:37:49,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-10-10 15:37:49,002 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:49,002 INFO L375 BasicCegarLoop]: trace histogram [15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:49,002 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:49,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:49,003 INFO L82 PathProgramCache]: Analyzing trace with hash -1395921504, now seen corresponding path program 15 times [2018-10-10 15:37:49,003 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:49,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:49,571 INFO L134 CoverageAnalysis]: Checked inductivity of 225 backedges. 0 proven. 225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:49,571 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:49,572 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-10 15:37:49,572 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-10 15:37:49,572 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-10 15:37:49,572 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=156, Invalid=186, Unknown=0, NotChecked=0, Total=342 [2018-10-10 15:37:49,573 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 19 states. [2018-10-10 15:37:49,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:49,974 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-10-10 15:37:49,975 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-10-10 15:37:49,975 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 65 [2018-10-10 15:37:49,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:49,976 INFO L225 Difference]: With dead ends: 69 [2018-10-10 15:37:49,977 INFO L226 Difference]: Without dead ends: 69 [2018-10-10 15:37:49,978 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=441, Invalid=681, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:37:49,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-10-10 15:37:49,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2018-10-10 15:37:49,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2018-10-10 15:37:49,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2018-10-10 15:37:49,982 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 65 [2018-10-10 15:37:49,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:49,983 INFO L481 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2018-10-10 15:37:49,983 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-10 15:37:49,983 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2018-10-10 15:37:49,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-10-10 15:37:49,984 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:49,984 INFO L375 BasicCegarLoop]: trace histogram [16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:49,984 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:49,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:49,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1324972767, now seen corresponding path program 16 times [2018-10-10 15:37:49,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:49,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:50,258 INFO L134 CoverageAnalysis]: Checked inductivity of 256 backedges. 0 proven. 256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:50,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:50,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-10-10 15:37:50,259 INFO L460 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-10-10 15:37:50,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-10-10 15:37:50,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=206, Unknown=0, NotChecked=0, Total=380 [2018-10-10 15:37:50,259 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 20 states. [2018-10-10 15:37:50,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:50,604 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-10-10 15:37:50,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-10 15:37:50,604 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 67 [2018-10-10 15:37:50,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:50,605 INFO L225 Difference]: With dead ends: 71 [2018-10-10 15:37:50,605 INFO L226 Difference]: Without dead ends: 71 [2018-10-10 15:37:50,606 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=494, Invalid=766, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:37:50,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-10-10 15:37:50,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 70. [2018-10-10 15:37:50,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2018-10-10 15:37:50,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 70 transitions. [2018-10-10 15:37:50,610 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 70 transitions. Word has length 67 [2018-10-10 15:37:50,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:50,610 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 70 transitions. [2018-10-10 15:37:50,610 INFO L482 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-10-10 15:37:50,610 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 70 transitions. [2018-10-10 15:37:50,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-10-10 15:37:50,611 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:50,611 INFO L375 BasicCegarLoop]: trace histogram [17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:50,611 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:50,612 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:50,612 INFO L82 PathProgramCache]: Analyzing trace with hash -1862713246, now seen corresponding path program 17 times [2018-10-10 15:37:50,612 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:50,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 289 backedges. 0 proven. 289 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:50,909 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:50,910 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-10 15:37:50,910 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-10 15:37:50,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-10 15:37:50,911 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=227, Unknown=0, NotChecked=0, Total=420 [2018-10-10 15:37:50,911 INFO L87 Difference]: Start difference. First operand 70 states and 70 transitions. Second operand 21 states. [2018-10-10 15:37:51,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:51,340 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-10-10 15:37:51,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-10-10 15:37:51,342 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 69 [2018-10-10 15:37:51,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:51,343 INFO L225 Difference]: With dead ends: 73 [2018-10-10 15:37:51,343 INFO L226 Difference]: Without dead ends: 73 [2018-10-10 15:37:51,345 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=550, Invalid=856, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:37:51,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-10-10 15:37:51,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 72. [2018-10-10 15:37:51,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72 states. [2018-10-10 15:37:51,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 72 transitions. [2018-10-10 15:37:51,348 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 72 transitions. Word has length 69 [2018-10-10 15:37:51,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:51,348 INFO L481 AbstractCegarLoop]: Abstraction has 72 states and 72 transitions. [2018-10-10 15:37:51,348 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-10 15:37:51,348 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 72 transitions. [2018-10-10 15:37:51,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2018-10-10 15:37:51,349 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:51,349 INFO L375 BasicCegarLoop]: trace histogram [18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:51,349 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:51,350 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:51,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1059729251, now seen corresponding path program 18 times [2018-10-10 15:37:51,350 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:51,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:51,969 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 0 proven. 324 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:51,970 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:51,970 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-10-10 15:37:51,970 INFO L460 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-10-10 15:37:51,971 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-10-10 15:37:51,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=249, Unknown=0, NotChecked=0, Total=462 [2018-10-10 15:37:51,971 INFO L87 Difference]: Start difference. First operand 72 states and 72 transitions. Second operand 22 states. [2018-10-10 15:37:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:52,411 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-10-10 15:37:52,411 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-10-10 15:37:52,411 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 71 [2018-10-10 15:37:52,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:52,412 INFO L225 Difference]: With dead ends: 75 [2018-10-10 15:37:52,412 INFO L226 Difference]: Without dead ends: 75 [2018-10-10 15:37:52,413 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=609, Invalid=951, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:37:52,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-10-10 15:37:52,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-10-10 15:37:52,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-10-10 15:37:52,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-10-10 15:37:52,416 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 71 [2018-10-10 15:37:52,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:52,416 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-10-10 15:37:52,416 INFO L482 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-10-10 15:37:52,417 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-10-10 15:37:52,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2018-10-10 15:37:52,417 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:52,418 INFO L375 BasicCegarLoop]: trace histogram [19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:52,418 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:52,418 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:52,418 INFO L82 PathProgramCache]: Analyzing trace with hash 618357284, now seen corresponding path program 19 times [2018-10-10 15:37:52,419 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:52,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:53,116 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 0 proven. 361 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:53,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:53,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-10 15:37:53,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-10 15:37:53,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-10 15:37:53,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=234, Invalid=272, Unknown=0, NotChecked=0, Total=506 [2018-10-10 15:37:53,118 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 23 states. [2018-10-10 15:37:53,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:53,535 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-10-10 15:37:53,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-10 15:37:53,536 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 73 [2018-10-10 15:37:53,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:53,537 INFO L225 Difference]: With dead ends: 77 [2018-10-10 15:37:53,537 INFO L226 Difference]: Without dead ends: 77 [2018-10-10 15:37:53,539 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=671, Invalid=1051, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:37:53,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-10-10 15:37:53,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-10-10 15:37:53,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-10-10 15:37:53,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-10-10 15:37:53,542 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 73 [2018-10-10 15:37:53,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:53,542 INFO L481 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-10-10 15:37:53,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-10 15:37:53,542 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-10-10 15:37:53,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-10-10 15:37:53,543 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:53,543 INFO L375 BasicCegarLoop]: trace histogram [20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:53,543 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:53,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:53,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1661659301, now seen corresponding path program 20 times [2018-10-10 15:37:53,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:53,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:54,146 INFO L134 CoverageAnalysis]: Checked inductivity of 400 backedges. 0 proven. 400 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:54,147 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:54,147 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-10-10 15:37:54,147 INFO L460 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-10-10 15:37:54,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-10-10 15:37:54,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=256, Invalid=296, Unknown=0, NotChecked=0, Total=552 [2018-10-10 15:37:54,148 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 24 states. [2018-10-10 15:37:54,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:54,554 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-10-10 15:37:54,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-10-10 15:37:54,555 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 75 [2018-10-10 15:37:54,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:54,556 INFO L225 Difference]: With dead ends: 79 [2018-10-10 15:37:54,556 INFO L226 Difference]: Without dead ends: 79 [2018-10-10 15:37:54,557 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=736, Invalid=1156, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:37:54,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-10-10 15:37:54,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 78. [2018-10-10 15:37:54,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-10-10 15:37:54,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 78 transitions. [2018-10-10 15:37:54,559 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 78 transitions. Word has length 75 [2018-10-10 15:37:54,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:54,560 INFO L481 AbstractCegarLoop]: Abstraction has 78 states and 78 transitions. [2018-10-10 15:37:54,560 INFO L482 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-10-10 15:37:54,560 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 78 transitions. [2018-10-10 15:37:54,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-10-10 15:37:54,560 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:54,560 INFO L375 BasicCegarLoop]: trace histogram [21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:54,561 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:54,561 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:54,561 INFO L82 PathProgramCache]: Analyzing trace with hash -747449626, now seen corresponding path program 21 times [2018-10-10 15:37:54,562 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:54,924 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 441 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:54,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:54,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-10 15:37:54,925 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-10 15:37:54,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-10 15:37:54,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=279, Invalid=321, Unknown=0, NotChecked=0, Total=600 [2018-10-10 15:37:54,926 INFO L87 Difference]: Start difference. First operand 78 states and 78 transitions. Second operand 25 states. [2018-10-10 15:37:55,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:55,388 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-10-10 15:37:55,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-10-10 15:37:55,392 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 77 [2018-10-10 15:37:55,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:55,393 INFO L225 Difference]: With dead ends: 81 [2018-10-10 15:37:55,393 INFO L226 Difference]: Without dead ends: 81 [2018-10-10 15:37:55,394 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=804, Invalid=1266, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:37:55,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-10-10 15:37:55,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 80. [2018-10-10 15:37:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80 states. [2018-10-10 15:37:55,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 80 transitions. [2018-10-10 15:37:55,396 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 80 transitions. Word has length 77 [2018-10-10 15:37:55,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:55,397 INFO L481 AbstractCegarLoop]: Abstraction has 80 states and 80 transitions. [2018-10-10 15:37:55,397 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-10 15:37:55,397 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 80 transitions. [2018-10-10 15:37:55,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-10-10 15:37:55,397 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:55,397 INFO L375 BasicCegarLoop]: trace histogram [22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:55,398 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:55,398 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:55,398 INFO L82 PathProgramCache]: Analyzing trace with hash -913755929, now seen corresponding path program 22 times [2018-10-10 15:37:55,399 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:55,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:55,759 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 0 proven. 484 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:55,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:55,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-10-10 15:37:55,760 INFO L460 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-10-10 15:37:55,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-10-10 15:37:55,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=303, Invalid=347, Unknown=0, NotChecked=0, Total=650 [2018-10-10 15:37:55,761 INFO L87 Difference]: Start difference. First operand 80 states and 80 transitions. Second operand 26 states. [2018-10-10 15:37:56,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:56,304 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-10-10 15:37:56,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-10 15:37:56,304 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 79 [2018-10-10 15:37:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:56,305 INFO L225 Difference]: With dead ends: 83 [2018-10-10 15:37:56,305 INFO L226 Difference]: Without dead ends: 83 [2018-10-10 15:37:56,306 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 253 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=875, Invalid=1381, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:37:56,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-10-10 15:37:56,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 82. [2018-10-10 15:37:56,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 82 states. [2018-10-10 15:37:56,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 82 transitions. [2018-10-10 15:37:56,308 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 82 transitions. Word has length 79 [2018-10-10 15:37:56,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:56,308 INFO L481 AbstractCegarLoop]: Abstraction has 82 states and 82 transitions. [2018-10-10 15:37:56,308 INFO L482 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-10-10 15:37:56,309 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 82 transitions. [2018-10-10 15:37:56,309 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-10-10 15:37:56,309 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:56,309 INFO L375 BasicCegarLoop]: trace histogram [23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:56,310 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:56,310 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:56,310 INFO L82 PathProgramCache]: Analyzing trace with hash -1820323160, now seen corresponding path program 23 times [2018-10-10 15:37:56,311 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:57,165 INFO L134 CoverageAnalysis]: Checked inductivity of 529 backedges. 0 proven. 529 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:57,166 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:57,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-10 15:37:57,166 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-10 15:37:57,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-10 15:37:57,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=328, Invalid=374, Unknown=0, NotChecked=0, Total=702 [2018-10-10 15:37:57,167 INFO L87 Difference]: Start difference. First operand 82 states and 82 transitions. Second operand 27 states. [2018-10-10 15:37:57,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:57,737 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-10-10 15:37:57,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-10-10 15:37:57,737 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 81 [2018-10-10 15:37:57,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:57,738 INFO L225 Difference]: With dead ends: 85 [2018-10-10 15:37:57,738 INFO L226 Difference]: Without dead ends: 85 [2018-10-10 15:37:57,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 276 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=949, Invalid=1501, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:37:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-10-10 15:37:57,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-10-10 15:37:57,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-10-10 15:37:57,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-10-10 15:37:57,742 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 81 [2018-10-10 15:37:57,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:57,743 INFO L481 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-10-10 15:37:57,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-10 15:37:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-10-10 15:37:57,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2018-10-10 15:37:57,743 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:57,743 INFO L375 BasicCegarLoop]: trace histogram [24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:57,744 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:57,744 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:57,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1153071063, now seen corresponding path program 24 times [2018-10-10 15:37:57,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:57,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:58,127 INFO L134 CoverageAnalysis]: Checked inductivity of 576 backedges. 0 proven. 576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:58,128 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:58,128 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-10-10 15:37:58,128 INFO L460 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-10-10 15:37:58,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-10-10 15:37:58,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=354, Invalid=402, Unknown=0, NotChecked=0, Total=756 [2018-10-10 15:37:58,129 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 28 states. [2018-10-10 15:37:58,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:58,731 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-10-10 15:37:58,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-10-10 15:37:58,731 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 83 [2018-10-10 15:37:58,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:58,732 INFO L225 Difference]: With dead ends: 87 [2018-10-10 15:37:58,732 INFO L226 Difference]: Without dead ends: 87 [2018-10-10 15:37:58,733 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1026, Invalid=1626, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:37:58,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-10-10 15:37:58,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-10-10 15:37:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-10-10 15:37:58,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-10-10 15:37:58,736 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 83 [2018-10-10 15:37:58,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:58,736 INFO L481 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-10-10 15:37:58,736 INFO L482 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-10-10 15:37:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-10-10 15:37:58,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-10-10 15:37:58,737 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:58,737 INFO L375 BasicCegarLoop]: trace histogram [25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:58,737 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:58,738 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:58,738 INFO L82 PathProgramCache]: Analyzing trace with hash 126067050, now seen corresponding path program 25 times [2018-10-10 15:37:58,738 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:37:59,143 INFO L134 CoverageAnalysis]: Checked inductivity of 625 backedges. 0 proven. 625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:37:59,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:37:59,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-10 15:37:59,143 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-10 15:37:59,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-10 15:37:59,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=381, Invalid=431, Unknown=0, NotChecked=0, Total=812 [2018-10-10 15:37:59,144 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 29 states. [2018-10-10 15:37:59,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:37:59,819 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-10-10 15:37:59,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-10 15:37:59,826 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 85 [2018-10-10 15:37:59,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:37:59,826 INFO L225 Difference]: With dead ends: 89 [2018-10-10 15:37:59,826 INFO L226 Difference]: Without dead ends: 89 [2018-10-10 15:37:59,827 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 325 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1106, Invalid=1756, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:37:59,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-10-10 15:37:59,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 88. [2018-10-10 15:37:59,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 88 states. [2018-10-10 15:37:59,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 88 transitions. [2018-10-10 15:37:59,829 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 88 transitions. Word has length 85 [2018-10-10 15:37:59,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:37:59,829 INFO L481 AbstractCegarLoop]: Abstraction has 88 states and 88 transitions. [2018-10-10 15:37:59,829 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-10 15:37:59,829 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 88 transitions. [2018-10-10 15:37:59,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-10-10 15:37:59,830 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:37:59,830 INFO L375 BasicCegarLoop]: trace histogram [26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:37:59,830 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:37:59,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:37:59,830 INFO L82 PathProgramCache]: Analyzing trace with hash 1017146987, now seen corresponding path program 26 times [2018-10-10 15:37:59,831 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:37:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:00,278 INFO L134 CoverageAnalysis]: Checked inductivity of 676 backedges. 0 proven. 676 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:00,278 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:00,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-10-10 15:38:00,278 INFO L460 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-10-10 15:38:00,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-10-10 15:38:00,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=409, Invalid=461, Unknown=0, NotChecked=0, Total=870 [2018-10-10 15:38:00,279 INFO L87 Difference]: Start difference. First operand 88 states and 88 transitions. Second operand 30 states. [2018-10-10 15:38:00,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:00,941 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-10-10 15:38:00,941 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-10-10 15:38:00,941 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 87 [2018-10-10 15:38:00,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:00,942 INFO L225 Difference]: With dead ends: 91 [2018-10-10 15:38:00,942 INFO L226 Difference]: Without dead ends: 91 [2018-10-10 15:38:00,944 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=1189, Invalid=1891, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:38:00,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-10-10 15:38:00,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2018-10-10 15:38:00,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90 states. [2018-10-10 15:38:00,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 90 transitions. [2018-10-10 15:38:00,946 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 90 transitions. Word has length 87 [2018-10-10 15:38:00,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:00,946 INFO L481 AbstractCegarLoop]: Abstraction has 90 states and 90 transitions. [2018-10-10 15:38:00,946 INFO L482 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-10-10 15:38:00,946 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 90 transitions. [2018-10-10 15:38:00,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-10-10 15:38:00,947 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:00,947 INFO L375 BasicCegarLoop]: trace histogram [27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:00,947 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:00,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:00,947 INFO L82 PathProgramCache]: Analyzing trace with hash -1648492756, now seen corresponding path program 27 times [2018-10-10 15:38:00,948 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:00,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:01,614 INFO L134 CoverageAnalysis]: Checked inductivity of 729 backedges. 0 proven. 729 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:01,614 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:01,614 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-10 15:38:01,614 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-10 15:38:01,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-10 15:38:01,615 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=438, Invalid=492, Unknown=0, NotChecked=0, Total=930 [2018-10-10 15:38:01,615 INFO L87 Difference]: Start difference. First operand 90 states and 90 transitions. Second operand 31 states. [2018-10-10 15:38:02,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:02,503 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-10-10 15:38:02,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-10-10 15:38:02,504 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 89 [2018-10-10 15:38:02,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:02,504 INFO L225 Difference]: With dead ends: 93 [2018-10-10 15:38:02,504 INFO L226 Difference]: Without dead ends: 93 [2018-10-10 15:38:02,505 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 378 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1275, Invalid=2031, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:38:02,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-10-10 15:38:02,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 92. [2018-10-10 15:38:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-10-10 15:38:02,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2018-10-10 15:38:02,507 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 89 [2018-10-10 15:38:02,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:02,508 INFO L481 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2018-10-10 15:38:02,508 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-10 15:38:02,508 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2018-10-10 15:38:02,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2018-10-10 15:38:02,508 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:02,509 INFO L375 BasicCegarLoop]: trace histogram [28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:02,509 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:02,509 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:02,509 INFO L82 PathProgramCache]: Analyzing trace with hash 767189933, now seen corresponding path program 28 times [2018-10-10 15:38:02,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:02,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:03,081 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 784 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:03,081 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:03,081 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-10-10 15:38:03,082 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-10-10 15:38:03,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-10-10 15:38:03,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=468, Invalid=524, Unknown=0, NotChecked=0, Total=992 [2018-10-10 15:38:03,082 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 32 states. [2018-10-10 15:38:04,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:04,098 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-10-10 15:38:04,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-10 15:38:04,099 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 91 [2018-10-10 15:38:04,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:04,100 INFO L225 Difference]: With dead ends: 95 [2018-10-10 15:38:04,100 INFO L226 Difference]: Without dead ends: 95 [2018-10-10 15:38:04,101 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 406 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1364, Invalid=2176, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:38:04,102 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-10-10 15:38:04,103 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-10-10 15:38:04,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-10-10 15:38:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-10-10 15:38:04,104 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 91 [2018-10-10 15:38:04,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:04,104 INFO L481 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-10-10 15:38:04,104 INFO L482 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-10-10 15:38:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-10-10 15:38:04,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-10-10 15:38:04,105 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:04,105 INFO L375 BasicCegarLoop]: trace histogram [29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:04,106 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:04,106 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:04,106 INFO L82 PathProgramCache]: Analyzing trace with hash -1339053074, now seen corresponding path program 29 times [2018-10-10 15:38:04,107 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:04,628 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 0 proven. 841 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:04,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:04,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-10 15:38:04,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-10 15:38:04,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-10 15:38:04,629 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=499, Invalid=557, Unknown=0, NotChecked=0, Total=1056 [2018-10-10 15:38:04,630 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 33 states. [2018-10-10 15:38:05,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:05,450 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-10-10 15:38:05,452 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-10-10 15:38:05,452 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 93 [2018-10-10 15:38:05,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:05,453 INFO L225 Difference]: With dead ends: 97 [2018-10-10 15:38:05,453 INFO L226 Difference]: Without dead ends: 97 [2018-10-10 15:38:05,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 435 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=1456, Invalid=2326, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:38:05,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-10-10 15:38:05,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-10-10 15:38:05,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-10-10 15:38:05,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-10-10 15:38:05,458 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 93 [2018-10-10 15:38:05,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:05,458 INFO L481 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-10-10 15:38:05,459 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-10 15:38:05,459 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-10-10 15:38:05,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-10-10 15:38:05,459 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:05,459 INFO L375 BasicCegarLoop]: trace histogram [30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:05,459 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:05,460 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:05,460 INFO L82 PathProgramCache]: Analyzing trace with hash 1785980911, now seen corresponding path program 30 times [2018-10-10 15:38:05,460 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:05,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 0 proven. 900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:06,033 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:06,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-10-10 15:38:06,034 INFO L460 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-10-10 15:38:06,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-10-10 15:38:06,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=591, Unknown=0, NotChecked=0, Total=1122 [2018-10-10 15:38:06,035 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 34 states. [2018-10-10 15:38:07,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:07,199 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-10-10 15:38:07,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-10-10 15:38:07,199 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 95 [2018-10-10 15:38:07,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:07,200 INFO L225 Difference]: With dead ends: 99 [2018-10-10 15:38:07,200 INFO L226 Difference]: Without dead ends: 99 [2018-10-10 15:38:07,201 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1551, Invalid=2481, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:38:07,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-10-10 15:38:07,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2018-10-10 15:38:07,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2018-10-10 15:38:07,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 98 transitions. [2018-10-10 15:38:07,204 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 98 transitions. Word has length 95 [2018-10-10 15:38:07,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:07,204 INFO L481 AbstractCegarLoop]: Abstraction has 98 states and 98 transitions. [2018-10-10 15:38:07,204 INFO L482 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-10-10 15:38:07,205 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 98 transitions. [2018-10-10 15:38:07,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-10-10 15:38:07,205 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:07,205 INFO L375 BasicCegarLoop]: trace histogram [31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:07,205 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:07,206 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:07,206 INFO L82 PathProgramCache]: Analyzing trace with hash -1533466704, now seen corresponding path program 31 times [2018-10-10 15:38:07,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:07,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:07,819 INFO L134 CoverageAnalysis]: Checked inductivity of 961 backedges. 0 proven. 961 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:07,819 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:07,819 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-10 15:38:07,819 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-10 15:38:07,820 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-10 15:38:07,820 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=564, Invalid=626, Unknown=0, NotChecked=0, Total=1190 [2018-10-10 15:38:07,820 INFO L87 Difference]: Start difference. First operand 98 states and 98 transitions. Second operand 35 states. [2018-10-10 15:38:08,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:08,703 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-10-10 15:38:08,704 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-10 15:38:08,704 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 97 [2018-10-10 15:38:08,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:08,705 INFO L225 Difference]: With dead ends: 101 [2018-10-10 15:38:08,705 INFO L226 Difference]: Without dead ends: 101 [2018-10-10 15:38:08,706 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1649, Invalid=2641, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:38:08,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-10-10 15:38:08,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 100. [2018-10-10 15:38:08,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2018-10-10 15:38:08,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2018-10-10 15:38:08,709 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 97 [2018-10-10 15:38:08,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:08,710 INFO L481 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2018-10-10 15:38:08,710 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-10 15:38:08,710 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2018-10-10 15:38:08,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-10-10 15:38:08,710 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:08,711 INFO L375 BasicCegarLoop]: trace histogram [32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:08,711 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:08,711 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:08,711 INFO L82 PathProgramCache]: Analyzing trace with hash -361923791, now seen corresponding path program 32 times [2018-10-10 15:38:08,712 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:08,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:09,336 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 0 proven. 1024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:09,336 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:09,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-10-10 15:38:09,336 INFO L460 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-10-10 15:38:09,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-10-10 15:38:09,337 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=598, Invalid=662, Unknown=0, NotChecked=0, Total=1260 [2018-10-10 15:38:09,338 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 36 states. [2018-10-10 15:38:10,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:10,225 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-10-10 15:38:10,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-10-10 15:38:10,225 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 99 [2018-10-10 15:38:10,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:10,226 INFO L225 Difference]: With dead ends: 103 [2018-10-10 15:38:10,226 INFO L226 Difference]: Without dead ends: 103 [2018-10-10 15:38:10,228 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 528 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=1750, Invalid=2806, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:38:10,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-10-10 15:38:10,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 102. [2018-10-10 15:38:10,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102 states. [2018-10-10 15:38:10,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 102 transitions. [2018-10-10 15:38:10,231 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 102 transitions. Word has length 99 [2018-10-10 15:38:10,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:10,232 INFO L481 AbstractCegarLoop]: Abstraction has 102 states and 102 transitions. [2018-10-10 15:38:10,232 INFO L482 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-10-10 15:38:10,232 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 102 transitions. [2018-10-10 15:38:10,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2018-10-10 15:38:10,232 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:10,232 INFO L375 BasicCegarLoop]: trace histogram [33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:10,233 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:10,233 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:10,233 INFO L82 PathProgramCache]: Analyzing trace with hash 209384050, now seen corresponding path program 33 times [2018-10-10 15:38:10,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:10,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:11,011 INFO L134 CoverageAnalysis]: Checked inductivity of 1089 backedges. 0 proven. 1089 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:11,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:11,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-10 15:38:11,012 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-10 15:38:11,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-10 15:38:11,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=633, Invalid=699, Unknown=0, NotChecked=0, Total=1332 [2018-10-10 15:38:11,013 INFO L87 Difference]: Start difference. First operand 102 states and 102 transitions. Second operand 37 states. [2018-10-10 15:38:12,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:12,296 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-10-10 15:38:12,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-10-10 15:38:12,296 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 101 [2018-10-10 15:38:12,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:12,297 INFO L225 Difference]: With dead ends: 105 [2018-10-10 15:38:12,297 INFO L226 Difference]: Without dead ends: 105 [2018-10-10 15:38:12,298 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 561 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1854, Invalid=2976, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:38:12,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-10-10 15:38:12,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-10-10 15:38:12,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-10-10 15:38:12,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-10-10 15:38:12,301 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 101 [2018-10-10 15:38:12,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:12,301 INFO L481 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-10-10 15:38:12,302 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-10 15:38:12,302 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-10-10 15:38:12,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2018-10-10 15:38:12,302 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:12,302 INFO L375 BasicCegarLoop]: trace histogram [34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:12,303 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:12,303 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:12,303 INFO L82 PathProgramCache]: Analyzing trace with hash -519594637, now seen corresponding path program 34 times [2018-10-10 15:38:12,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:12,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1156 backedges. 0 proven. 1156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:12,998 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:12,999 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-10-10 15:38:12,999 INFO L460 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-10-10 15:38:12,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-10-10 15:38:12,999 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=669, Invalid=737, Unknown=0, NotChecked=0, Total=1406 [2018-10-10 15:38:12,999 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 38 states. [2018-10-10 15:38:14,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:14,046 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-10-10 15:38:14,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-10 15:38:14,046 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 103 [2018-10-10 15:38:14,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:14,047 INFO L225 Difference]: With dead ends: 107 [2018-10-10 15:38:14,047 INFO L226 Difference]: Without dead ends: 107 [2018-10-10 15:38:14,048 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 595 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1961, Invalid=3151, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:38:14,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-10-10 15:38:14,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-10-10 15:38:14,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-10-10 15:38:14,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-10-10 15:38:14,051 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 103 [2018-10-10 15:38:14,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:14,052 INFO L481 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-10-10 15:38:14,052 INFO L482 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-10-10 15:38:14,052 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-10-10 15:38:14,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-10-10 15:38:14,052 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:14,052 INFO L375 BasicCegarLoop]: trace histogram [35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:14,052 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:14,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:14,053 INFO L82 PathProgramCache]: Analyzing trace with hash -988443596, now seen corresponding path program 35 times [2018-10-10 15:38:14,053 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:14,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:14,721 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:14,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:14,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-10 15:38:14,722 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-10 15:38:14,722 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-10 15:38:14,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=706, Invalid=776, Unknown=0, NotChecked=0, Total=1482 [2018-10-10 15:38:14,723 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 39 states. [2018-10-10 15:38:15,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:15,736 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-10-10 15:38:15,736 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-10-10 15:38:15,736 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 105 [2018-10-10 15:38:15,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:15,738 INFO L225 Difference]: With dead ends: 109 [2018-10-10 15:38:15,738 INFO L226 Difference]: Without dead ends: 109 [2018-10-10 15:38:15,739 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 630 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=2071, Invalid=3331, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:38:15,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-10-10 15:38:15,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 108. [2018-10-10 15:38:15,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2018-10-10 15:38:15,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2018-10-10 15:38:15,741 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 105 [2018-10-10 15:38:15,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:15,741 INFO L481 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2018-10-10 15:38:15,741 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-10 15:38:15,741 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2018-10-10 15:38:15,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2018-10-10 15:38:15,742 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:15,742 INFO L375 BasicCegarLoop]: trace histogram [36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:15,742 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:15,743 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:15,743 INFO L82 PathProgramCache]: Analyzing trace with hash -580727115, now seen corresponding path program 36 times [2018-10-10 15:38:15,743 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:15,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:16,690 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 0 proven. 1296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:16,690 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:16,690 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-10-10 15:38:16,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-10-10 15:38:16,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-10-10 15:38:16,691 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=744, Invalid=816, Unknown=0, NotChecked=0, Total=1560 [2018-10-10 15:38:16,692 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 40 states. [2018-10-10 15:38:18,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:18,054 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-10-10 15:38:18,054 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-10-10 15:38:18,054 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 107 [2018-10-10 15:38:18,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:18,055 INFO L225 Difference]: With dead ends: 111 [2018-10-10 15:38:18,055 INFO L226 Difference]: Without dead ends: 111 [2018-10-10 15:38:18,056 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 666 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=2184, Invalid=3516, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:38:18,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-10-10 15:38:18,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2018-10-10 15:38:18,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 110 states. [2018-10-10 15:38:18,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 110 transitions. [2018-10-10 15:38:18,058 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 110 transitions. Word has length 107 [2018-10-10 15:38:18,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:18,059 INFO L481 AbstractCegarLoop]: Abstraction has 110 states and 110 transitions. [2018-10-10 15:38:18,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-10-10 15:38:18,059 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 110 transitions. [2018-10-10 15:38:18,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2018-10-10 15:38:18,060 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:18,060 INFO L375 BasicCegarLoop]: trace histogram [37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:18,060 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:18,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:18,060 INFO L82 PathProgramCache]: Analyzing trace with hash 392787190, now seen corresponding path program 37 times [2018-10-10 15:38:18,061 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:18,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1369 backedges. 0 proven. 1369 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:19,380 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:19,380 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-10 15:38:19,380 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-10 15:38:19,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-10 15:38:19,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=783, Invalid=857, Unknown=0, NotChecked=0, Total=1640 [2018-10-10 15:38:19,381 INFO L87 Difference]: Start difference. First operand 110 states and 110 transitions. Second operand 41 states. [2018-10-10 15:38:21,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:21,413 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-10-10 15:38:21,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-10 15:38:21,414 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 109 [2018-10-10 15:38:21,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:21,415 INFO L225 Difference]: With dead ends: 113 [2018-10-10 15:38:21,415 INFO L226 Difference]: Without dead ends: 113 [2018-10-10 15:38:21,416 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 703 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2300, Invalid=3706, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:38:21,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-10-10 15:38:21,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2018-10-10 15:38:21,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2018-10-10 15:38:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 112 transitions. [2018-10-10 15:38:21,418 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 112 transitions. Word has length 109 [2018-10-10 15:38:21,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:21,419 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 112 transitions. [2018-10-10 15:38:21,419 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-10 15:38:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 112 transitions. [2018-10-10 15:38:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2018-10-10 15:38:21,420 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:21,420 INFO L375 BasicCegarLoop]: trace histogram [38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:21,420 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:21,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:21,420 INFO L82 PathProgramCache]: Analyzing trace with hash -362836233, now seen corresponding path program 38 times [2018-10-10 15:38:21,421 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:22,626 INFO L134 CoverageAnalysis]: Checked inductivity of 1444 backedges. 0 proven. 1444 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:22,626 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:22,626 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-10-10 15:38:22,626 INFO L460 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-10-10 15:38:22,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-10-10 15:38:22,627 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=823, Invalid=899, Unknown=0, NotChecked=0, Total=1722 [2018-10-10 15:38:22,627 INFO L87 Difference]: Start difference. First operand 112 states and 112 transitions. Second operand 42 states. [2018-10-10 15:38:23,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:23,749 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-10-10 15:38:23,749 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-10-10 15:38:23,749 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 111 [2018-10-10 15:38:23,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:23,750 INFO L225 Difference]: With dead ends: 115 [2018-10-10 15:38:23,750 INFO L226 Difference]: Without dead ends: 115 [2018-10-10 15:38:23,751 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2419, Invalid=3901, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:38:23,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-10-10 15:38:23,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2018-10-10 15:38:23,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 114 states. [2018-10-10 15:38:23,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 114 transitions. [2018-10-10 15:38:23,754 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 114 transitions. Word has length 111 [2018-10-10 15:38:23,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:23,754 INFO L481 AbstractCegarLoop]: Abstraction has 114 states and 114 transitions. [2018-10-10 15:38:23,754 INFO L482 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-10-10 15:38:23,755 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 114 transitions. [2018-10-10 15:38:23,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2018-10-10 15:38:23,755 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:23,755 INFO L375 BasicCegarLoop]: trace histogram [39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:23,756 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:23,756 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:23,756 INFO L82 PathProgramCache]: Analyzing trace with hash -667472712, now seen corresponding path program 39 times [2018-10-10 15:38:23,756 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:25,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1521 backedges. 0 proven. 1521 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:25,435 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:25,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-10 15:38:25,436 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-10 15:38:25,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-10 15:38:25,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=864, Invalid=942, Unknown=0, NotChecked=0, Total=1806 [2018-10-10 15:38:25,437 INFO L87 Difference]: Start difference. First operand 114 states and 114 transitions. Second operand 43 states. [2018-10-10 15:38:26,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:26,696 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-10-10 15:38:26,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-10-10 15:38:26,697 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 113 [2018-10-10 15:38:26,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:26,698 INFO L225 Difference]: With dead ends: 117 [2018-10-10 15:38:26,698 INFO L226 Difference]: Without dead ends: 117 [2018-10-10 15:38:26,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 780 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=2541, Invalid=4101, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:38:26,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-10-10 15:38:26,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 116. [2018-10-10 15:38:26,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2018-10-10 15:38:26,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2018-10-10 15:38:26,701 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 113 [2018-10-10 15:38:26,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:26,701 INFO L481 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2018-10-10 15:38:26,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-10 15:38:26,701 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2018-10-10 15:38:26,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2018-10-10 15:38:26,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:26,702 INFO L375 BasicCegarLoop]: trace histogram [40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:26,702 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:26,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:26,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1365352903, now seen corresponding path program 40 times [2018-10-10 15:38:26,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:27,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1600 backedges. 0 proven. 1600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:27,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:27,832 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-10-10 15:38:27,833 INFO L460 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-10-10 15:38:27,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-10-10 15:38:27,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=906, Invalid=986, Unknown=0, NotChecked=0, Total=1892 [2018-10-10 15:38:27,833 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 44 states. [2018-10-10 15:38:29,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:29,088 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-10-10 15:38:29,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-10 15:38:29,088 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 115 [2018-10-10 15:38:29,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:29,089 INFO L225 Difference]: With dead ends: 119 [2018-10-10 15:38:29,089 INFO L226 Difference]: Without dead ends: 119 [2018-10-10 15:38:29,090 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 820 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2666, Invalid=4306, Unknown=0, NotChecked=0, Total=6972 [2018-10-10 15:38:29,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-10-10 15:38:29,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 118. [2018-10-10 15:38:29,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 118 states. [2018-10-10 15:38:29,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 118 transitions. [2018-10-10 15:38:29,092 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 118 transitions. Word has length 115 [2018-10-10 15:38:29,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:29,093 INFO L481 AbstractCegarLoop]: Abstraction has 118 states and 118 transitions. [2018-10-10 15:38:29,093 INFO L482 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-10-10 15:38:29,093 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 118 transitions. [2018-10-10 15:38:29,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2018-10-10 15:38:29,094 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:29,094 INFO L375 BasicCegarLoop]: trace histogram [41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:29,094 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:29,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:29,094 INFO L82 PathProgramCache]: Analyzing trace with hash -2013318278, now seen corresponding path program 41 times [2018-10-10 15:38:29,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1681 backedges. 0 proven. 1681 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:29,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:29,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-10 15:38:29,995 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-10 15:38:29,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-10 15:38:29,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=949, Invalid=1031, Unknown=0, NotChecked=0, Total=1980 [2018-10-10 15:38:29,996 INFO L87 Difference]: Start difference. First operand 118 states and 118 transitions. Second operand 45 states. [2018-10-10 15:38:31,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:31,531 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-10-10 15:38:31,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-10-10 15:38:31,531 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 117 [2018-10-10 15:38:31,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:31,532 INFO L225 Difference]: With dead ends: 121 [2018-10-10 15:38:31,532 INFO L226 Difference]: Without dead ends: 121 [2018-10-10 15:38:31,533 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 861 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=2794, Invalid=4516, Unknown=0, NotChecked=0, Total=7310 [2018-10-10 15:38:31,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-10-10 15:38:31,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 120. [2018-10-10 15:38:31,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 120 states. [2018-10-10 15:38:31,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 120 transitions. [2018-10-10 15:38:31,535 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 120 transitions. Word has length 117 [2018-10-10 15:38:31,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:31,535 INFO L481 AbstractCegarLoop]: Abstraction has 120 states and 120 transitions. [2018-10-10 15:38:31,536 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-10 15:38:31,536 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 120 transitions. [2018-10-10 15:38:31,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2018-10-10 15:38:31,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:31,537 INFO L375 BasicCegarLoop]: trace histogram [42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:31,537 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:31,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:31,537 INFO L82 PathProgramCache]: Analyzing trace with hash -1937785733, now seen corresponding path program 42 times [2018-10-10 15:38:31,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:31,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:32,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1764 backedges. 0 proven. 1764 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:32,905 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:32,905 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-10-10 15:38:32,906 INFO L460 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-10-10 15:38:32,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-10-10 15:38:32,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=993, Invalid=1077, Unknown=0, NotChecked=0, Total=2070 [2018-10-10 15:38:32,907 INFO L87 Difference]: Start difference. First operand 120 states and 120 transitions. Second operand 46 states. [2018-10-10 15:38:34,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:34,267 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-10-10 15:38:34,267 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-10-10 15:38:34,268 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 119 [2018-10-10 15:38:34,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:34,268 INFO L225 Difference]: With dead ends: 123 [2018-10-10 15:38:34,268 INFO L226 Difference]: Without dead ends: 123 [2018-10-10 15:38:34,269 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 903 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=2925, Invalid=4731, Unknown=0, NotChecked=0, Total=7656 [2018-10-10 15:38:34,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-10-10 15:38:34,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 122. [2018-10-10 15:38:34,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2018-10-10 15:38:34,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 122 transitions. [2018-10-10 15:38:34,272 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 122 transitions. Word has length 119 [2018-10-10 15:38:34,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:34,272 INFO L481 AbstractCegarLoop]: Abstraction has 122 states and 122 transitions. [2018-10-10 15:38:34,272 INFO L482 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-10-10 15:38:34,272 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 122 transitions. [2018-10-10 15:38:34,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2018-10-10 15:38:34,273 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:34,273 INFO L375 BasicCegarLoop]: trace histogram [43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:34,273 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:34,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:34,274 INFO L82 PathProgramCache]: Analyzing trace with hash 1929513276, now seen corresponding path program 43 times [2018-10-10 15:38:34,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:34,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:35,280 INFO L134 CoverageAnalysis]: Checked inductivity of 1849 backedges. 0 proven. 1849 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:35,280 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:35,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-10 15:38:35,281 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-10 15:38:35,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-10 15:38:35,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1038, Invalid=1124, Unknown=0, NotChecked=0, Total=2162 [2018-10-10 15:38:35,281 INFO L87 Difference]: Start difference. First operand 122 states and 122 transitions. Second operand 47 states. [2018-10-10 15:38:36,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:36,785 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-10-10 15:38:36,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-10 15:38:36,786 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 121 [2018-10-10 15:38:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:36,787 INFO L225 Difference]: With dead ends: 125 [2018-10-10 15:38:36,787 INFO L226 Difference]: Without dead ends: 125 [2018-10-10 15:38:36,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 946 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=3059, Invalid=4951, Unknown=0, NotChecked=0, Total=8010 [2018-10-10 15:38:36,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-10-10 15:38:36,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 124. [2018-10-10 15:38:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2018-10-10 15:38:36,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2018-10-10 15:38:36,789 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 121 [2018-10-10 15:38:36,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:36,790 INFO L481 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2018-10-10 15:38:36,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-10 15:38:36,790 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2018-10-10 15:38:36,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2018-10-10 15:38:36,791 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:36,791 INFO L375 BasicCegarLoop]: trace histogram [44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:36,791 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:36,791 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:36,791 INFO L82 PathProgramCache]: Analyzing trace with hash -1037817411, now seen corresponding path program 44 times [2018-10-10 15:38:36,792 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:38,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 0 proven. 1936 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:38,119 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:38,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-10-10 15:38:38,119 INFO L460 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-10-10 15:38:38,120 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-10-10 15:38:38,120 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1084, Invalid=1172, Unknown=0, NotChecked=0, Total=2256 [2018-10-10 15:38:38,120 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 48 states. [2018-10-10 15:38:39,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:39,596 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-10-10 15:38:39,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-10-10 15:38:39,597 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 123 [2018-10-10 15:38:39,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:39,598 INFO L225 Difference]: With dead ends: 127 [2018-10-10 15:38:39,598 INFO L226 Difference]: Without dead ends: 127 [2018-10-10 15:38:39,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 990 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=3196, Invalid=5176, Unknown=0, NotChecked=0, Total=8372 [2018-10-10 15:38:39,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-10-10 15:38:39,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2018-10-10 15:38:39,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 126 states. [2018-10-10 15:38:39,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 126 transitions. [2018-10-10 15:38:39,601 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 126 transitions. Word has length 123 [2018-10-10 15:38:39,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:39,601 INFO L481 AbstractCegarLoop]: Abstraction has 126 states and 126 transitions. [2018-10-10 15:38:39,601 INFO L482 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-10-10 15:38:39,601 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 126 transitions. [2018-10-10 15:38:39,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2018-10-10 15:38:39,602 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:39,602 INFO L375 BasicCegarLoop]: trace histogram [45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:39,602 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:39,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:39,602 INFO L82 PathProgramCache]: Analyzing trace with hash -784323074, now seen corresponding path program 45 times [2018-10-10 15:38:39,603 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:41,425 INFO L134 CoverageAnalysis]: Checked inductivity of 2025 backedges. 0 proven. 2025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:41,425 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:41,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-10 15:38:41,425 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-10 15:38:41,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-10 15:38:41,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1131, Invalid=1221, Unknown=0, NotChecked=0, Total=2352 [2018-10-10 15:38:41,426 INFO L87 Difference]: Start difference. First operand 126 states and 126 transitions. Second operand 49 states. [2018-10-10 15:38:43,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:43,220 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-10-10 15:38:43,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-10-10 15:38:43,221 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 125 [2018-10-10 15:38:43,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:43,222 INFO L225 Difference]: With dead ends: 129 [2018-10-10 15:38:43,222 INFO L226 Difference]: Without dead ends: 129 [2018-10-10 15:38:43,222 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1035 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=3336, Invalid=5406, Unknown=0, NotChecked=0, Total=8742 [2018-10-10 15:38:43,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-10-10 15:38:43,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 128. [2018-10-10 15:38:43,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 128 states. [2018-10-10 15:38:43,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 128 transitions. [2018-10-10 15:38:43,225 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 128 transitions. Word has length 125 [2018-10-10 15:38:43,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:43,225 INFO L481 AbstractCegarLoop]: Abstraction has 128 states and 128 transitions. [2018-10-10 15:38:43,225 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-10 15:38:43,225 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 128 transitions. [2018-10-10 15:38:43,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2018-10-10 15:38:43,226 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:43,226 INFO L375 BasicCegarLoop]: trace histogram [46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:43,226 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:43,226 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:43,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1989401089, now seen corresponding path program 46 times [2018-10-10 15:38:43,227 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:43,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:44,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2116 backedges. 0 proven. 2116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:44,322 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:44,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-10-10 15:38:44,323 INFO L460 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-10-10 15:38:44,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-10-10 15:38:44,323 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1179, Invalid=1271, Unknown=0, NotChecked=0, Total=2450 [2018-10-10 15:38:44,323 INFO L87 Difference]: Start difference. First operand 128 states and 128 transitions. Second operand 50 states. [2018-10-10 15:38:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:45,912 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-10-10 15:38:45,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-10 15:38:45,913 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 127 [2018-10-10 15:38:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:45,914 INFO L225 Difference]: With dead ends: 131 [2018-10-10 15:38:45,914 INFO L226 Difference]: Without dead ends: 131 [2018-10-10 15:38:45,915 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1081 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3479, Invalid=5641, Unknown=0, NotChecked=0, Total=9120 [2018-10-10 15:38:45,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-10-10 15:38:45,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 130. [2018-10-10 15:38:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 130 states. [2018-10-10 15:38:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2018-10-10 15:38:45,916 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 127 [2018-10-10 15:38:45,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:45,916 INFO L481 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2018-10-10 15:38:45,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-10-10 15:38:45,917 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2018-10-10 15:38:45,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2018-10-10 15:38:45,917 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:45,917 INFO L375 BasicCegarLoop]: trace histogram [47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:45,918 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:45,918 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:45,918 INFO L82 PathProgramCache]: Analyzing trace with hash -428203584, now seen corresponding path program 47 times [2018-10-10 15:38:45,918 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:45,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:47,423 INFO L134 CoverageAnalysis]: Checked inductivity of 2209 backedges. 0 proven. 2209 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:47,423 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:47,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-10 15:38:47,423 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-10 15:38:47,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-10 15:38:47,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=1322, Unknown=0, NotChecked=0, Total=2550 [2018-10-10 15:38:47,424 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand 51 states. [2018-10-10 15:38:49,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:49,340 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-10-10 15:38:49,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-10-10 15:38:49,340 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 129 [2018-10-10 15:38:49,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:49,341 INFO L225 Difference]: With dead ends: 133 [2018-10-10 15:38:49,341 INFO L226 Difference]: Without dead ends: 133 [2018-10-10 15:38:49,342 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1128 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3625, Invalid=5881, Unknown=0, NotChecked=0, Total=9506 [2018-10-10 15:38:49,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-10-10 15:38:49,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 132. [2018-10-10 15:38:49,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2018-10-10 15:38:49,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2018-10-10 15:38:49,344 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 129 [2018-10-10 15:38:49,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:49,344 INFO L481 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2018-10-10 15:38:49,344 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-10 15:38:49,344 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2018-10-10 15:38:49,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2018-10-10 15:38:49,345 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:49,345 INFO L375 BasicCegarLoop]: trace histogram [48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:49,346 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:49,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:49,346 INFO L82 PathProgramCache]: Analyzing trace with hash 939012417, now seen corresponding path program 48 times [2018-10-10 15:38:49,346 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:49,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:50,926 INFO L134 CoverageAnalysis]: Checked inductivity of 2304 backedges. 0 proven. 2304 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:50,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:50,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-10-10 15:38:50,927 INFO L460 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-10-10 15:38:50,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-10-10 15:38:50,927 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1278, Invalid=1374, Unknown=0, NotChecked=0, Total=2652 [2018-10-10 15:38:50,928 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 52 states. [2018-10-10 15:38:52,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:52,619 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-10-10 15:38:52,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-10-10 15:38:52,619 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 131 [2018-10-10 15:38:52,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:52,620 INFO L225 Difference]: With dead ends: 135 [2018-10-10 15:38:52,620 INFO L226 Difference]: Without dead ends: 135 [2018-10-10 15:38:52,621 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1176 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3774, Invalid=6126, Unknown=0, NotChecked=0, Total=9900 [2018-10-10 15:38:52,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-10-10 15:38:52,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 134. [2018-10-10 15:38:52,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 134 states. [2018-10-10 15:38:52,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 134 transitions. [2018-10-10 15:38:52,623 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 134 transitions. Word has length 131 [2018-10-10 15:38:52,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:52,624 INFO L481 AbstractCegarLoop]: Abstraction has 134 states and 134 transitions. [2018-10-10 15:38:52,624 INFO L482 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-10-10 15:38:52,624 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 134 transitions. [2018-10-10 15:38:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2018-10-10 15:38:52,624 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:52,624 INFO L375 BasicCegarLoop]: trace histogram [49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:52,625 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:52,625 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:52,625 INFO L82 PathProgramCache]: Analyzing trace with hash 573596802, now seen corresponding path program 49 times [2018-10-10 15:38:52,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:54,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2401 backedges. 0 proven. 2401 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:54,156 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:54,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-10 15:38:54,156 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-10 15:38:54,156 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-10 15:38:54,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1329, Invalid=1427, Unknown=0, NotChecked=0, Total=2756 [2018-10-10 15:38:54,157 INFO L87 Difference]: Start difference. First operand 134 states and 134 transitions. Second operand 53 states. [2018-10-10 15:38:55,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:55,814 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-10-10 15:38:55,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-10 15:38:55,815 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 133 [2018-10-10 15:38:55,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:55,816 INFO L225 Difference]: With dead ends: 137 [2018-10-10 15:38:55,816 INFO L226 Difference]: Without dead ends: 137 [2018-10-10 15:38:55,817 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1225 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=3926, Invalid=6376, Unknown=0, NotChecked=0, Total=10302 [2018-10-10 15:38:55,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-10-10 15:38:55,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2018-10-10 15:38:55,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136 states. [2018-10-10 15:38:55,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 136 transitions. [2018-10-10 15:38:55,821 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 136 transitions. Word has length 133 [2018-10-10 15:38:55,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:55,821 INFO L481 AbstractCegarLoop]: Abstraction has 136 states and 136 transitions. [2018-10-10 15:38:55,821 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-10 15:38:55,821 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 136 transitions. [2018-10-10 15:38:55,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2018-10-10 15:38:55,822 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:55,822 INFO L375 BasicCegarLoop]: trace histogram [50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:55,823 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:55,823 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:55,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1596509059, now seen corresponding path program 50 times [2018-10-10 15:38:55,823 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:55,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:38:57,014 INFO L134 CoverageAnalysis]: Checked inductivity of 2500 backedges. 0 proven. 2500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:38:57,015 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:38:57,015 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-10-10 15:38:57,015 INFO L460 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-10-10 15:38:57,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-10-10 15:38:57,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1381, Invalid=1481, Unknown=0, NotChecked=0, Total=2862 [2018-10-10 15:38:57,016 INFO L87 Difference]: Start difference. First operand 136 states and 136 transitions. Second operand 54 states. [2018-10-10 15:38:59,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:38:59,244 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-10-10 15:38:59,244 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-10-10 15:38:59,244 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 135 [2018-10-10 15:38:59,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:38:59,245 INFO L225 Difference]: With dead ends: 139 [2018-10-10 15:38:59,245 INFO L226 Difference]: Without dead ends: 139 [2018-10-10 15:38:59,246 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1275 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=4081, Invalid=6631, Unknown=0, NotChecked=0, Total=10712 [2018-10-10 15:38:59,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-10-10 15:38:59,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 138. [2018-10-10 15:38:59,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 138 states. [2018-10-10 15:38:59,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 138 transitions. [2018-10-10 15:38:59,248 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 138 transitions. Word has length 135 [2018-10-10 15:38:59,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:38:59,248 INFO L481 AbstractCegarLoop]: Abstraction has 138 states and 138 transitions. [2018-10-10 15:38:59,248 INFO L482 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-10-10 15:38:59,248 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 138 transitions. [2018-10-10 15:38:59,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2018-10-10 15:38:59,249 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:38:59,249 INFO L375 BasicCegarLoop]: trace histogram [51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:38:59,249 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:38:59,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:38:59,249 INFO L82 PathProgramCache]: Analyzing trace with hash 1067677252, now seen corresponding path program 51 times [2018-10-10 15:38:59,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:38:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:01,046 INFO L134 CoverageAnalysis]: Checked inductivity of 2601 backedges. 0 proven. 2601 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:01,047 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:01,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-10 15:39:01,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-10 15:39:01,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-10 15:39:01,047 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1434, Invalid=1536, Unknown=0, NotChecked=0, Total=2970 [2018-10-10 15:39:01,048 INFO L87 Difference]: Start difference. First operand 138 states and 138 transitions. Second operand 55 states. [2018-10-10 15:39:02,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:02,949 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-10-10 15:39:02,949 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-10-10 15:39:02,949 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 137 [2018-10-10 15:39:02,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:02,950 INFO L225 Difference]: With dead ends: 141 [2018-10-10 15:39:02,950 INFO L226 Difference]: Without dead ends: 141 [2018-10-10 15:39:02,951 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1326 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4239, Invalid=6891, Unknown=0, NotChecked=0, Total=11130 [2018-10-10 15:39:02,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-10-10 15:39:02,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2018-10-10 15:39:02,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2018-10-10 15:39:02,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2018-10-10 15:39:02,954 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 137 [2018-10-10 15:39:02,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:02,954 INFO L481 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2018-10-10 15:39:02,954 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-10 15:39:02,954 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2018-10-10 15:39:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2018-10-10 15:39:02,955 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:02,955 INFO L375 BasicCegarLoop]: trace histogram [52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:02,955 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:02,955 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:02,956 INFO L82 PathProgramCache]: Analyzing trace with hash -333548347, now seen corresponding path program 52 times [2018-10-10 15:39:02,956 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:02,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:04,549 INFO L134 CoverageAnalysis]: Checked inductivity of 2704 backedges. 0 proven. 2704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:04,550 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:04,550 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-10-10 15:39:04,550 INFO L460 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-10-10 15:39:04,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-10-10 15:39:04,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1488, Invalid=1592, Unknown=0, NotChecked=0, Total=3080 [2018-10-10 15:39:04,551 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 56 states. [2018-10-10 15:39:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:06,398 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-10-10 15:39:06,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-10 15:39:06,398 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 139 [2018-10-10 15:39:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:06,399 INFO L225 Difference]: With dead ends: 143 [2018-10-10 15:39:06,399 INFO L226 Difference]: Without dead ends: 143 [2018-10-10 15:39:06,400 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1378 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=4400, Invalid=7156, Unknown=0, NotChecked=0, Total=11556 [2018-10-10 15:39:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-10-10 15:39:06,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2018-10-10 15:39:06,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2018-10-10 15:39:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 142 transitions. [2018-10-10 15:39:06,403 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 142 transitions. Word has length 139 [2018-10-10 15:39:06,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:06,403 INFO L481 AbstractCegarLoop]: Abstraction has 142 states and 142 transitions. [2018-10-10 15:39:06,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-10-10 15:39:06,403 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 142 transitions. [2018-10-10 15:39:06,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2018-10-10 15:39:06,404 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:06,404 INFO L375 BasicCegarLoop]: trace histogram [53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:06,404 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:06,405 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:06,405 INFO L82 PathProgramCache]: Analyzing trace with hash 1708381958, now seen corresponding path program 53 times [2018-10-10 15:39:06,405 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:07,858 INFO L134 CoverageAnalysis]: Checked inductivity of 2809 backedges. 0 proven. 2809 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:07,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:07,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-10 15:39:07,858 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-10 15:39:07,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-10 15:39:07,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1543, Invalid=1649, Unknown=0, NotChecked=0, Total=3192 [2018-10-10 15:39:07,859 INFO L87 Difference]: Start difference. First operand 142 states and 142 transitions. Second operand 57 states. [2018-10-10 15:39:10,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:10,116 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-10-10 15:39:10,116 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-10-10 15:39:10,116 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 141 [2018-10-10 15:39:10,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:10,117 INFO L225 Difference]: With dead ends: 145 [2018-10-10 15:39:10,117 INFO L226 Difference]: Without dead ends: 145 [2018-10-10 15:39:10,118 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=4564, Invalid=7426, Unknown=0, NotChecked=0, Total=11990 [2018-10-10 15:39:10,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-10-10 15:39:10,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 144. [2018-10-10 15:39:10,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 144 states. [2018-10-10 15:39:10,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 144 transitions. [2018-10-10 15:39:10,120 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 144 transitions. Word has length 141 [2018-10-10 15:39:10,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:10,121 INFO L481 AbstractCegarLoop]: Abstraction has 144 states and 144 transitions. [2018-10-10 15:39:10,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-10 15:39:10,121 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 144 transitions. [2018-10-10 15:39:10,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2018-10-10 15:39:10,121 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:10,122 INFO L375 BasicCegarLoop]: trace histogram [54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:10,122 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:10,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:10,122 INFO L82 PathProgramCache]: Analyzing trace with hash 1203350791, now seen corresponding path program 54 times [2018-10-10 15:39:10,123 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:10,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:11,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2916 backedges. 0 proven. 2916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:11,722 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:11,722 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-10-10 15:39:11,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-10-10 15:39:11,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-10-10 15:39:11,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1599, Invalid=1707, Unknown=0, NotChecked=0, Total=3306 [2018-10-10 15:39:11,723 INFO L87 Difference]: Start difference. First operand 144 states and 144 transitions. Second operand 58 states. [2018-10-10 15:39:14,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:14,023 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-10-10 15:39:14,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-10-10 15:39:14,023 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 143 [2018-10-10 15:39:14,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:14,024 INFO L225 Difference]: With dead ends: 147 [2018-10-10 15:39:14,024 INFO L226 Difference]: Without dead ends: 147 [2018-10-10 15:39:14,025 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1485 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=4731, Invalid=7701, Unknown=0, NotChecked=0, Total=12432 [2018-10-10 15:39:14,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-10-10 15:39:14,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2018-10-10 15:39:14,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 146 states. [2018-10-10 15:39:14,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 146 transitions. [2018-10-10 15:39:14,028 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 146 transitions. Word has length 143 [2018-10-10 15:39:14,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:14,028 INFO L481 AbstractCegarLoop]: Abstraction has 146 states and 146 transitions. [2018-10-10 15:39:14,028 INFO L482 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-10-10 15:39:14,028 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 146 transitions. [2018-10-10 15:39:14,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2018-10-10 15:39:14,028 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:14,029 INFO L375 BasicCegarLoop]: trace histogram [55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:14,029 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:14,029 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:14,029 INFO L82 PathProgramCache]: Analyzing trace with hash 1199703752, now seen corresponding path program 55 times [2018-10-10 15:39:14,029 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:14,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:15,720 INFO L134 CoverageAnalysis]: Checked inductivity of 3025 backedges. 0 proven. 3025 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:15,720 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:15,720 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-10 15:39:15,720 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-10 15:39:15,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-10 15:39:15,721 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1656, Invalid=1766, Unknown=0, NotChecked=0, Total=3422 [2018-10-10 15:39:15,721 INFO L87 Difference]: Start difference. First operand 146 states and 146 transitions. Second operand 59 states. [2018-10-10 15:39:17,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:17,866 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-10-10 15:39:17,866 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-10 15:39:17,867 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 145 [2018-10-10 15:39:17,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:17,867 INFO L225 Difference]: With dead ends: 149 [2018-10-10 15:39:17,867 INFO L226 Difference]: Without dead ends: 149 [2018-10-10 15:39:17,868 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1540 ImplicationChecksByTransitivity, 3.4s TimeCoverageRelationStatistics Valid=4901, Invalid=7981, Unknown=0, NotChecked=0, Total=12882 [2018-10-10 15:39:17,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-10-10 15:39:17,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 148. [2018-10-10 15:39:17,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2018-10-10 15:39:17,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2018-10-10 15:39:17,870 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 145 [2018-10-10 15:39:17,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:17,870 INFO L481 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2018-10-10 15:39:17,870 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-10 15:39:17,870 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2018-10-10 15:39:17,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2018-10-10 15:39:17,870 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:17,871 INFO L375 BasicCegarLoop]: trace histogram [56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:17,871 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:17,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:17,871 INFO L82 PathProgramCache]: Analyzing trace with hash 1989866569, now seen corresponding path program 56 times [2018-10-10 15:39:17,871 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:17,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:19,667 INFO L134 CoverageAnalysis]: Checked inductivity of 3136 backedges. 0 proven. 3136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:19,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:19,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-10-10 15:39:19,668 INFO L460 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-10-10 15:39:19,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-10-10 15:39:19,669 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1714, Invalid=1826, Unknown=0, NotChecked=0, Total=3540 [2018-10-10 15:39:19,669 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 60 states. [2018-10-10 15:39:21,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:21,902 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-10-10 15:39:21,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-10-10 15:39:21,902 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 147 [2018-10-10 15:39:21,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:21,903 INFO L225 Difference]: With dead ends: 151 [2018-10-10 15:39:21,903 INFO L226 Difference]: Without dead ends: 151 [2018-10-10 15:39:21,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1596 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=5074, Invalid=8266, Unknown=0, NotChecked=0, Total=13340 [2018-10-10 15:39:21,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-10-10 15:39:21,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 150. [2018-10-10 15:39:21,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 150 states. [2018-10-10 15:39:21,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 150 transitions. [2018-10-10 15:39:21,906 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 150 transitions. Word has length 147 [2018-10-10 15:39:21,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:21,906 INFO L481 AbstractCegarLoop]: Abstraction has 150 states and 150 transitions. [2018-10-10 15:39:21,906 INFO L482 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-10-10 15:39:21,907 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 150 transitions. [2018-10-10 15:39:21,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2018-10-10 15:39:21,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:21,907 INFO L375 BasicCegarLoop]: trace histogram [57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:21,907 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:21,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:21,908 INFO L82 PathProgramCache]: Analyzing trace with hash 1127122314, now seen corresponding path program 57 times [2018-10-10 15:39:21,908 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:23,405 INFO L134 CoverageAnalysis]: Checked inductivity of 3249 backedges. 0 proven. 3249 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:23,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:23,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-10 15:39:23,406 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-10 15:39:23,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-10 15:39:23,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1773, Invalid=1887, Unknown=0, NotChecked=0, Total=3660 [2018-10-10 15:39:23,407 INFO L87 Difference]: Start difference. First operand 150 states and 150 transitions. Second operand 61 states. [2018-10-10 15:39:25,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:25,767 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-10-10 15:39:25,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-10-10 15:39:25,767 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 149 [2018-10-10 15:39:25,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:25,768 INFO L225 Difference]: With dead ends: 153 [2018-10-10 15:39:25,769 INFO L226 Difference]: Without dead ends: 153 [2018-10-10 15:39:25,770 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1653 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=5250, Invalid=8556, Unknown=0, NotChecked=0, Total=13806 [2018-10-10 15:39:25,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-10-10 15:39:25,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 152. [2018-10-10 15:39:25,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152 states. [2018-10-10 15:39:25,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 152 transitions. [2018-10-10 15:39:25,773 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 152 transitions. Word has length 149 [2018-10-10 15:39:25,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:25,773 INFO L481 AbstractCegarLoop]: Abstraction has 152 states and 152 transitions. [2018-10-10 15:39:25,773 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-10 15:39:25,773 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 152 transitions. [2018-10-10 15:39:25,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2018-10-10 15:39:25,774 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:25,774 INFO L375 BasicCegarLoop]: trace histogram [58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:25,774 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:25,774 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:25,775 INFO L82 PathProgramCache]: Analyzing trace with hash 958581387, now seen corresponding path program 58 times [2018-10-10 15:39:25,775 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:27,725 INFO L134 CoverageAnalysis]: Checked inductivity of 3364 backedges. 0 proven. 3364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:27,726 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:27,726 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-10-10 15:39:27,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-10-10 15:39:27,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-10-10 15:39:27,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1833, Invalid=1949, Unknown=0, NotChecked=0, Total=3782 [2018-10-10 15:39:27,727 INFO L87 Difference]: Start difference. First operand 152 states and 152 transitions. Second operand 62 states. [2018-10-10 15:39:30,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:30,444 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-10-10 15:39:30,444 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-10 15:39:30,445 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 151 [2018-10-10 15:39:30,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:30,445 INFO L225 Difference]: With dead ends: 155 [2018-10-10 15:39:30,445 INFO L226 Difference]: Without dead ends: 155 [2018-10-10 15:39:30,446 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1711 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=5429, Invalid=8851, Unknown=0, NotChecked=0, Total=14280 [2018-10-10 15:39:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-10-10 15:39:30,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 154. [2018-10-10 15:39:30,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2018-10-10 15:39:30,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 154 transitions. [2018-10-10 15:39:30,448 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 154 transitions. Word has length 151 [2018-10-10 15:39:30,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:30,448 INFO L481 AbstractCegarLoop]: Abstraction has 154 states and 154 transitions. [2018-10-10 15:39:30,448 INFO L482 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-10-10 15:39:30,448 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 154 transitions. [2018-10-10 15:39:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2018-10-10 15:39:30,449 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:30,449 INFO L375 BasicCegarLoop]: trace histogram [59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:30,450 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:30,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:30,450 INFO L82 PathProgramCache]: Analyzing trace with hash -2095459508, now seen corresponding path program 59 times [2018-10-10 15:39:30,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:30,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:32,199 INFO L134 CoverageAnalysis]: Checked inductivity of 3481 backedges. 0 proven. 3481 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:32,199 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:32,199 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-10 15:39:32,200 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-10 15:39:32,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-10 15:39:32,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1894, Invalid=2012, Unknown=0, NotChecked=0, Total=3906 [2018-10-10 15:39:32,200 INFO L87 Difference]: Start difference. First operand 154 states and 154 transitions. Second operand 63 states. [2018-10-10 15:39:34,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:34,903 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-10-10 15:39:34,903 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-10-10 15:39:34,903 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 153 [2018-10-10 15:39:34,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:34,904 INFO L225 Difference]: With dead ends: 157 [2018-10-10 15:39:34,904 INFO L226 Difference]: Without dead ends: 157 [2018-10-10 15:39:34,904 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1770 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5611, Invalid=9151, Unknown=0, NotChecked=0, Total=14762 [2018-10-10 15:39:34,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-10-10 15:39:34,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2018-10-10 15:39:34,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 156 states. [2018-10-10 15:39:34,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 156 transitions. [2018-10-10 15:39:34,906 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 156 transitions. Word has length 153 [2018-10-10 15:39:34,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:34,907 INFO L481 AbstractCegarLoop]: Abstraction has 156 states and 156 transitions. [2018-10-10 15:39:34,907 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-10 15:39:34,907 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 156 transitions. [2018-10-10 15:39:34,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2018-10-10 15:39:34,907 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:34,908 INFO L375 BasicCegarLoop]: trace histogram [60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:34,908 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:34,908 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:34,908 INFO L82 PathProgramCache]: Analyzing trace with hash 728870861, now seen corresponding path program 60 times [2018-10-10 15:39:34,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:34,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:36,706 INFO L134 CoverageAnalysis]: Checked inductivity of 3600 backedges. 0 proven. 3600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:36,706 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:36,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-10-10 15:39:36,707 INFO L460 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-10-10 15:39:36,707 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-10-10 15:39:36,707 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1956, Invalid=2076, Unknown=0, NotChecked=0, Total=4032 [2018-10-10 15:39:36,708 INFO L87 Difference]: Start difference. First operand 156 states and 156 transitions. Second operand 64 states. [2018-10-10 15:39:39,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:39,421 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-10-10 15:39:39,422 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-10-10 15:39:39,422 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 155 [2018-10-10 15:39:39,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:39,422 INFO L225 Difference]: With dead ends: 159 [2018-10-10 15:39:39,423 INFO L226 Difference]: Without dead ends: 159 [2018-10-10 15:39:39,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1830 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=5796, Invalid=9456, Unknown=0, NotChecked=0, Total=15252 [2018-10-10 15:39:39,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-10-10 15:39:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 158. [2018-10-10 15:39:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158 states. [2018-10-10 15:39:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 158 transitions. [2018-10-10 15:39:39,425 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 158 transitions. Word has length 155 [2018-10-10 15:39:39,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:39,425 INFO L481 AbstractCegarLoop]: Abstraction has 158 states and 158 transitions. [2018-10-10 15:39:39,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-10-10 15:39:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 158 transitions. [2018-10-10 15:39:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2018-10-10 15:39:39,426 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:39,426 INFO L375 BasicCegarLoop]: trace histogram [61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:39,426 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:39,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash 491024398, now seen corresponding path program 61 times [2018-10-10 15:39:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:41,143 INFO L134 CoverageAnalysis]: Checked inductivity of 3721 backedges. 0 proven. 3721 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:41,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:41,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-10 15:39:41,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-10 15:39:41,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-10 15:39:41,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2019, Invalid=2141, Unknown=0, NotChecked=0, Total=4160 [2018-10-10 15:39:41,144 INFO L87 Difference]: Start difference. First operand 158 states and 158 transitions. Second operand 65 states. [2018-10-10 15:39:43,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:43,703 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-10-10 15:39:43,703 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-10 15:39:43,703 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 157 [2018-10-10 15:39:43,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:43,704 INFO L225 Difference]: With dead ends: 161 [2018-10-10 15:39:43,704 INFO L226 Difference]: Without dead ends: 161 [2018-10-10 15:39:43,705 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1891 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5984, Invalid=9766, Unknown=0, NotChecked=0, Total=15750 [2018-10-10 15:39:43,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-10-10 15:39:43,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2018-10-10 15:39:43,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 160 states. [2018-10-10 15:39:43,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 160 transitions. [2018-10-10 15:39:43,708 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 160 transitions. Word has length 157 [2018-10-10 15:39:43,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:43,708 INFO L481 AbstractCegarLoop]: Abstraction has 160 states and 160 transitions. [2018-10-10 15:39:43,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-10 15:39:43,708 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 160 transitions. [2018-10-10 15:39:43,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2018-10-10 15:39:43,709 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:43,709 INFO L375 BasicCegarLoop]: trace histogram [62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:43,709 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:43,709 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:43,709 INFO L82 PathProgramCache]: Analyzing trace with hash -446159857, now seen corresponding path program 62 times [2018-10-10 15:39:43,710 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:45,675 INFO L134 CoverageAnalysis]: Checked inductivity of 3844 backedges. 0 proven. 3844 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:45,676 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:45,676 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-10-10 15:39:45,676 INFO L460 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-10-10 15:39:45,677 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-10-10 15:39:45,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2083, Invalid=2207, Unknown=0, NotChecked=0, Total=4290 [2018-10-10 15:39:45,677 INFO L87 Difference]: Start difference. First operand 160 states and 160 transitions. Second operand 66 states. [2018-10-10 15:39:48,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:48,310 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-10-10 15:39:48,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-10-10 15:39:48,310 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 159 [2018-10-10 15:39:48,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:48,311 INFO L225 Difference]: With dead ends: 163 [2018-10-10 15:39:48,311 INFO L226 Difference]: Without dead ends: 163 [2018-10-10 15:39:48,312 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6175, Invalid=10081, Unknown=0, NotChecked=0, Total=16256 [2018-10-10 15:39:48,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-10-10 15:39:48,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 162. [2018-10-10 15:39:48,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 162 states. [2018-10-10 15:39:48,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 162 transitions. [2018-10-10 15:39:48,313 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 162 transitions. Word has length 159 [2018-10-10 15:39:48,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:48,313 INFO L481 AbstractCegarLoop]: Abstraction has 162 states and 162 transitions. [2018-10-10 15:39:48,314 INFO L482 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-10-10 15:39:48,314 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 162 transitions. [2018-10-10 15:39:48,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2018-10-10 15:39:48,314 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:48,314 INFO L375 BasicCegarLoop]: trace histogram [63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:48,315 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:48,315 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:48,315 INFO L82 PathProgramCache]: Analyzing trace with hash 862903248, now seen corresponding path program 63 times [2018-10-10 15:39:48,316 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3969 backedges. 0 proven. 3969 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:50,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:50,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-10 15:39:50,356 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-10 15:39:50,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-10 15:39:50,357 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2148, Invalid=2274, Unknown=0, NotChecked=0, Total=4422 [2018-10-10 15:39:50,357 INFO L87 Difference]: Start difference. First operand 162 states and 162 transitions. Second operand 67 states. [2018-10-10 15:39:53,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:53,048 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-10-10 15:39:53,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-10-10 15:39:53,049 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 161 [2018-10-10 15:39:53,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:53,050 INFO L225 Difference]: With dead ends: 165 [2018-10-10 15:39:53,050 INFO L226 Difference]: Without dead ends: 165 [2018-10-10 15:39:53,051 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 4.2s TimeCoverageRelationStatistics Valid=6369, Invalid=10401, Unknown=0, NotChecked=0, Total=16770 [2018-10-10 15:39:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-10-10 15:39:53,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 164. [2018-10-10 15:39:53,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2018-10-10 15:39:53,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2018-10-10 15:39:53,053 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 161 [2018-10-10 15:39:53,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:53,054 INFO L481 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2018-10-10 15:39:53,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-10 15:39:53,054 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2018-10-10 15:39:53,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2018-10-10 15:39:53,055 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:53,055 INFO L375 BasicCegarLoop]: trace histogram [64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:53,055 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:53,055 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:53,055 INFO L82 PathProgramCache]: Analyzing trace with hash 447129425, now seen corresponding path program 64 times [2018-10-10 15:39:53,056 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:39:55,218 INFO L134 CoverageAnalysis]: Checked inductivity of 4096 backedges. 0 proven. 4096 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:39:55,219 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:39:55,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-10-10 15:39:55,219 INFO L460 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-10-10 15:39:55,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-10-10 15:39:55,219 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2214, Invalid=2342, Unknown=0, NotChecked=0, Total=4556 [2018-10-10 15:39:55,220 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 68 states. [2018-10-10 15:39:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:39:58,021 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-10-10 15:39:58,021 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-10 15:39:58,021 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 163 [2018-10-10 15:39:58,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:39:58,022 INFO L225 Difference]: With dead ends: 167 [2018-10-10 15:39:58,022 INFO L226 Difference]: Without dead ends: 167 [2018-10-10 15:39:58,023 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2080 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=6566, Invalid=10726, Unknown=0, NotChecked=0, Total=17292 [2018-10-10 15:39:58,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-10-10 15:39:58,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 166. [2018-10-10 15:39:58,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-10-10 15:39:58,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 166 transitions. [2018-10-10 15:39:58,025 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 166 transitions. Word has length 163 [2018-10-10 15:39:58,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:39:58,026 INFO L481 AbstractCegarLoop]: Abstraction has 166 states and 166 transitions. [2018-10-10 15:39:58,026 INFO L482 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-10-10 15:39:58,026 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 166 transitions. [2018-10-10 15:39:58,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2018-10-10 15:39:58,027 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:39:58,027 INFO L375 BasicCegarLoop]: trace histogram [65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:39:58,027 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:39:58,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:39:58,027 INFO L82 PathProgramCache]: Analyzing trace with hash 320444050, now seen corresponding path program 65 times [2018-10-10 15:39:58,028 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:39:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:00,217 INFO L134 CoverageAnalysis]: Checked inductivity of 4225 backedges. 0 proven. 4225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:00,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:00,217 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-10 15:40:00,218 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-10 15:40:00,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-10 15:40:00,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2281, Invalid=2411, Unknown=0, NotChecked=0, Total=4692 [2018-10-10 15:40:00,218 INFO L87 Difference]: Start difference. First operand 166 states and 166 transitions. Second operand 69 states. [2018-10-10 15:40:03,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:03,043 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-10-10 15:40:03,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-10-10 15:40:03,043 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 165 [2018-10-10 15:40:03,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:03,044 INFO L225 Difference]: With dead ends: 169 [2018-10-10 15:40:03,044 INFO L226 Difference]: Without dead ends: 169 [2018-10-10 15:40:03,045 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2145 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6766, Invalid=11056, Unknown=0, NotChecked=0, Total=17822 [2018-10-10 15:40:03,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-10-10 15:40:03,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 168. [2018-10-10 15:40:03,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 168 states. [2018-10-10 15:40:03,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 168 transitions. [2018-10-10 15:40:03,048 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 168 transitions. Word has length 165 [2018-10-10 15:40:03,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:03,048 INFO L481 AbstractCegarLoop]: Abstraction has 168 states and 168 transitions. [2018-10-10 15:40:03,048 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-10 15:40:03,049 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 168 transitions. [2018-10-10 15:40:03,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2018-10-10 15:40:03,049 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:03,050 INFO L375 BasicCegarLoop]: trace histogram [66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:03,050 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:03,050 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:03,050 INFO L82 PathProgramCache]: Analyzing trace with hash -1165117037, now seen corresponding path program 66 times [2018-10-10 15:40:03,051 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:05,550 INFO L134 CoverageAnalysis]: Checked inductivity of 4356 backedges. 0 proven. 4356 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:05,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:05,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-10-10 15:40:05,551 INFO L460 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-10-10 15:40:05,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-10-10 15:40:05,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2349, Invalid=2481, Unknown=0, NotChecked=0, Total=4830 [2018-10-10 15:40:05,552 INFO L87 Difference]: Start difference. First operand 168 states and 168 transitions. Second operand 70 states. [2018-10-10 15:40:08,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:08,538 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-10-10 15:40:08,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-10-10 15:40:08,538 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 167 [2018-10-10 15:40:08,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:08,539 INFO L225 Difference]: With dead ends: 171 [2018-10-10 15:40:08,539 INFO L226 Difference]: Without dead ends: 171 [2018-10-10 15:40:08,540 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2211 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=6969, Invalid=11391, Unknown=0, NotChecked=0, Total=18360 [2018-10-10 15:40:08,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-10-10 15:40:08,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 170. [2018-10-10 15:40:08,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 170 states. [2018-10-10 15:40:08,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 170 transitions. [2018-10-10 15:40:08,542 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 170 transitions. Word has length 167 [2018-10-10 15:40:08,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:08,542 INFO L481 AbstractCegarLoop]: Abstraction has 170 states and 170 transitions. [2018-10-10 15:40:08,542 INFO L482 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-10-10 15:40:08,542 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 170 transitions. [2018-10-10 15:40:08,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2018-10-10 15:40:08,542 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:08,543 INFO L375 BasicCegarLoop]: trace histogram [67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:08,543 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:08,543 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:08,543 INFO L82 PathProgramCache]: Analyzing trace with hash 1434787924, now seen corresponding path program 67 times [2018-10-10 15:40:08,543 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:08,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 4489 backedges. 0 proven. 4489 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:10,936 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:10,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-10 15:40:10,936 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-10 15:40:10,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-10 15:40:10,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2418, Invalid=2552, Unknown=0, NotChecked=0, Total=4970 [2018-10-10 15:40:10,937 INFO L87 Difference]: Start difference. First operand 170 states and 170 transitions. Second operand 71 states. [2018-10-10 15:40:13,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:13,874 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-10-10 15:40:13,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-10 15:40:13,874 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 169 [2018-10-10 15:40:13,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:13,875 INFO L225 Difference]: With dead ends: 173 [2018-10-10 15:40:13,875 INFO L226 Difference]: Without dead ends: 173 [2018-10-10 15:40:13,876 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2278 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=7175, Invalid=11731, Unknown=0, NotChecked=0, Total=18906 [2018-10-10 15:40:13,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-10-10 15:40:13,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 172. [2018-10-10 15:40:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 172 states. [2018-10-10 15:40:13,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 172 transitions. [2018-10-10 15:40:13,877 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 172 transitions. Word has length 169 [2018-10-10 15:40:13,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:13,878 INFO L481 AbstractCegarLoop]: Abstraction has 172 states and 172 transitions. [2018-10-10 15:40:13,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-10 15:40:13,878 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 172 transitions. [2018-10-10 15:40:13,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2018-10-10 15:40:13,878 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:13,879 INFO L375 BasicCegarLoop]: trace histogram [68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:13,879 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:13,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:13,879 INFO L82 PathProgramCache]: Analyzing trace with hash 272489173, now seen corresponding path program 68 times [2018-10-10 15:40:13,879 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:13,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:16,303 INFO L134 CoverageAnalysis]: Checked inductivity of 4624 backedges. 0 proven. 4624 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:16,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:16,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-10-10 15:40:16,304 INFO L460 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-10-10 15:40:16,304 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-10-10 15:40:16,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2488, Invalid=2624, Unknown=0, NotChecked=0, Total=5112 [2018-10-10 15:40:16,305 INFO L87 Difference]: Start difference. First operand 172 states and 172 transitions. Second operand 72 states. [2018-10-10 15:40:19,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:19,393 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-10-10 15:40:19,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-10-10 15:40:19,394 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 171 [2018-10-10 15:40:19,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:19,395 INFO L225 Difference]: With dead ends: 175 [2018-10-10 15:40:19,395 INFO L226 Difference]: Without dead ends: 175 [2018-10-10 15:40:19,395 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 138 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2346 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=7384, Invalid=12076, Unknown=0, NotChecked=0, Total=19460 [2018-10-10 15:40:19,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-10-10 15:40:19,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 174. [2018-10-10 15:40:19,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 174 states. [2018-10-10 15:40:19,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 174 transitions. [2018-10-10 15:40:19,398 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 174 transitions. Word has length 171 [2018-10-10 15:40:19,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:19,398 INFO L481 AbstractCegarLoop]: Abstraction has 174 states and 174 transitions. [2018-10-10 15:40:19,399 INFO L482 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-10-10 15:40:19,399 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 174 transitions. [2018-10-10 15:40:19,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2018-10-10 15:40:19,399 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:19,400 INFO L375 BasicCegarLoop]: trace histogram [69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:19,400 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:19,400 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:19,400 INFO L82 PathProgramCache]: Analyzing trace with hash -5113578, now seen corresponding path program 69 times [2018-10-10 15:40:19,401 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:19,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:22,125 INFO L134 CoverageAnalysis]: Checked inductivity of 4761 backedges. 0 proven. 4761 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:22,126 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:22,126 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-10 15:40:22,126 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-10 15:40:22,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-10 15:40:22,127 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2559, Invalid=2697, Unknown=0, NotChecked=0, Total=5256 [2018-10-10 15:40:22,127 INFO L87 Difference]: Start difference. First operand 174 states and 174 transitions. Second operand 73 states. [2018-10-10 15:40:25,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:25,696 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-10-10 15:40:25,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-10-10 15:40:25,696 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 173 [2018-10-10 15:40:25,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:25,697 INFO L225 Difference]: With dead ends: 177 [2018-10-10 15:40:25,697 INFO L226 Difference]: Without dead ends: 177 [2018-10-10 15:40:25,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 140 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2415 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=7596, Invalid=12426, Unknown=0, NotChecked=0, Total=20022 [2018-10-10 15:40:25,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-10-10 15:40:25,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 176. [2018-10-10 15:40:25,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 176 states. [2018-10-10 15:40:25,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 176 transitions. [2018-10-10 15:40:25,701 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 176 transitions. Word has length 173 [2018-10-10 15:40:25,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:25,701 INFO L481 AbstractCegarLoop]: Abstraction has 176 states and 176 transitions. [2018-10-10 15:40:25,701 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-10 15:40:25,701 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 176 transitions. [2018-10-10 15:40:25,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2018-10-10 15:40:25,702 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:25,702 INFO L375 BasicCegarLoop]: trace histogram [70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:25,703 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:25,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:25,703 INFO L82 PathProgramCache]: Analyzing trace with hash -493384937, now seen corresponding path program 70 times [2018-10-10 15:40:25,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:27,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4900 backedges. 0 proven. 4900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:27,984 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:27,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-10-10 15:40:27,984 INFO L460 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-10-10 15:40:27,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-10-10 15:40:27,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2631, Invalid=2771, Unknown=0, NotChecked=0, Total=5402 [2018-10-10 15:40:27,985 INFO L87 Difference]: Start difference. First operand 176 states and 176 transitions. Second operand 74 states. [2018-10-10 15:40:31,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:31,444 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-10-10 15:40:31,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-10 15:40:31,445 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 175 [2018-10-10 15:40:31,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:31,446 INFO L225 Difference]: With dead ends: 179 [2018-10-10 15:40:31,446 INFO L226 Difference]: Without dead ends: 179 [2018-10-10 15:40:31,447 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2485 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=7811, Invalid=12781, Unknown=0, NotChecked=0, Total=20592 [2018-10-10 15:40:31,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-10-10 15:40:31,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 178. [2018-10-10 15:40:31,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-10-10 15:40:31,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 178 transitions. [2018-10-10 15:40:31,449 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 178 transitions. Word has length 175 [2018-10-10 15:40:31,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:31,449 INFO L481 AbstractCegarLoop]: Abstraction has 178 states and 178 transitions. [2018-10-10 15:40:31,449 INFO L482 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-10-10 15:40:31,449 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 178 transitions. [2018-10-10 15:40:31,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2018-10-10 15:40:31,450 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:31,450 INFO L375 BasicCegarLoop]: trace histogram [71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:31,451 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:31,451 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:31,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1570725672, now seen corresponding path program 71 times [2018-10-10 15:40:31,452 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:31,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:33,748 INFO L134 CoverageAnalysis]: Checked inductivity of 5041 backedges. 0 proven. 5041 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:33,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:33,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-10 15:40:33,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-10 15:40:33,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-10 15:40:33,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2704, Invalid=2846, Unknown=0, NotChecked=0, Total=5550 [2018-10-10 15:40:33,750 INFO L87 Difference]: Start difference. First operand 178 states and 178 transitions. Second operand 75 states. [2018-10-10 15:40:37,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:37,582 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-10-10 15:40:37,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-10-10 15:40:37,583 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 177 [2018-10-10 15:40:37,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:37,583 INFO L225 Difference]: With dead ends: 181 [2018-10-10 15:40:37,583 INFO L226 Difference]: Without dead ends: 181 [2018-10-10 15:40:37,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 144 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2556 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8029, Invalid=13141, Unknown=0, NotChecked=0, Total=21170 [2018-10-10 15:40:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-10-10 15:40:37,586 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 180. [2018-10-10 15:40:37,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2018-10-10 15:40:37,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2018-10-10 15:40:37,587 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 177 [2018-10-10 15:40:37,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:37,587 INFO L481 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2018-10-10 15:40:37,587 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-10 15:40:37,587 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2018-10-10 15:40:37,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2018-10-10 15:40:37,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:37,589 INFO L375 BasicCegarLoop]: trace histogram [72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:37,589 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:37,589 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:37,589 INFO L82 PathProgramCache]: Analyzing trace with hash -1808053671, now seen corresponding path program 72 times [2018-10-10 15:40:37,590 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:37,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 5184 backedges. 0 proven. 5184 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:39,942 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:39,942 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-10-10 15:40:39,942 INFO L460 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-10-10 15:40:39,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-10-10 15:40:39,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2778, Invalid=2922, Unknown=0, NotChecked=0, Total=5700 [2018-10-10 15:40:39,943 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 76 states. [2018-10-10 15:40:43,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:43,610 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-10-10 15:40:43,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-10-10 15:40:43,611 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 179 [2018-10-10 15:40:43,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:43,612 INFO L225 Difference]: With dead ends: 183 [2018-10-10 15:40:43,612 INFO L226 Difference]: Without dead ends: 183 [2018-10-10 15:40:43,612 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 146 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2628 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8250, Invalid=13506, Unknown=0, NotChecked=0, Total=21756 [2018-10-10 15:40:43,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-10-10 15:40:43,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 182. [2018-10-10 15:40:43,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2018-10-10 15:40:43,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 182 transitions. [2018-10-10 15:40:43,615 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 182 transitions. Word has length 179 [2018-10-10 15:40:43,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:43,615 INFO L481 AbstractCegarLoop]: Abstraction has 182 states and 182 transitions. [2018-10-10 15:40:43,616 INFO L482 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-10-10 15:40:43,616 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 182 transitions. [2018-10-10 15:40:43,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2018-10-10 15:40:43,617 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:43,617 INFO L375 BasicCegarLoop]: trace histogram [73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:43,617 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:43,617 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:43,617 INFO L82 PathProgramCache]: Analyzing trace with hash 2047973274, now seen corresponding path program 73 times [2018-10-10 15:40:43,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:43,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 5329 backedges. 0 proven. 5329 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:46,192 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:46,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-10 15:40:46,193 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-10 15:40:46,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-10 15:40:46,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2853, Invalid=2999, Unknown=0, NotChecked=0, Total=5852 [2018-10-10 15:40:46,194 INFO L87 Difference]: Start difference. First operand 182 states and 182 transitions. Second operand 77 states. [2018-10-10 15:40:49,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:49,753 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-10-10 15:40:49,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-10 15:40:49,753 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 181 [2018-10-10 15:40:49,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:49,754 INFO L225 Difference]: With dead ends: 185 [2018-10-10 15:40:49,754 INFO L226 Difference]: Without dead ends: 185 [2018-10-10 15:40:49,755 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2701 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=8474, Invalid=13876, Unknown=0, NotChecked=0, Total=22350 [2018-10-10 15:40:49,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-10-10 15:40:49,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 184. [2018-10-10 15:40:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-10-10 15:40:49,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 184 transitions. [2018-10-10 15:40:49,757 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 184 transitions. Word has length 181 [2018-10-10 15:40:49,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:49,757 INFO L481 AbstractCegarLoop]: Abstraction has 184 states and 184 transitions. [2018-10-10 15:40:49,757 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-10 15:40:49,757 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 184 transitions. [2018-10-10 15:40:49,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2018-10-10 15:40:49,757 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:49,758 INFO L375 BasicCegarLoop]: trace histogram [74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:49,758 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:49,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:49,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1133090971, now seen corresponding path program 74 times [2018-10-10 15:40:49,758 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:49,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:52,482 INFO L134 CoverageAnalysis]: Checked inductivity of 5476 backedges. 0 proven. 5476 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:52,483 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:52,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-10-10 15:40:52,483 INFO L460 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-10-10 15:40:52,484 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-10-10 15:40:52,484 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2929, Invalid=3077, Unknown=0, NotChecked=0, Total=6006 [2018-10-10 15:40:52,484 INFO L87 Difference]: Start difference. First operand 184 states and 184 transitions. Second operand 78 states. [2018-10-10 15:40:56,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:40:56,295 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-10-10 15:40:56,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-10-10 15:40:56,296 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 183 [2018-10-10 15:40:56,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:40:56,296 INFO L225 Difference]: With dead ends: 187 [2018-10-10 15:40:56,296 INFO L226 Difference]: Without dead ends: 187 [2018-10-10 15:40:56,297 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 150 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2775 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8701, Invalid=14251, Unknown=0, NotChecked=0, Total=22952 [2018-10-10 15:40:56,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-10-10 15:40:56,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 186. [2018-10-10 15:40:56,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 186 states. [2018-10-10 15:40:56,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 186 transitions. [2018-10-10 15:40:56,299 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 186 transitions. Word has length 183 [2018-10-10 15:40:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:40:56,300 INFO L481 AbstractCegarLoop]: Abstraction has 186 states and 186 transitions. [2018-10-10 15:40:56,300 INFO L482 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-10-10 15:40:56,300 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 186 transitions. [2018-10-10 15:40:56,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2018-10-10 15:40:56,301 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:40:56,301 INFO L375 BasicCegarLoop]: trace histogram [75, 75, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:40:56,302 INFO L424 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:40:56,302 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:40:56,302 INFO L82 PathProgramCache]: Analyzing trace with hash -1895473828, now seen corresponding path program 75 times [2018-10-10 15:40:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:40:56,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:40:58,817 INFO L134 CoverageAnalysis]: Checked inductivity of 5625 backedges. 0 proven. 5625 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:40:58,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:40:58,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-10 15:40:58,818 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-10 15:40:58,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-10 15:40:58,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3006, Invalid=3156, Unknown=0, NotChecked=0, Total=6162 [2018-10-10 15:40:58,819 INFO L87 Difference]: Start difference. First operand 186 states and 186 transitions. Second operand 79 states. [2018-10-10 15:41:02,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:02,539 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-10-10 15:41:02,539 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-10-10 15:41:02,539 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 185 [2018-10-10 15:41:02,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:02,541 INFO L225 Difference]: With dead ends: 189 [2018-10-10 15:41:02,541 INFO L226 Difference]: Without dead ends: 189 [2018-10-10 15:41:02,542 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2850 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8931, Invalid=14631, Unknown=0, NotChecked=0, Total=23562 [2018-10-10 15:41:02,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-10-10 15:41:02,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 188. [2018-10-10 15:41:02,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2018-10-10 15:41:02,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 188 transitions. [2018-10-10 15:41:02,544 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 188 transitions. Word has length 185 [2018-10-10 15:41:02,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:02,545 INFO L481 AbstractCegarLoop]: Abstraction has 188 states and 188 transitions. [2018-10-10 15:41:02,545 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-10 15:41:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 188 transitions. [2018-10-10 15:41:02,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2018-10-10 15:41:02,546 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:41:02,546 INFO L375 BasicCegarLoop]: trace histogram [76, 76, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:41:02,546 INFO L424 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:41:02,546 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:41:02,546 INFO L82 PathProgramCache]: Analyzing trace with hash -358418979, now seen corresponding path program 76 times [2018-10-10 15:41:02,547 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:41:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:41:05,117 INFO L134 CoverageAnalysis]: Checked inductivity of 5776 backedges. 0 proven. 5776 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:41:05,117 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:41:05,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-10-10 15:41:05,118 INFO L460 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-10-10 15:41:05,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-10-10 15:41:05,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3084, Invalid=3236, Unknown=0, NotChecked=0, Total=6320 [2018-10-10 15:41:05,118 INFO L87 Difference]: Start difference. First operand 188 states and 188 transitions. Second operand 80 states. [2018-10-10 15:41:09,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:09,094 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-10-10 15:41:09,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-10 15:41:09,094 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 187 [2018-10-10 15:41:09,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:09,095 INFO L225 Difference]: With dead ends: 191 [2018-10-10 15:41:09,095 INFO L226 Difference]: Without dead ends: 191 [2018-10-10 15:41:09,095 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 156 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 154 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2926 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=9164, Invalid=15016, Unknown=0, NotChecked=0, Total=24180 [2018-10-10 15:41:09,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-10-10 15:41:09,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 190. [2018-10-10 15:41:09,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 190 states. [2018-10-10 15:41:09,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 190 transitions. [2018-10-10 15:41:09,098 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 190 transitions. Word has length 187 [2018-10-10 15:41:09,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:09,099 INFO L481 AbstractCegarLoop]: Abstraction has 190 states and 190 transitions. [2018-10-10 15:41:09,099 INFO L482 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-10-10 15:41:09,099 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 190 transitions. [2018-10-10 15:41:09,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2018-10-10 15:41:09,100 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:41:09,100 INFO L375 BasicCegarLoop]: trace histogram [77, 77, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:41:09,100 INFO L424 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:41:09,100 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:41:09,101 INFO L82 PathProgramCache]: Analyzing trace with hash -717458914, now seen corresponding path program 77 times [2018-10-10 15:41:09,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:41:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:41:12,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5929 backedges. 0 proven. 5929 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:41:12,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:41:12,046 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-10 15:41:12,047 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-10 15:41:12,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-10 15:41:12,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3163, Invalid=3317, Unknown=0, NotChecked=0, Total=6480 [2018-10-10 15:41:12,048 INFO L87 Difference]: Start difference. First operand 190 states and 190 transitions. Second operand 81 states. [2018-10-10 15:41:15,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:15,896 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-10-10 15:41:15,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-10-10 15:41:15,897 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 189 [2018-10-10 15:41:15,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:15,897 INFO L225 Difference]: With dead ends: 193 [2018-10-10 15:41:15,897 INFO L226 Difference]: Without dead ends: 193 [2018-10-10 15:41:15,898 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3003 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=9400, Invalid=15406, Unknown=0, NotChecked=0, Total=24806 [2018-10-10 15:41:15,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-10-10 15:41:15,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 192. [2018-10-10 15:41:15,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 192 states. [2018-10-10 15:41:15,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 192 transitions. [2018-10-10 15:41:15,900 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 192 transitions. Word has length 189 [2018-10-10 15:41:15,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:15,901 INFO L481 AbstractCegarLoop]: Abstraction has 192 states and 192 transitions. [2018-10-10 15:41:15,901 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-10 15:41:15,901 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 192 transitions. [2018-10-10 15:41:15,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2018-10-10 15:41:15,902 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:41:15,902 INFO L375 BasicCegarLoop]: trace histogram [78, 78, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:41:15,902 INFO L424 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:41:15,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:41:15,902 INFO L82 PathProgramCache]: Analyzing trace with hash 2137514527, now seen corresponding path program 78 times [2018-10-10 15:41:15,903 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:41:15,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:41:18,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6084 backedges. 0 proven. 6084 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:41:18,833 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:41:18,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-10-10 15:41:18,834 INFO L460 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-10-10 15:41:18,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-10-10 15:41:18,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3243, Invalid=3399, Unknown=0, NotChecked=0, Total=6642 [2018-10-10 15:41:18,834 INFO L87 Difference]: Start difference. First operand 192 states and 192 transitions. Second operand 82 states. [2018-10-10 15:41:23,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:23,089 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-10-10 15:41:23,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-10-10 15:41:23,089 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 191 [2018-10-10 15:41:23,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:23,090 INFO L225 Difference]: With dead ends: 195 [2018-10-10 15:41:23,090 INFO L226 Difference]: Without dead ends: 195 [2018-10-10 15:41:23,091 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 158 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3081 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9639, Invalid=15801, Unknown=0, NotChecked=0, Total=25440 [2018-10-10 15:41:23,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-10-10 15:41:23,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 194. [2018-10-10 15:41:23,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2018-10-10 15:41:23,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 194 transitions. [2018-10-10 15:41:23,094 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 194 transitions. Word has length 191 [2018-10-10 15:41:23,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:23,094 INFO L481 AbstractCegarLoop]: Abstraction has 194 states and 194 transitions. [2018-10-10 15:41:23,094 INFO L482 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-10-10 15:41:23,094 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 194 transitions. [2018-10-10 15:41:23,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2018-10-10 15:41:23,095 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:41:23,095 INFO L375 BasicCegarLoop]: trace histogram [79, 79, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:41:23,095 INFO L424 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:41:23,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:41:23,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1282889184, now seen corresponding path program 79 times [2018-10-10 15:41:23,096 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:41:23,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:41:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 6241 backedges. 0 proven. 6241 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-10 15:41:25,894 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-10 15:41:25,894 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-10 15:41:25,895 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-10 15:41:25,895 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-10 15:41:25,895 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3324, Invalid=3482, Unknown=0, NotChecked=0, Total=6806 [2018-10-10 15:41:25,895 INFO L87 Difference]: Start difference. First operand 194 states and 194 transitions. Second operand 83 states. [2018-10-10 15:41:30,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:30,243 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2018-10-10 15:41:30,243 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-10 15:41:30,243 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 193 [2018-10-10 15:41:30,244 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:30,244 INFO L225 Difference]: With dead ends: 196 [2018-10-10 15:41:30,244 INFO L226 Difference]: Without dead ends: 196 [2018-10-10 15:41:30,245 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 160 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3160 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=9881, Invalid=16201, Unknown=0, NotChecked=0, Total=26082 [2018-10-10 15:41:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2018-10-10 15:41:30,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2018-10-10 15:41:30,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2018-10-10 15:41:30,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2018-10-10 15:41:30,247 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 193 [2018-10-10 15:41:30,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:30,247 INFO L481 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2018-10-10 15:41:30,247 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-10 15:41:30,248 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2018-10-10 15:41:30,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2018-10-10 15:41:30,248 INFO L367 BasicCegarLoop]: Found error trace [2018-10-10 15:41:30,249 INFO L375 BasicCegarLoop]: trace histogram [80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-10 15:41:30,249 INFO L424 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-10 15:41:30,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-10 15:41:30,249 INFO L82 PathProgramCache]: Analyzing trace with hash 326688097, now seen corresponding path program 80 times [2018-10-10 15:41:30,250 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-10 15:41:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-10 15:41:30,657 INFO L134 CoverageAnalysis]: Checked inductivity of 6400 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6400 trivial. 0 not checked. [2018-10-10 15:41:30,657 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-10 15:41:30,658 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2018-10-10 15:41:30,658 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-10 15:41:30,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-10 15:41:30,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2018-10-10 15:41:30,659 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 9 states. [2018-10-10 15:41:31,222 WARN L178 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 17 DAG size of output: 15 [2018-10-10 15:41:31,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-10 15:41:31,428 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-10 15:41:31,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-10-10 15:41:31,429 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 195 [2018-10-10 15:41:31,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-10 15:41:31,429 INFO L225 Difference]: With dead ends: 194 [2018-10-10 15:41:31,430 INFO L226 Difference]: Without dead ends: 0 [2018-10-10 15:41:31,430 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2018-10-10 15:41:31,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-10-10 15:41:31,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-10-10 15:41:31,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-10-10 15:41:31,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-10-10 15:41:31,431 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 195 [2018-10-10 15:41:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-10 15:41:31,431 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-10 15:41:31,431 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-10 15:41:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-10-10 15:41:31,431 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-10-10 15:41:31,436 INFO L202 PluginConnector]: Adding new model memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.10 03:41:31 BoogieIcfgContainer [2018-10-10 15:41:31,436 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-10-10 15:41:31,437 INFO L168 Benchmark]: Toolchain (without parser) took 231696.74 ms. Allocated memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: -66.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 425.0 MB). Peak memory consumption was 358.4 MB. Max. memory is 7.1 GB. [2018-10-10 15:41:31,438 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:41:31,439 INFO L168 Benchmark]: Boogie Preprocessor took 48.45 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-10-10 15:41:31,439 INFO L168 Benchmark]: RCFGBuilder took 618.03 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. [2018-10-10 15:41:31,440 INFO L168 Benchmark]: TraceAbstraction took 231026.01 ms. Allocated memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: -66.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 403.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 7.1 GB. [2018-10-10 15:41:31,442 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.16 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.45 ms. Allocated memory is still 1.6 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 618.03 ms. Allocated memory is still 1.6 GB. Free memory was 1.5 GB in the beginning and 1.5 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 231026.01 ms. Allocated memory was 1.6 GB in the beginning and 1.5 GB in the end (delta: -66.6 MB). Free memory was 1.5 GB in the beginning and 1.1 GB in the end (delta: 403.9 MB). Peak memory consumption was 337.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 79]: 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, 39 locations, 1 error locations. SAFE Result, 230.9s OverallTime, 81 OverallIterations, 80 TraceHistogramMax, 131.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 2583 SDtfs, 7759 SDslu, 79122 SDs, 0 SdLazy, 20503 SolverSat, 3350 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 18.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 6658 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 6495 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85339 ImplicationChecksByTransitivity, 201.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=80, 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, 81 MinimizatonAttempts, 79 StatesRemovedByMinimization, 79 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 96.2s InterpolantComputationTime, 9315 NumberOfCodeBlocks, 9315 NumberOfCodeBlocksAsserted, 81 NumberOfCheckSat, 9234 ConstructedInterpolants, 0 QuantifiedInterpolants, 5148422 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 81 InterpolantComputations, 2 PerfectInterpolantSequences, 6400/173880 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/memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-Benchmark-0-2018-10-10_15-41-31-460.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/memsetNonZero_true-valid-memsafety_true-termination.c_4.bpl_heapsep-2018-09-18.epf_AutomizerBpl.xml/Csv-TraceAbstractionBenchmarks-0-2018-10-10_15-41-31-460.csv Received shutdown request...