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/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-d769cf3 [2018-10-15 14:57:26,233 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-15 14:57:26,235 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-15 14:57:26,246 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-15 14:57:26,246 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-15 14:57:26,247 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-15 14:57:26,248 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-15 14:57:26,250 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-15 14:57:26,251 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-15 14:57:26,252 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-15 14:57:26,253 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-15 14:57:26,253 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-15 14:57:26,254 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-15 14:57:26,255 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-15 14:57:26,256 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-15 14:57:26,257 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-15 14:57:26,258 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-15 14:57:26,259 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-15 14:57:26,261 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-15 14:57:26,263 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-15 14:57:26,264 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-15 14:57:26,265 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-15 14:57:26,268 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-15 14:57:26,268 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-15 14:57:26,268 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-15 14:57:26,269 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-15 14:57:26,270 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-15 14:57:26,271 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-15 14:57:26,272 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-15 14:57:26,273 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-15 14:57:26,273 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-15 14:57:26,274 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-15 14:57:26,274 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-15 14:57:26,274 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-15 14:57:26,275 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-15 14:57:26,276 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-15 14:57:26,276 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/heapseparator/heapsep-2018-09-18.epf [2018-10-15 14:57:26,286 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-15 14:57:26,286 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-15 14:57:26,287 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-10-15 14:57:26,287 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=VPDomain [2018-10-15 14:57:26,287 INFO L133 SettingsManager]: * Parallel states before merging=1 [2018-10-15 14:57:26,287 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-10-15 14:57:26,288 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-15 14:57:26,288 INFO L133 SettingsManager]: * Size of a code block=SingleStatement [2018-10-15 14:57:26,288 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-15 14:57:26,289 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_TreeInterpolation [2018-10-15 14:57:26,289 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-10-15 14:57:26,289 INFO L133 SettingsManager]: * Order in Petri net unfolding=Ken McMillan [2018-10-15 14:57:26,289 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2018-10-15 14:57:26,290 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-15 14:57:26,290 INFO L133 SettingsManager]: * TransformationType=HEAP_SEPARATOR [2018-10-15 14:57:26,338 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-15 14:57:26,356 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-15 14:57:26,364 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-15 14:57:26,366 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-10-15 14:57:26,367 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-10-15 14:57:26,368 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl [2018-10-15 14:57:26,368 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/count_by_nondet.i_3.bpl' [2018-10-15 14:57:26,430 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-15 14:57:26,432 INFO L131 ToolchainWalker]: Walking toolchain with 3 elements. [2018-10-15 14:57:26,432 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-15 14:57:26,433 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-15 14:57:26,433 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-15 14:57:26,461 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,473 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,474 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,480 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,481 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... [2018-10-15 14:57:26,483 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-15 14:57:26,484 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-15 14:57:26,484 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-15 14:57:26,485 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-15 14:57:26,486 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-15 14:57:26,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-15 14:57:26,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-15 14:57:27,000 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-15 14:57:27,001 INFO L202 PluginConnector]: Adding new model count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:27 BoogieIcfgContainer [2018-10-15 14:57:27,001 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-15 14:57:27,003 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-10-15 14:57:27,003 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-10-15 14:57:27,016 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-10-15 14:57:27,019 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 15.10 02:57:26" (1/2) ... [2018-10-15 14:57:27,020 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6dfc14ac and model type count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 02:57:27, skipping insertion in model container [2018-10-15 14:57:27,023 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "count_by_nondet.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 02:57:27" (2/2) ... [2018-10-15 14:57:27,026 INFO L112 eAbstractionObserver]: Analyzing ICFG count_by_nondet.i_3.bpl [2018-10-15 14:57:27,048 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_TreeInterpolation Determinization: PREDICATE_ABSTRACTION [2018-10-15 14:57:27,068 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-10-15 14:57:27,096 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-10-15 14:57:27,126 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-10-15 14:57:27,127 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-10-15 14:57:27,128 INFO L383 AbstractCegarLoop]: Hoare is false [2018-10-15 14:57:27,128 INFO L384 AbstractCegarLoop]: Compute interpolants for Craig_TreeInterpolation [2018-10-15 14:57:27,128 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-15 14:57:27,128 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-15 14:57:27,128 INFO L387 AbstractCegarLoop]: Difference is false [2018-10-15 14:57:27,129 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-15 14:57:27,129 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-10-15 14:57:27,146 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2018-10-15 14:57:27,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-10-15 14:57:27,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,156 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,157 INFO L424 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,163 INFO L82 PathProgramCache]: Analyzing trace with hash 502726133, now seen corresponding path program 1 times [2018-10-15 14:57:27,232 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:27,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:27,341 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-15 14:57:27,341 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-15 14:57:27,345 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-10-15 14:57:27,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-15 14:57:27,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:27,361 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 3 states. [2018-10-15 14:57:27,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:27,414 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-10-15 14:57:27,414 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-15 14:57:27,416 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-10-15 14:57:27,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:27,426 INFO L225 Difference]: With dead ends: 28 [2018-10-15 14:57:27,426 INFO L226 Difference]: Without dead ends: 28 [2018-10-15 14:57:27,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-15 14:57:27,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2018-10-15 14:57:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 23. [2018-10-15 14:57:27,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-10-15 14:57:27,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-10-15 14:57:27,464 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 12 [2018-10-15 14:57:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:27,465 INFO L481 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-10-15 14:57:27,465 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-10-15 14:57:27,465 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-10-15 14:57:27,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-10-15 14:57:27,466 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,466 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,467 INFO L424 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,467 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,467 INFO L82 PathProgramCache]: Analyzing trace with hash 1572924772, now seen corresponding path program 1 times [2018-10-15 14:57:27,468 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:27,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:27,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:27,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-10-15 14:57:27,591 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-10-15 14:57:27,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-10-15 14:57:27,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2018-10-15 14:57:27,592 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 5 states. [2018-10-15 14:57:27,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:27,739 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-10-15 14:57:27,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-10-15 14:57:27,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-10-15 14:57:27,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:27,741 INFO L225 Difference]: With dead ends: 33 [2018-10-15 14:57:27,741 INFO L226 Difference]: Without dead ends: 33 [2018-10-15 14:57:27,742 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2018-10-15 14:57:27,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-10-15 14:57:27,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-10-15 14:57:27,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-10-15 14:57:27,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-10-15 14:57:27,747 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 22 [2018-10-15 14:57:27,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:27,748 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-10-15 14:57:27,748 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-10-15 14:57:27,748 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-10-15 14:57:27,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-10-15 14:57:27,749 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:27,750 INFO L375 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:27,750 INFO L424 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:27,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:27,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1213570579, now seen corresponding path program 2 times [2018-10-15 14:57:27,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:27,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:27,959 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:27,959 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:27,959 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-10-15 14:57:27,960 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-10-15 14:57:27,960 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-10-15 14:57:27,961 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2018-10-15 14:57:27,961 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 9 states. [2018-10-15 14:57:28,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:28,492 INFO L93 Difference]: Finished difference Result 54 states and 54 transitions. [2018-10-15 14:57:28,493 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-10-15 14:57:28,493 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 32 [2018-10-15 14:57:28,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:28,495 INFO L225 Difference]: With dead ends: 54 [2018-10-15 14:57:28,495 INFO L226 Difference]: Without dead ends: 50 [2018-10-15 14:57:28,496 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:28,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-10-15 14:57:28,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2018-10-15 14:57:28,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-10-15 14:57:28,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-10-15 14:57:28,503 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 32 [2018-10-15 14:57:28,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:28,503 INFO L481 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-10-15 14:57:28,504 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-10-15 14:57:28,504 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-10-15 14:57:28,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-10-15 14:57:28,505 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:28,505 INFO L375 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:28,506 INFO L424 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:28,506 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:28,507 INFO L82 PathProgramCache]: Analyzing trace with hash 220495874, now seen corresponding path program 3 times [2018-10-15 14:57:28,508 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:28,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:28,717 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:28,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:28,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-10-15 14:57:28,718 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-10-15 14:57:28,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-10-15 14:57:28,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2018-10-15 14:57:28,719 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 11 states. [2018-10-15 14:57:29,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:29,310 INFO L93 Difference]: Finished difference Result 64 states and 64 transitions. [2018-10-15 14:57:29,311 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-10-15 14:57:29,311 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 42 [2018-10-15 14:57:29,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:29,312 INFO L225 Difference]: With dead ends: 64 [2018-10-15 14:57:29,313 INFO L226 Difference]: Without dead ends: 60 [2018-10-15 14:57:29,314 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:29,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-10-15 14:57:29,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 53. [2018-10-15 14:57:29,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-10-15 14:57:29,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-10-15 14:57:29,322 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 42 [2018-10-15 14:57:29,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:29,322 INFO L481 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-10-15 14:57:29,323 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-10-15 14:57:29,323 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-10-15 14:57:29,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-10-15 14:57:29,324 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:29,325 INFO L375 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:29,325 INFO L424 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:29,325 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:29,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1424948431, now seen corresponding path program 4 times [2018-10-15 14:57:29,326 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:29,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:29,536 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 0 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:29,537 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:29,537 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-10-15 14:57:29,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-10-15 14:57:29,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-10-15 14:57:29,538 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2018-10-15 14:57:29,539 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 13 states. [2018-10-15 14:57:29,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:29,958 INFO L93 Difference]: Finished difference Result 74 states and 74 transitions. [2018-10-15 14:57:29,959 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-10-15 14:57:29,959 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2018-10-15 14:57:29,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:29,963 INFO L225 Difference]: With dead ends: 74 [2018-10-15 14:57:29,963 INFO L226 Difference]: Without dead ends: 70 [2018-10-15 14:57:29,966 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=369, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:29,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-10-15 14:57:29,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 63. [2018-10-15 14:57:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-10-15 14:57:29,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-10-15 14:57:29,977 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 52 [2018-10-15 14:57:29,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:29,979 INFO L481 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-10-15 14:57:29,980 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-10-15 14:57:29,980 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-10-15 14:57:29,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-10-15 14:57:29,983 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:29,984 INFO L375 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:29,985 INFO L424 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:29,985 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:29,985 INFO L82 PathProgramCache]: Analyzing trace with hash 796039072, now seen corresponding path program 5 times [2018-10-15 14:57:29,987 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:30,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:30,382 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:30,383 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:30,383 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-10-15 14:57:30,384 INFO L460 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-10-15 14:57:30,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-10-15 14:57:30,384 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2018-10-15 14:57:30,385 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 15 states. [2018-10-15 14:57:30,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:30,800 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2018-10-15 14:57:30,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-10-15 14:57:30,800 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 62 [2018-10-15 14:57:30,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:30,802 INFO L225 Difference]: With dead ends: 84 [2018-10-15 14:57:30,802 INFO L226 Difference]: Without dead ends: 80 [2018-10-15 14:57:30,803 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=510, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:30,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-10-15 14:57:30,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 73. [2018-10-15 14:57:30,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-10-15 14:57:30,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-10-15 14:57:30,812 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 62 [2018-10-15 14:57:30,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:30,813 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-10-15 14:57:30,813 INFO L482 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-10-15 14:57:30,813 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-10-15 14:57:30,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-10-15 14:57:30,814 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:30,815 INFO L375 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:30,815 INFO L424 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:30,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:30,815 INFO L82 PathProgramCache]: Analyzing trace with hash 890547535, now seen corresponding path program 6 times [2018-10-15 14:57:30,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:30,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:31,162 INFO L134 CoverageAnalysis]: Checked inductivity of 162 backedges. 0 proven. 162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:31,162 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:31,163 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-10-15 14:57:31,163 INFO L460 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-10-15 14:57:31,164 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-10-15 14:57:31,164 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2018-10-15 14:57:31,164 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 17 states. [2018-10-15 14:57:31,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:31,474 INFO L93 Difference]: Finished difference Result 94 states and 94 transitions. [2018-10-15 14:57:31,475 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-10-15 14:57:31,475 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 72 [2018-10-15 14:57:31,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:31,477 INFO L225 Difference]: With dead ends: 94 [2018-10-15 14:57:31,478 INFO L226 Difference]: Without dead ends: 90 [2018-10-15 14:57:31,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 142 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=257, Invalid=673, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:31,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-10-15 14:57:31,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 83. [2018-10-15 14:57:31,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-10-15 14:57:31,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-10-15 14:57:31,485 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 72 [2018-10-15 14:57:31,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:31,485 INFO L481 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-10-15 14:57:31,486 INFO L482 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-10-15 14:57:31,486 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-10-15 14:57:31,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-10-15 14:57:31,487 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:31,487 INFO L375 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:31,488 INFO L424 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:31,488 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:31,488 INFO L82 PathProgramCache]: Analyzing trace with hash -1556696002, now seen corresponding path program 7 times [2018-10-15 14:57:31,489 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:31,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:31,737 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:31,738 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:31,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-10-15 14:57:31,739 INFO L460 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-10-15 14:57:31,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-10-15 14:57:31,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2018-10-15 14:57:31,740 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 19 states. [2018-10-15 14:57:32,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:32,378 INFO L93 Difference]: Finished difference Result 104 states and 104 transitions. [2018-10-15 14:57:32,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-10-15 14:57:32,379 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 82 [2018-10-15 14:57:32,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:32,381 INFO L225 Difference]: With dead ends: 104 [2018-10-15 14:57:32,381 INFO L226 Difference]: Without dead ends: 100 [2018-10-15 14:57:32,382 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 187 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=332, Invalid=858, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:32,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-10-15 14:57:32,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 93. [2018-10-15 14:57:32,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-10-15 14:57:32,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-10-15 14:57:32,389 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 82 [2018-10-15 14:57:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:32,389 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-10-15 14:57:32,390 INFO L482 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-10-15 14:57:32,390 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-10-15 14:57:32,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-10-15 14:57:32,391 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:32,392 INFO L375 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:32,392 INFO L424 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:32,392 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:32,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1400103827, now seen corresponding path program 8 times [2018-10-15 14:57:32,393 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:32,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:32,886 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 296 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:32,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:32,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-10-15 14:57:32,887 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-10-15 14:57:32,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-10-15 14:57:32,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=317, Unknown=0, NotChecked=0, Total=420 [2018-10-15 14:57:32,888 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 21 states. [2018-10-15 14:57:33,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:33,304 INFO L93 Difference]: Finished difference Result 114 states and 114 transitions. [2018-10-15 14:57:33,305 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-10-15 14:57:33,305 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 92 [2018-10-15 14:57:33,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:33,306 INFO L225 Difference]: With dead ends: 114 [2018-10-15 14:57:33,306 INFO L226 Difference]: Without dead ends: 110 [2018-10-15 14:57:33,308 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=417, Invalid=1065, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:33,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-10-15 14:57:33,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2018-10-15 14:57:33,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-10-15 14:57:33,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-10-15 14:57:33,316 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 92 [2018-10-15 14:57:33,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:33,317 INFO L481 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-10-15 14:57:33,317 INFO L482 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-10-15 14:57:33,317 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-10-15 14:57:33,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-10-15 14:57:33,319 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:33,319 INFO L375 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:33,322 INFO L424 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:33,322 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:33,323 INFO L82 PathProgramCache]: Analyzing trace with hash 238835164, now seen corresponding path program 9 times [2018-10-15 14:57:33,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:33,698 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:33,698 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:33,698 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-10-15 14:57:33,699 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-10-15 14:57:33,699 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-10-15 14:57:33,699 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=382, Unknown=0, NotChecked=0, Total=506 [2018-10-15 14:57:33,700 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 23 states. [2018-10-15 14:57:34,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:34,108 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2018-10-15 14:57:34,108 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-10-15 14:57:34,109 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 102 [2018-10-15 14:57:34,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:34,110 INFO L225 Difference]: With dead ends: 124 [2018-10-15 14:57:34,110 INFO L226 Difference]: Without dead ends: 120 [2018-10-15 14:57:34,112 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 295 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=512, Invalid=1294, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:34,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2018-10-15 14:57:34,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 113. [2018-10-15 14:57:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-10-15 14:57:34,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-10-15 14:57:34,121 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 102 [2018-10-15 14:57:34,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:34,121 INFO L481 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-10-15 14:57:34,121 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-10-15 14:57:34,121 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-10-15 14:57:34,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-10-15 14:57:34,123 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:34,123 INFO L375 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:34,123 INFO L424 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:34,123 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:34,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1897738101, now seen corresponding path program 10 times [2018-10-15 14:57:34,124 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:34,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:34,472 INFO L134 CoverageAnalysis]: Checked inductivity of 470 backedges. 0 proven. 470 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:34,472 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:34,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-10-15 14:57:34,473 INFO L460 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-10-15 14:57:34,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-10-15 14:57:34,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=453, Unknown=0, NotChecked=0, Total=600 [2018-10-15 14:57:34,474 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 25 states. [2018-10-15 14:57:34,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:34,932 INFO L93 Difference]: Finished difference Result 134 states and 134 transitions. [2018-10-15 14:57:34,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-10-15 14:57:34,933 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 112 [2018-10-15 14:57:34,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:34,934 INFO L225 Difference]: With dead ends: 134 [2018-10-15 14:57:34,934 INFO L226 Difference]: Without dead ends: 130 [2018-10-15 14:57:34,936 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=617, Invalid=1545, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:34,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2018-10-15 14:57:34,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 123. [2018-10-15 14:57:34,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-10-15 14:57:34,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-10-15 14:57:34,941 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 112 [2018-10-15 14:57:34,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:34,941 INFO L481 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-10-15 14:57:34,941 INFO L482 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-10-15 14:57:34,941 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-10-15 14:57:34,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-10-15 14:57:34,943 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:34,943 INFO L375 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:34,943 INFO L424 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:34,944 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:34,944 INFO L82 PathProgramCache]: Analyzing trace with hash -1114702726, now seen corresponding path program 11 times [2018-10-15 14:57:34,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:35,297 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 0 proven. 572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:35,297 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:35,297 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-10-15 14:57:35,298 INFO L460 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-10-15 14:57:35,298 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-10-15 14:57:35,298 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=530, Unknown=0, NotChecked=0, Total=702 [2018-10-15 14:57:35,298 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 27 states. [2018-10-15 14:57:36,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:36,248 INFO L93 Difference]: Finished difference Result 144 states and 144 transitions. [2018-10-15 14:57:36,248 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-10-15 14:57:36,248 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 122 [2018-10-15 14:57:36,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:36,250 INFO L225 Difference]: With dead ends: 144 [2018-10-15 14:57:36,250 INFO L226 Difference]: Without dead ends: 140 [2018-10-15 14:57:36,251 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 427 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=732, Invalid=1818, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:36,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2018-10-15 14:57:36,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 133. [2018-10-15 14:57:36,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-10-15 14:57:36,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-10-15 14:57:36,256 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 122 [2018-10-15 14:57:36,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:36,256 INFO L481 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-10-15 14:57:36,256 INFO L482 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-10-15 14:57:36,256 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-10-15 14:57:36,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-10-15 14:57:36,258 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:36,258 INFO L375 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:36,258 INFO L424 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:36,259 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:36,259 INFO L82 PathProgramCache]: Analyzing trace with hash -255571543, now seen corresponding path program 12 times [2018-10-15 14:57:36,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:36,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:36,875 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 684 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:36,876 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:36,876 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-10-15 14:57:36,876 INFO L460 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-10-15 14:57:36,876 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-10-15 14:57:36,877 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=613, Unknown=0, NotChecked=0, Total=812 [2018-10-15 14:57:36,877 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 29 states. [2018-10-15 14:57:37,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:37,996 INFO L93 Difference]: Finished difference Result 154 states and 154 transitions. [2018-10-15 14:57:37,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-10-15 14:57:37,997 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 132 [2018-10-15 14:57:37,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:37,998 INFO L225 Difference]: With dead ends: 154 [2018-10-15 14:57:37,998 INFO L226 Difference]: Without dead ends: 150 [2018-10-15 14:57:37,999 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 502 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=857, Invalid=2113, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:57:38,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2018-10-15 14:57:38,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 143. [2018-10-15 14:57:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-10-15 14:57:38,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-10-15 14:57:38,006 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 132 [2018-10-15 14:57:38,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:38,006 INFO L481 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-10-15 14:57:38,006 INFO L482 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-10-15 14:57:38,007 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-10-15 14:57:38,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-10-15 14:57:38,017 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:38,017 INFO L375 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:38,018 INFO L424 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:38,018 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:38,018 INFO L82 PathProgramCache]: Analyzing trace with hash -2055591912, now seen corresponding path program 13 times [2018-10-15 14:57:38,019 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:38,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:39,248 INFO L134 CoverageAnalysis]: Checked inductivity of 806 backedges. 0 proven. 806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:39,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:39,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-10-15 14:57:39,250 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-10-15 14:57:39,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-10-15 14:57:39,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=702, Unknown=0, NotChecked=0, Total=930 [2018-10-15 14:57:39,251 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 31 states. [2018-10-15 14:57:39,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:39,883 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2018-10-15 14:57:39,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-10-15 14:57:39,883 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 142 [2018-10-15 14:57:39,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:39,885 INFO L225 Difference]: With dead ends: 164 [2018-10-15 14:57:39,885 INFO L226 Difference]: Without dead ends: 160 [2018-10-15 14:57:39,887 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=992, Invalid=2430, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:57:39,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2018-10-15 14:57:39,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 153. [2018-10-15 14:57:39,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-10-15 14:57:39,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-10-15 14:57:39,890 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 142 [2018-10-15 14:57:39,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:39,890 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-10-15 14:57:39,890 INFO L482 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-10-15 14:57:39,891 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-10-15 14:57:39,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-10-15 14:57:39,892 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:39,892 INFO L375 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:39,892 INFO L424 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:39,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:39,893 INFO L82 PathProgramCache]: Analyzing trace with hash 1578895303, now seen corresponding path program 14 times [2018-10-15 14:57:39,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:39,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:40,329 INFO L134 CoverageAnalysis]: Checked inductivity of 938 backedges. 0 proven. 938 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:40,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:40,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-10-15 14:57:40,330 INFO L460 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-10-15 14:57:40,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-10-15 14:57:40,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=797, Unknown=0, NotChecked=0, Total=1056 [2018-10-15 14:57:40,331 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 33 states. [2018-10-15 14:57:41,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:41,143 INFO L93 Difference]: Finished difference Result 174 states and 174 transitions. [2018-10-15 14:57:41,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-10-15 14:57:41,144 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 152 [2018-10-15 14:57:41,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:41,146 INFO L225 Difference]: With dead ends: 174 [2018-10-15 14:57:41,146 INFO L226 Difference]: Without dead ends: 170 [2018-10-15 14:57:41,150 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1137, Invalid=2769, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:57:41,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2018-10-15 14:57:41,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 163. [2018-10-15 14:57:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-10-15 14:57:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-10-15 14:57:41,153 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 152 [2018-10-15 14:57:41,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:41,154 INFO L481 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-10-15 14:57:41,154 INFO L482 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-10-15 14:57:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-10-15 14:57:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-10-15 14:57:41,155 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:41,155 INFO L375 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:41,155 INFO L424 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:41,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:41,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1584834378, now seen corresponding path program 15 times [2018-10-15 14:57:41,156 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:41,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:41,628 INFO L134 CoverageAnalysis]: Checked inductivity of 1080 backedges. 0 proven. 1080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:41,628 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:41,628 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-10-15 14:57:41,629 INFO L460 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-10-15 14:57:41,629 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-10-15 14:57:41,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=292, Invalid=898, Unknown=0, NotChecked=0, Total=1190 [2018-10-15 14:57:41,630 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 35 states. [2018-10-15 14:57:42,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:42,474 INFO L93 Difference]: Finished difference Result 184 states and 184 transitions. [2018-10-15 14:57:42,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-10-15 14:57:42,475 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 162 [2018-10-15 14:57:42,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:42,476 INFO L225 Difference]: With dead ends: 184 [2018-10-15 14:57:42,477 INFO L226 Difference]: Without dead ends: 180 [2018-10-15 14:57:42,479 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1292, Invalid=3130, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:57:42,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2018-10-15 14:57:42,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 173. [2018-10-15 14:57:42,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-10-15 14:57:42,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-10-15 14:57:42,483 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 162 [2018-10-15 14:57:42,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:42,483 INFO L481 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-10-15 14:57:42,483 INFO L482 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-10-15 14:57:42,484 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-10-15 14:57:42,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-10-15 14:57:42,485 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:42,485 INFO L375 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:42,485 INFO L424 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:42,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:42,485 INFO L82 PathProgramCache]: Analyzing trace with hash -1172993307, now seen corresponding path program 16 times [2018-10-15 14:57:42,486 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:44,044 INFO L134 CoverageAnalysis]: Checked inductivity of 1232 backedges. 0 proven. 1232 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:44,044 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:44,044 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-10-15 14:57:44,045 INFO L460 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-10-15 14:57:44,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-10-15 14:57:44,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=327, Invalid=1005, Unknown=0, NotChecked=0, Total=1332 [2018-10-15 14:57:44,045 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 37 states. [2018-10-15 14:57:44,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:44,890 INFO L93 Difference]: Finished difference Result 194 states and 194 transitions. [2018-10-15 14:57:44,890 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-10-15 14:57:44,891 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 172 [2018-10-15 14:57:44,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:44,892 INFO L225 Difference]: With dead ends: 194 [2018-10-15 14:57:44,893 INFO L226 Difference]: Without dead ends: 190 [2018-10-15 14:57:44,895 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 862 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=1457, Invalid=3513, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:57:44,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2018-10-15 14:57:44,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 183. [2018-10-15 14:57:44,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-10-15 14:57:44,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-10-15 14:57:44,899 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 172 [2018-10-15 14:57:44,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:44,900 INFO L481 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-10-15 14:57:44,900 INFO L482 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-10-15 14:57:44,900 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-10-15 14:57:44,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-10-15 14:57:44,901 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:44,901 INFO L375 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:44,901 INFO L424 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:44,901 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:44,902 INFO L82 PathProgramCache]: Analyzing trace with hash -1803022764, now seen corresponding path program 17 times [2018-10-15 14:57:44,902 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:44,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:45,556 INFO L134 CoverageAnalysis]: Checked inductivity of 1394 backedges. 0 proven. 1394 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:45,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:45,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-10-15 14:57:45,557 INFO L460 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-10-15 14:57:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-10-15 14:57:45,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=1118, Unknown=0, NotChecked=0, Total=1482 [2018-10-15 14:57:45,558 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 39 states. [2018-10-15 14:57:46,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:46,676 INFO L93 Difference]: Finished difference Result 204 states and 204 transitions. [2018-10-15 14:57:46,676 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-10-15 14:57:46,677 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 182 [2018-10-15 14:57:46,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:46,678 INFO L225 Difference]: With dead ends: 204 [2018-10-15 14:57:46,678 INFO L226 Difference]: Without dead ends: 200 [2018-10-15 14:57:46,681 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 967 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=1632, Invalid=3918, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:57:46,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2018-10-15 14:57:46,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 193. [2018-10-15 14:57:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-10-15 14:57:46,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-10-15 14:57:46,685 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 182 [2018-10-15 14:57:46,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:46,685 INFO L481 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-10-15 14:57:46,685 INFO L482 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-10-15 14:57:46,685 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-10-15 14:57:46,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-10-15 14:57:46,686 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:46,686 INFO L375 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:46,687 INFO L424 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:46,687 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:46,687 INFO L82 PathProgramCache]: Analyzing trace with hash 521949955, now seen corresponding path program 18 times [2018-10-15 14:57:46,688 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:46,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:47,474 INFO L134 CoverageAnalysis]: Checked inductivity of 1566 backedges. 0 proven. 1566 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:47,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:47,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-10-15 14:57:47,475 INFO L460 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-10-15 14:57:47,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-10-15 14:57:47,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=403, Invalid=1237, Unknown=0, NotChecked=0, Total=1640 [2018-10-15 14:57:47,476 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 41 states. [2018-10-15 14:57:48,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:48,437 INFO L93 Difference]: Finished difference Result 214 states and 214 transitions. [2018-10-15 14:57:48,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-10-15 14:57:48,437 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 192 [2018-10-15 14:57:48,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:48,439 INFO L225 Difference]: With dead ends: 214 [2018-10-15 14:57:48,439 INFO L226 Difference]: Without dead ends: 210 [2018-10-15 14:57:48,442 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1078 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1817, Invalid=4345, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:57:48,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2018-10-15 14:57:48,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 203. [2018-10-15 14:57:48,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-10-15 14:57:48,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-10-15 14:57:48,446 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 192 [2018-10-15 14:57:48,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:48,447 INFO L481 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-10-15 14:57:48,447 INFO L482 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-10-15 14:57:48,447 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-10-15 14:57:48,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-10-15 14:57:48,448 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:48,448 INFO L375 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:48,448 INFO L424 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:48,448 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:48,448 INFO L82 PathProgramCache]: Analyzing trace with hash 142723314, now seen corresponding path program 19 times [2018-10-15 14:57:48,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:48,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:49,116 INFO L134 CoverageAnalysis]: Checked inductivity of 1748 backedges. 0 proven. 1748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:49,116 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:49,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-10-15 14:57:49,117 INFO L460 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-10-15 14:57:49,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-10-15 14:57:49,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=444, Invalid=1362, Unknown=0, NotChecked=0, Total=1806 [2018-10-15 14:57:49,118 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 43 states. [2018-10-15 14:57:50,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:50,120 INFO L93 Difference]: Finished difference Result 224 states and 224 transitions. [2018-10-15 14:57:50,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-10-15 14:57:50,121 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 202 [2018-10-15 14:57:50,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:50,123 INFO L225 Difference]: With dead ends: 224 [2018-10-15 14:57:50,123 INFO L226 Difference]: Without dead ends: 220 [2018-10-15 14:57:50,125 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1195 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=2012, Invalid=4794, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:57:50,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2018-10-15 14:57:50,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 213. [2018-10-15 14:57:50,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-10-15 14:57:50,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-10-15 14:57:50,129 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 202 [2018-10-15 14:57:50,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:50,130 INFO L481 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-10-15 14:57:50,130 INFO L482 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-10-15 14:57:50,130 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-10-15 14:57:50,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-10-15 14:57:50,131 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:50,131 INFO L375 BasicCegarLoop]: trace histogram [21, 20, 20, 20, 20, 20, 20, 20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:50,132 INFO L424 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:50,132 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:50,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1092886495, now seen corresponding path program 20 times [2018-10-15 14:57:50,133 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:50,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1940 backedges. 0 proven. 1940 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:50,831 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:50,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-10-15 14:57:50,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-10-15 14:57:50,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-10-15 14:57:50,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=487, Invalid=1493, Unknown=0, NotChecked=0, Total=1980 [2018-10-15 14:57:50,833 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 45 states. [2018-10-15 14:57:52,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:52,262 INFO L93 Difference]: Finished difference Result 234 states and 234 transitions. [2018-10-15 14:57:52,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-10-15 14:57:52,263 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 212 [2018-10-15 14:57:52,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:52,265 INFO L225 Difference]: With dead ends: 234 [2018-10-15 14:57:52,265 INFO L226 Difference]: Without dead ends: 230 [2018-10-15 14:57:52,266 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1318 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=2217, Invalid=5265, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:57:52,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2018-10-15 14:57:52,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 223. [2018-10-15 14:57:52,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-10-15 14:57:52,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-10-15 14:57:52,270 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 212 [2018-10-15 14:57:52,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:52,271 INFO L481 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-10-15 14:57:52,271 INFO L482 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-10-15 14:57:52,271 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-10-15 14:57:52,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-10-15 14:57:52,272 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:52,272 INFO L375 BasicCegarLoop]: trace histogram [22, 21, 21, 21, 21, 21, 21, 21, 21, 21, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:52,272 INFO L424 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:52,273 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:52,273 INFO L82 PathProgramCache]: Analyzing trace with hash -1363015536, now seen corresponding path program 21 times [2018-10-15 14:57:52,274 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:52,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:53,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 0 proven. 2142 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:53,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:53,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-10-15 14:57:53,268 INFO L460 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-10-15 14:57:53,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-10-15 14:57:53,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=532, Invalid=1630, Unknown=0, NotChecked=0, Total=2162 [2018-10-15 14:57:53,269 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 47 states. [2018-10-15 14:57:54,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:54,648 INFO L93 Difference]: Finished difference Result 244 states and 244 transitions. [2018-10-15 14:57:54,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-10-15 14:57:54,657 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 222 [2018-10-15 14:57:54,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:54,659 INFO L225 Difference]: With dead ends: 244 [2018-10-15 14:57:54,659 INFO L226 Difference]: Without dead ends: 240 [2018-10-15 14:57:54,660 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1447 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=2432, Invalid=5758, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:57:54,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2018-10-15 14:57:54,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 233. [2018-10-15 14:57:54,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-10-15 14:57:54,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-10-15 14:57:54,664 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 222 [2018-10-15 14:57:54,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:54,665 INFO L481 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-10-15 14:57:54,665 INFO L482 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-10-15 14:57:54,665 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-10-15 14:57:54,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-10-15 14:57:54,666 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:54,666 INFO L375 BasicCegarLoop]: trace histogram [23, 22, 22, 22, 22, 22, 22, 22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:54,666 INFO L424 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:54,667 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:54,667 INFO L82 PathProgramCache]: Analyzing trace with hash -1036012993, now seen corresponding path program 22 times [2018-10-15 14:57:54,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:54,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:55,662 INFO L134 CoverageAnalysis]: Checked inductivity of 2354 backedges. 0 proven. 2354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:55,662 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:55,662 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-10-15 14:57:55,663 INFO L460 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-10-15 14:57:55,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-10-15 14:57:55,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=579, Invalid=1773, Unknown=0, NotChecked=0, Total=2352 [2018-10-15 14:57:55,664 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 49 states. [2018-10-15 14:57:57,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:57:57,327 INFO L93 Difference]: Finished difference Result 254 states and 254 transitions. [2018-10-15 14:57:57,328 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-10-15 14:57:57,328 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 232 [2018-10-15 14:57:57,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:57:57,330 INFO L225 Difference]: With dead ends: 254 [2018-10-15 14:57:57,330 INFO L226 Difference]: Without dead ends: 250 [2018-10-15 14:57:57,332 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1582 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=2657, Invalid=6273, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:57:57,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2018-10-15 14:57:57,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2018-10-15 14:57:57,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-10-15 14:57:57,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-10-15 14:57:57,336 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 232 [2018-10-15 14:57:57,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:57:57,337 INFO L481 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-10-15 14:57:57,337 INFO L482 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-10-15 14:57:57,337 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-10-15 14:57:57,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-10-15 14:57:57,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:57:57,338 INFO L375 BasicCegarLoop]: trace histogram [24, 23, 23, 23, 23, 23, 23, 23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:57:57,339 INFO L424 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:57:57,339 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:57:57,339 INFO L82 PathProgramCache]: Analyzing trace with hash 534007086, now seen corresponding path program 23 times [2018-10-15 14:57:57,340 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:57:57,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:57:58,537 INFO L134 CoverageAnalysis]: Checked inductivity of 2576 backedges. 0 proven. 2576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:57:58,538 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:57:58,538 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-10-15 14:57:58,538 INFO L460 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-10-15 14:57:58,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-10-15 14:57:58,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=628, Invalid=1922, Unknown=0, NotChecked=0, Total=2550 [2018-10-15 14:57:58,539 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 51 states. [2018-10-15 14:58:00,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:00,104 INFO L93 Difference]: Finished difference Result 264 states and 264 transitions. [2018-10-15 14:58:00,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-10-15 14:58:00,105 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 242 [2018-10-15 14:58:00,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:00,107 INFO L225 Difference]: With dead ends: 264 [2018-10-15 14:58:00,107 INFO L226 Difference]: Without dead ends: 260 [2018-10-15 14:58:00,109 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1723 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=2892, Invalid=6810, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 14:58:00,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2018-10-15 14:58:00,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 253. [2018-10-15 14:58:00,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-10-15 14:58:00,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-10-15 14:58:00,114 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 242 [2018-10-15 14:58:00,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:00,115 INFO L481 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-10-15 14:58:00,115 INFO L482 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-10-15 14:58:00,115 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-10-15 14:58:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-10-15 14:58:00,116 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:00,116 INFO L375 BasicCegarLoop]: trace histogram [25, 24, 24, 24, 24, 24, 24, 24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:00,117 INFO L424 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:00,117 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:00,117 INFO L82 PathProgramCache]: Analyzing trace with hash 695421277, now seen corresponding path program 24 times [2018-10-15 14:58:00,118 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:00,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:01,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2808 backedges. 0 proven. 2808 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:01,106 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:01,106 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-10-15 14:58:01,106 INFO L460 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-10-15 14:58:01,107 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-10-15 14:58:01,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=679, Invalid=2077, Unknown=0, NotChecked=0, Total=2756 [2018-10-15 14:58:01,107 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 53 states. [2018-10-15 14:58:02,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:02,884 INFO L93 Difference]: Finished difference Result 274 states and 274 transitions. [2018-10-15 14:58:02,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-10-15 14:58:02,888 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 252 [2018-10-15 14:58:02,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:02,889 INFO L225 Difference]: With dead ends: 274 [2018-10-15 14:58:02,890 INFO L226 Difference]: Without dead ends: 270 [2018-10-15 14:58:02,891 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1870 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3137, Invalid=7369, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 14:58:02,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2018-10-15 14:58:02,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 263. [2018-10-15 14:58:02,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-10-15 14:58:02,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-10-15 14:58:02,895 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 252 [2018-10-15 14:58:02,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:02,896 INFO L481 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-10-15 14:58:02,896 INFO L482 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-10-15 14:58:02,896 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-10-15 14:58:02,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-10-15 14:58:02,897 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:02,897 INFO L375 BasicCegarLoop]: trace histogram [26, 25, 25, 25, 25, 25, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:02,898 INFO L424 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:02,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:02,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1148971316, now seen corresponding path program 25 times [2018-10-15 14:58:02,899 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:03,906 INFO L134 CoverageAnalysis]: Checked inductivity of 3050 backedges. 0 proven. 3050 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:03,907 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:03,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-10-15 14:58:03,907 INFO L460 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-10-15 14:58:03,908 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-10-15 14:58:03,908 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=732, Invalid=2238, Unknown=0, NotChecked=0, Total=2970 [2018-10-15 14:58:03,908 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 55 states. [2018-10-15 14:58:05,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:05,726 INFO L93 Difference]: Finished difference Result 284 states and 284 transitions. [2018-10-15 14:58:05,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-10-15 14:58:05,726 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 262 [2018-10-15 14:58:05,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:05,728 INFO L225 Difference]: With dead ends: 284 [2018-10-15 14:58:05,728 INFO L226 Difference]: Without dead ends: 280 [2018-10-15 14:58:05,729 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2023 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=3392, Invalid=7950, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 14:58:05,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2018-10-15 14:58:05,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 273. [2018-10-15 14:58:05,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-10-15 14:58:05,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-10-15 14:58:05,733 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 262 [2018-10-15 14:58:05,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:05,734 INFO L481 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-10-15 14:58:05,734 INFO L482 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-10-15 14:58:05,734 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-10-15 14:58:05,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-10-15 14:58:05,736 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:05,736 INFO L375 BasicCegarLoop]: trace histogram [27, 26, 26, 26, 26, 26, 26, 26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:05,736 INFO L424 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:05,736 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:05,737 INFO L82 PathProgramCache]: Analyzing trace with hash -1411242629, now seen corresponding path program 26 times [2018-10-15 14:58:05,737 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:07,433 INFO L134 CoverageAnalysis]: Checked inductivity of 3302 backedges. 0 proven. 3302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:07,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:07,434 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-10-15 14:58:07,434 INFO L460 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-10-15 14:58:07,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-10-15 14:58:07,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=787, Invalid=2405, Unknown=0, NotChecked=0, Total=3192 [2018-10-15 14:58:07,435 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 57 states. [2018-10-15 14:58:09,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:09,174 INFO L93 Difference]: Finished difference Result 294 states and 294 transitions. [2018-10-15 14:58:09,174 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-10-15 14:58:09,175 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 272 [2018-10-15 14:58:09,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:09,177 INFO L225 Difference]: With dead ends: 294 [2018-10-15 14:58:09,177 INFO L226 Difference]: Without dead ends: 290 [2018-10-15 14:58:09,178 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2182 ImplicationChecksByTransitivity, 3.0s TimeCoverageRelationStatistics Valid=3657, Invalid=8553, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 14:58:09,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2018-10-15 14:58:09,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 283. [2018-10-15 14:58:09,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 283 states. [2018-10-15 14:58:09,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 283 transitions. [2018-10-15 14:58:09,183 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 283 transitions. Word has length 272 [2018-10-15 14:58:09,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:09,183 INFO L481 AbstractCegarLoop]: Abstraction has 283 states and 283 transitions. [2018-10-15 14:58:09,183 INFO L482 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-10-15 14:58:09,184 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 283 transitions. [2018-10-15 14:58:09,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2018-10-15 14:58:09,185 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:09,185 INFO L375 BasicCegarLoop]: trace histogram [28, 27, 27, 27, 27, 27, 27, 27, 27, 27, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:09,185 INFO L424 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:09,186 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:09,186 INFO L82 PathProgramCache]: Analyzing trace with hash -1998789270, now seen corresponding path program 27 times [2018-10-15 14:58:09,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:10,690 INFO L134 CoverageAnalysis]: Checked inductivity of 3564 backedges. 0 proven. 3564 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:10,691 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:10,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-10-15 14:58:10,691 INFO L460 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-10-15 14:58:10,691 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-10-15 14:58:10,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=844, Invalid=2578, Unknown=0, NotChecked=0, Total=3422 [2018-10-15 14:58:10,692 INFO L87 Difference]: Start difference. First operand 283 states and 283 transitions. Second operand 59 states. [2018-10-15 14:58:12,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:12,691 INFO L93 Difference]: Finished difference Result 304 states and 304 transitions. [2018-10-15 14:58:12,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-10-15 14:58:12,691 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 282 [2018-10-15 14:58:12,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:12,693 INFO L225 Difference]: With dead ends: 304 [2018-10-15 14:58:12,693 INFO L226 Difference]: Without dead ends: 300 [2018-10-15 14:58:12,694 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2347 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=3932, Invalid=9178, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 14:58:12,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 300 states. [2018-10-15 14:58:12,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 300 to 293. [2018-10-15 14:58:12,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 293 states. [2018-10-15 14:58:12,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 293 transitions. [2018-10-15 14:58:12,698 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 293 transitions. Word has length 282 [2018-10-15 14:58:12,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:12,699 INFO L481 AbstractCegarLoop]: Abstraction has 293 states and 293 transitions. [2018-10-15 14:58:12,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-10-15 14:58:12,699 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 293 transitions. [2018-10-15 14:58:12,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2018-10-15 14:58:12,700 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:12,701 INFO L375 BasicCegarLoop]: trace histogram [29, 28, 28, 28, 28, 28, 28, 28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:12,701 INFO L424 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:12,701 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:12,701 INFO L82 PathProgramCache]: Analyzing trace with hash -1741175143, now seen corresponding path program 28 times [2018-10-15 14:58:12,702 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:15,620 INFO L134 CoverageAnalysis]: Checked inductivity of 3836 backedges. 0 proven. 3836 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:15,620 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:15,621 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-10-15 14:58:15,621 INFO L460 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-10-15 14:58:15,621 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-10-15 14:58:15,621 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=903, Invalid=2757, Unknown=0, NotChecked=0, Total=3660 [2018-10-15 14:58:15,622 INFO L87 Difference]: Start difference. First operand 293 states and 293 transitions. Second operand 61 states. [2018-10-15 14:58:17,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:17,782 INFO L93 Difference]: Finished difference Result 314 states and 314 transitions. [2018-10-15 14:58:17,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-10-15 14:58:17,782 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 292 [2018-10-15 14:58:17,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:17,784 INFO L225 Difference]: With dead ends: 314 [2018-10-15 14:58:17,785 INFO L226 Difference]: Without dead ends: 310 [2018-10-15 14:58:17,786 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2518 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=4217, Invalid=9825, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 14:58:17,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2018-10-15 14:58:17,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 303. [2018-10-15 14:58:17,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 303 states. [2018-10-15 14:58:17,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 303 transitions. [2018-10-15 14:58:17,790 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 303 transitions. Word has length 292 [2018-10-15 14:58:17,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:17,791 INFO L481 AbstractCegarLoop]: Abstraction has 303 states and 303 transitions. [2018-10-15 14:58:17,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-10-15 14:58:17,791 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 303 transitions. [2018-10-15 14:58:17,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2018-10-15 14:58:17,792 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:17,793 INFO L375 BasicCegarLoop]: trace histogram [30, 29, 29, 29, 29, 29, 29, 29, 29, 29, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:17,793 INFO L424 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:17,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:17,793 INFO L82 PathProgramCache]: Analyzing trace with hash 371865864, now seen corresponding path program 29 times [2018-10-15 14:58:17,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:17,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:19,362 INFO L134 CoverageAnalysis]: Checked inductivity of 4118 backedges. 0 proven. 4118 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:19,362 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:19,362 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-10-15 14:58:19,363 INFO L460 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-10-15 14:58:19,363 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-10-15 14:58:19,363 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=964, Invalid=2942, Unknown=0, NotChecked=0, Total=3906 [2018-10-15 14:58:19,364 INFO L87 Difference]: Start difference. First operand 303 states and 303 transitions. Second operand 63 states. [2018-10-15 14:58:22,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:22,424 INFO L93 Difference]: Finished difference Result 324 states and 324 transitions. [2018-10-15 14:58:22,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-10-15 14:58:22,424 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 302 [2018-10-15 14:58:22,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:22,426 INFO L225 Difference]: With dead ends: 324 [2018-10-15 14:58:22,426 INFO L226 Difference]: Without dead ends: 320 [2018-10-15 14:58:22,428 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2695 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=4512, Invalid=10494, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 14:58:22,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 320 states. [2018-10-15 14:58:22,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 320 to 313. [2018-10-15 14:58:22,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 313 states. [2018-10-15 14:58:22,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 313 transitions. [2018-10-15 14:58:22,432 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 313 transitions. Word has length 302 [2018-10-15 14:58:22,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:22,433 INFO L481 AbstractCegarLoop]: Abstraction has 313 states and 313 transitions. [2018-10-15 14:58:22,433 INFO L482 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-10-15 14:58:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 313 transitions. [2018-10-15 14:58:22,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2018-10-15 14:58:22,435 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:22,435 INFO L375 BasicCegarLoop]: trace histogram [31, 30, 30, 30, 30, 30, 30, 30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:22,436 INFO L424 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:22,436 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:22,436 INFO L82 PathProgramCache]: Analyzing trace with hash -1268798281, now seen corresponding path program 30 times [2018-10-15 14:58:22,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:24,453 INFO L134 CoverageAnalysis]: Checked inductivity of 4410 backedges. 0 proven. 4410 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:24,454 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:24,454 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-10-15 14:58:24,455 INFO L460 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-10-15 14:58:24,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-10-15 14:58:24,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1027, Invalid=3133, Unknown=0, NotChecked=0, Total=4160 [2018-10-15 14:58:24,455 INFO L87 Difference]: Start difference. First operand 313 states and 313 transitions. Second operand 65 states. [2018-10-15 14:58:26,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:26,546 INFO L93 Difference]: Finished difference Result 334 states and 334 transitions. [2018-10-15 14:58:26,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-10-15 14:58:26,547 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 312 [2018-10-15 14:58:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:26,549 INFO L225 Difference]: With dead ends: 334 [2018-10-15 14:58:26,549 INFO L226 Difference]: Without dead ends: 330 [2018-10-15 14:58:26,550 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2878 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=4817, Invalid=11185, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 14:58:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 330 states. [2018-10-15 14:58:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 330 to 323. [2018-10-15 14:58:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 323 states. [2018-10-15 14:58:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 323 states to 323 states and 323 transitions. [2018-10-15 14:58:26,555 INFO L78 Accepts]: Start accepts. Automaton has 323 states and 323 transitions. Word has length 312 [2018-10-15 14:58:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:26,555 INFO L481 AbstractCegarLoop]: Abstraction has 323 states and 323 transitions. [2018-10-15 14:58:26,555 INFO L482 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-10-15 14:58:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 323 transitions. [2018-10-15 14:58:26,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2018-10-15 14:58:26,557 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:26,557 INFO L375 BasicCegarLoop]: trace histogram [32, 31, 31, 31, 31, 31, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:26,557 INFO L424 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:26,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:26,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1492619686, now seen corresponding path program 31 times [2018-10-15 14:58:26,558 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:28,523 INFO L134 CoverageAnalysis]: Checked inductivity of 4712 backedges. 0 proven. 4712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:28,524 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:28,524 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-10-15 14:58:28,524 INFO L460 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-10-15 14:58:28,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-10-15 14:58:28,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1092, Invalid=3330, Unknown=0, NotChecked=0, Total=4422 [2018-10-15 14:58:28,525 INFO L87 Difference]: Start difference. First operand 323 states and 323 transitions. Second operand 67 states. [2018-10-15 14:58:31,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:31,001 INFO L93 Difference]: Finished difference Result 344 states and 344 transitions. [2018-10-15 14:58:31,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-10-15 14:58:31,002 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 322 [2018-10-15 14:58:31,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:31,004 INFO L225 Difference]: With dead ends: 344 [2018-10-15 14:58:31,004 INFO L226 Difference]: Without dead ends: 340 [2018-10-15 14:58:31,005 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3067 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5132, Invalid=11898, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 14:58:31,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2018-10-15 14:58:31,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 333. [2018-10-15 14:58:31,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2018-10-15 14:58:31,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 333 transitions. [2018-10-15 14:58:31,010 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 333 transitions. Word has length 322 [2018-10-15 14:58:31,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:31,010 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 333 transitions. [2018-10-15 14:58:31,010 INFO L482 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-10-15 14:58:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 333 transitions. [2018-10-15 14:58:31,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2018-10-15 14:58:31,012 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:31,012 INFO L375 BasicCegarLoop]: trace histogram [33, 32, 32, 32, 32, 32, 32, 32, 32, 32, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:31,013 INFO L424 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:31,013 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:31,013 INFO L82 PathProgramCache]: Analyzing trace with hash 495278037, now seen corresponding path program 32 times [2018-10-15 14:58:31,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:33,005 INFO L134 CoverageAnalysis]: Checked inductivity of 5024 backedges. 0 proven. 5024 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:33,006 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:33,006 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-10-15 14:58:33,006 INFO L460 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-10-15 14:58:33,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-10-15 14:58:33,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1159, Invalid=3533, Unknown=0, NotChecked=0, Total=4692 [2018-10-15 14:58:33,007 INFO L87 Difference]: Start difference. First operand 333 states and 333 transitions. Second operand 69 states. [2018-10-15 14:58:35,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:35,641 INFO L93 Difference]: Finished difference Result 354 states and 354 transitions. [2018-10-15 14:58:35,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-10-15 14:58:35,641 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 332 [2018-10-15 14:58:35,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:35,644 INFO L225 Difference]: With dead ends: 354 [2018-10-15 14:58:35,644 INFO L226 Difference]: Without dead ends: 350 [2018-10-15 14:58:35,645 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3262 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=5457, Invalid=12633, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 14:58:35,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 350 states. [2018-10-15 14:58:35,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 350 to 343. [2018-10-15 14:58:35,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 343 states. [2018-10-15 14:58:35,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 343 states to 343 states and 343 transitions. [2018-10-15 14:58:35,649 INFO L78 Accepts]: Start accepts. Automaton has 343 states and 343 transitions. Word has length 332 [2018-10-15 14:58:35,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:35,650 INFO L481 AbstractCegarLoop]: Abstraction has 343 states and 343 transitions. [2018-10-15 14:58:35,650 INFO L482 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-10-15 14:58:35,650 INFO L276 IsEmpty]: Start isEmpty. Operand 343 states and 343 transitions. [2018-10-15 14:58:35,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2018-10-15 14:58:35,652 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:35,652 INFO L375 BasicCegarLoop]: trace histogram [34, 33, 33, 33, 33, 33, 33, 33, 33, 33, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:35,652 INFO L424 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:35,652 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:35,653 INFO L82 PathProgramCache]: Analyzing trace with hash -1911525564, now seen corresponding path program 33 times [2018-10-15 14:58:35,653 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:37,163 INFO L134 CoverageAnalysis]: Checked inductivity of 5346 backedges. 0 proven. 5346 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:37,163 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:37,164 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-10-15 14:58:37,164 INFO L460 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-10-15 14:58:37,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-10-15 14:58:37,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1228, Invalid=3742, Unknown=0, NotChecked=0, Total=4970 [2018-10-15 14:58:37,165 INFO L87 Difference]: Start difference. First operand 343 states and 343 transitions. Second operand 71 states. [2018-10-15 14:58:39,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:39,996 INFO L93 Difference]: Finished difference Result 364 states and 364 transitions. [2018-10-15 14:58:39,996 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-10-15 14:58:39,996 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 342 [2018-10-15 14:58:39,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:39,999 INFO L225 Difference]: With dead ends: 364 [2018-10-15 14:58:39,999 INFO L226 Difference]: Without dead ends: 360 [2018-10-15 14:58:40,001 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3463 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=5792, Invalid=13390, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 14:58:40,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-10-15 14:58:40,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 353. [2018-10-15 14:58:40,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 353 states. [2018-10-15 14:58:40,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 353 transitions. [2018-10-15 14:58:40,006 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 353 transitions. Word has length 342 [2018-10-15 14:58:40,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:40,007 INFO L481 AbstractCegarLoop]: Abstraction has 353 states and 353 transitions. [2018-10-15 14:58:40,007 INFO L482 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-10-15 14:58:40,007 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 353 transitions. [2018-10-15 14:58:40,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2018-10-15 14:58:40,009 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:40,010 INFO L375 BasicCegarLoop]: trace histogram [35, 34, 34, 34, 34, 34, 34, 34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:40,010 INFO L424 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:40,010 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:40,010 INFO L82 PathProgramCache]: Analyzing trace with hash 672417779, now seen corresponding path program 34 times [2018-10-15 14:58:40,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:41,735 INFO L134 CoverageAnalysis]: Checked inductivity of 5678 backedges. 0 proven. 5678 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:41,735 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:41,735 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-10-15 14:58:41,736 INFO L460 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-10-15 14:58:41,736 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-10-15 14:58:41,736 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1299, Invalid=3957, Unknown=0, NotChecked=0, Total=5256 [2018-10-15 14:58:41,737 INFO L87 Difference]: Start difference. First operand 353 states and 353 transitions. Second operand 73 states. [2018-10-15 14:58:44,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:44,694 INFO L93 Difference]: Finished difference Result 374 states and 374 transitions. [2018-10-15 14:58:44,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-10-15 14:58:44,694 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 352 [2018-10-15 14:58:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:44,697 INFO L225 Difference]: With dead ends: 374 [2018-10-15 14:58:44,697 INFO L226 Difference]: Without dead ends: 370 [2018-10-15 14:58:44,698 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 141 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3670 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=6137, Invalid=14169, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 14:58:44,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 370 states. [2018-10-15 14:58:44,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 370 to 363. [2018-10-15 14:58:44,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 363 states. [2018-10-15 14:58:44,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 363 transitions. [2018-10-15 14:58:44,702 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 363 transitions. Word has length 352 [2018-10-15 14:58:44,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:44,703 INFO L481 AbstractCegarLoop]: Abstraction has 363 states and 363 transitions. [2018-10-15 14:58:44,703 INFO L482 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-10-15 14:58:44,703 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 363 transitions. [2018-10-15 14:58:44,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2018-10-15 14:58:44,705 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:44,705 INFO L375 BasicCegarLoop]: trace histogram [36, 35, 35, 35, 35, 35, 35, 35, 35, 35, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:44,705 INFO L424 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:44,705 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:44,706 INFO L82 PathProgramCache]: Analyzing trace with hash 427839970, now seen corresponding path program 35 times [2018-10-15 14:58:44,706 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:44,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:46,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6020 backedges. 0 proven. 6020 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:46,485 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:46,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-10-15 14:58:46,485 INFO L460 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-10-15 14:58:46,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-10-15 14:58:46,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1372, Invalid=4178, Unknown=0, NotChecked=0, Total=5550 [2018-10-15 14:58:46,486 INFO L87 Difference]: Start difference. First operand 363 states and 363 transitions. Second operand 75 states. [2018-10-15 14:58:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:49,581 INFO L93 Difference]: Finished difference Result 384 states and 384 transitions. [2018-10-15 14:58:49,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-10-15 14:58:49,582 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 362 [2018-10-15 14:58:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:49,583 INFO L225 Difference]: With dead ends: 384 [2018-10-15 14:58:49,583 INFO L226 Difference]: Without dead ends: 380 [2018-10-15 14:58:49,584 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3883 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=6492, Invalid=14970, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 14:58:49,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2018-10-15 14:58:49,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 373. [2018-10-15 14:58:49,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 373 states. [2018-10-15 14:58:49,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 373 states to 373 states and 373 transitions. [2018-10-15 14:58:49,588 INFO L78 Accepts]: Start accepts. Automaton has 373 states and 373 transitions. Word has length 362 [2018-10-15 14:58:49,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:49,588 INFO L481 AbstractCegarLoop]: Abstraction has 373 states and 373 transitions. [2018-10-15 14:58:49,588 INFO L482 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-10-15 14:58:49,588 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 373 transitions. [2018-10-15 14:58:49,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 373 [2018-10-15 14:58:49,590 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:49,590 INFO L375 BasicCegarLoop]: trace histogram [37, 36, 36, 36, 36, 36, 36, 36, 36, 36, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:49,590 INFO L424 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:49,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:49,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1069022481, now seen corresponding path program 36 times [2018-10-15 14:58:49,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:49,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:51,569 INFO L134 CoverageAnalysis]: Checked inductivity of 6372 backedges. 0 proven. 6372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:51,570 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:51,570 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-10-15 14:58:51,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-10-15 14:58:51,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-10-15 14:58:51,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1447, Invalid=4405, Unknown=0, NotChecked=0, Total=5852 [2018-10-15 14:58:51,571 INFO L87 Difference]: Start difference. First operand 373 states and 373 transitions. Second operand 77 states. [2018-10-15 14:58:54,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:54,594 INFO L93 Difference]: Finished difference Result 394 states and 394 transitions. [2018-10-15 14:58:54,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-10-15 14:58:54,594 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 372 [2018-10-15 14:58:54,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:54,597 INFO L225 Difference]: With dead ends: 394 [2018-10-15 14:58:54,597 INFO L226 Difference]: Without dead ends: 390 [2018-10-15 14:58:54,599 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 149 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4102 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=6857, Invalid=15793, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 14:58:54,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2018-10-15 14:58:54,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 383. [2018-10-15 14:58:54,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 383 states. [2018-10-15 14:58:54,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 383 transitions. [2018-10-15 14:58:54,604 INFO L78 Accepts]: Start accepts. Automaton has 383 states and 383 transitions. Word has length 372 [2018-10-15 14:58:54,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:54,604 INFO L481 AbstractCegarLoop]: Abstraction has 383 states and 383 transitions. [2018-10-15 14:58:54,604 INFO L482 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-10-15 14:58:54,605 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 383 transitions. [2018-10-15 14:58:54,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2018-10-15 14:58:54,606 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:54,607 INFO L375 BasicCegarLoop]: trace histogram [38, 37, 37, 37, 37, 37, 37, 37, 37, 37, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:54,607 INFO L424 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:54,607 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:54,607 INFO L82 PathProgramCache]: Analyzing trace with hash 1720891776, now seen corresponding path program 37 times [2018-10-15 14:58:54,608 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:54,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:58:56,475 INFO L134 CoverageAnalysis]: Checked inductivity of 6734 backedges. 0 proven. 6734 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:58:56,476 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:58:56,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-10-15 14:58:56,477 INFO L460 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-10-15 14:58:56,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-10-15 14:58:56,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1524, Invalid=4638, Unknown=0, NotChecked=0, Total=6162 [2018-10-15 14:58:56,478 INFO L87 Difference]: Start difference. First operand 383 states and 383 transitions. Second operand 79 states. [2018-10-15 14:58:59,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:58:59,783 INFO L93 Difference]: Finished difference Result 404 states and 404 transitions. [2018-10-15 14:58:59,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-10-15 14:58:59,783 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 382 [2018-10-15 14:58:59,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:58:59,785 INFO L225 Difference]: With dead ends: 404 [2018-10-15 14:58:59,785 INFO L226 Difference]: Without dead ends: 400 [2018-10-15 14:58:59,787 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 155 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 153 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4327 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=7232, Invalid=16638, Unknown=0, NotChecked=0, Total=23870 [2018-10-15 14:58:59,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2018-10-15 14:58:59,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 393. [2018-10-15 14:58:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 393 states. [2018-10-15 14:58:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 393 transitions. [2018-10-15 14:58:59,791 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 393 transitions. Word has length 382 [2018-10-15 14:58:59,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:58:59,791 INFO L481 AbstractCegarLoop]: Abstraction has 393 states and 393 transitions. [2018-10-15 14:58:59,791 INFO L482 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-10-15 14:58:59,792 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 393 transitions. [2018-10-15 14:58:59,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2018-10-15 14:58:59,794 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:58:59,794 INFO L375 BasicCegarLoop]: trace histogram [39, 38, 38, 38, 38, 38, 38, 38, 38, 38, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:58:59,794 INFO L424 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:58:59,794 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:58:59,795 INFO L82 PathProgramCache]: Analyzing trace with hash -950274257, now seen corresponding path program 38 times [2018-10-15 14:58:59,795 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:58:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:01,908 INFO L134 CoverageAnalysis]: Checked inductivity of 7106 backedges. 0 proven. 7106 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:01,908 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:01,909 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-10-15 14:59:01,909 INFO L460 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-10-15 14:59:01,910 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-10-15 14:59:01,910 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1603, Invalid=4877, Unknown=0, NotChecked=0, Total=6480 [2018-10-15 14:59:01,910 INFO L87 Difference]: Start difference. First operand 393 states and 393 transitions. Second operand 81 states. [2018-10-15 14:59:05,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:05,599 INFO L93 Difference]: Finished difference Result 414 states and 414 transitions. [2018-10-15 14:59:05,599 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-10-15 14:59:05,599 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 392 [2018-10-15 14:59:05,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:05,602 INFO L225 Difference]: With dead ends: 414 [2018-10-15 14:59:05,602 INFO L226 Difference]: Without dead ends: 410 [2018-10-15 14:59:05,603 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 157 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4558 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=7617, Invalid=17505, Unknown=0, NotChecked=0, Total=25122 [2018-10-15 14:59:05,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2018-10-15 14:59:05,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 403. [2018-10-15 14:59:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 403 states. [2018-10-15 14:59:05,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 403 states to 403 states and 403 transitions. [2018-10-15 14:59:05,607 INFO L78 Accepts]: Start accepts. Automaton has 403 states and 403 transitions. Word has length 392 [2018-10-15 14:59:05,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:05,608 INFO L481 AbstractCegarLoop]: Abstraction has 403 states and 403 transitions. [2018-10-15 14:59:05,608 INFO L482 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-10-15 14:59:05,608 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 403 transitions. [2018-10-15 14:59:05,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2018-10-15 14:59:05,609 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:05,610 INFO L375 BasicCegarLoop]: trace histogram [40, 39, 39, 39, 39, 39, 39, 39, 39, 39, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:05,610 INFO L424 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:05,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:05,610 INFO L82 PathProgramCache]: Analyzing trace with hash -942463458, now seen corresponding path program 39 times [2018-10-15 14:59:05,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:05,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:08,567 INFO L134 CoverageAnalysis]: Checked inductivity of 7488 backedges. 0 proven. 7488 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:08,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:08,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-10-15 14:59:08,568 INFO L460 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-10-15 14:59:08,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-10-15 14:59:08,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1684, Invalid=5122, Unknown=0, NotChecked=0, Total=6806 [2018-10-15 14:59:08,569 INFO L87 Difference]: Start difference. First operand 403 states and 403 transitions. Second operand 83 states. [2018-10-15 14:59:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:11,952 INFO L93 Difference]: Finished difference Result 424 states and 424 transitions. [2018-10-15 14:59:11,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-10-15 14:59:11,952 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 402 [2018-10-15 14:59:11,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:11,955 INFO L225 Difference]: With dead ends: 424 [2018-10-15 14:59:11,955 INFO L226 Difference]: Without dead ends: 420 [2018-10-15 14:59:11,956 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4795 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=8012, Invalid=18394, Unknown=0, NotChecked=0, Total=26406 [2018-10-15 14:59:11,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2018-10-15 14:59:11,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 413. [2018-10-15 14:59:11,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2018-10-15 14:59:11,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 413 transitions. [2018-10-15 14:59:11,961 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 413 transitions. Word has length 402 [2018-10-15 14:59:11,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:11,961 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 413 transitions. [2018-10-15 14:59:11,961 INFO L482 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-10-15 14:59:11,961 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 413 transitions. [2018-10-15 14:59:11,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2018-10-15 14:59:11,963 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:11,964 INFO L375 BasicCegarLoop]: trace histogram [41, 40, 40, 40, 40, 40, 40, 40, 40, 40, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:11,964 INFO L424 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:11,964 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:11,964 INFO L82 PathProgramCache]: Analyzing trace with hash -114575795, now seen corresponding path program 40 times [2018-10-15 14:59:11,965 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:11,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:14,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7880 backedges. 0 proven. 7880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:14,437 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:14,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-10-15 14:59:14,438 INFO L460 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-10-15 14:59:14,438 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-10-15 14:59:14,439 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1767, Invalid=5373, Unknown=0, NotChecked=0, Total=7140 [2018-10-15 14:59:14,439 INFO L87 Difference]: Start difference. First operand 413 states and 413 transitions. Second operand 85 states. [2018-10-15 14:59:18,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:18,103 INFO L93 Difference]: Finished difference Result 434 states and 434 transitions. [2018-10-15 14:59:18,104 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-10-15 14:59:18,104 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 412 [2018-10-15 14:59:18,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:18,106 INFO L225 Difference]: With dead ends: 434 [2018-10-15 14:59:18,106 INFO L226 Difference]: Without dead ends: 430 [2018-10-15 14:59:18,108 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5038 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=8417, Invalid=19305, Unknown=0, NotChecked=0, Total=27722 [2018-10-15 14:59:18,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2018-10-15 14:59:18,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 423. [2018-10-15 14:59:18,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 423 states. [2018-10-15 14:59:18,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 423 states to 423 states and 423 transitions. [2018-10-15 14:59:18,112 INFO L78 Accepts]: Start accepts. Automaton has 423 states and 423 transitions. Word has length 412 [2018-10-15 14:59:18,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:18,113 INFO L481 AbstractCegarLoop]: Abstraction has 423 states and 423 transitions. [2018-10-15 14:59:18,113 INFO L482 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-10-15 14:59:18,113 INFO L276 IsEmpty]: Start isEmpty. Operand 423 states and 423 transitions. [2018-10-15 14:59:18,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2018-10-15 14:59:18,115 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:18,116 INFO L375 BasicCegarLoop]: trace histogram [42, 41, 41, 41, 41, 41, 41, 41, 41, 41, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:18,116 INFO L424 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:18,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:18,116 INFO L82 PathProgramCache]: Analyzing trace with hash 1460475836, now seen corresponding path program 41 times [2018-10-15 14:59:18,117 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:18,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:20,553 INFO L134 CoverageAnalysis]: Checked inductivity of 8282 backedges. 0 proven. 8282 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:20,554 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:20,554 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-10-15 14:59:20,554 INFO L460 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-10-15 14:59:20,555 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-10-15 14:59:20,555 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1852, Invalid=5630, Unknown=0, NotChecked=0, Total=7482 [2018-10-15 14:59:20,555 INFO L87 Difference]: Start difference. First operand 423 states and 423 transitions. Second operand 87 states. [2018-10-15 14:59:24,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:24,685 INFO L93 Difference]: Finished difference Result 444 states and 444 transitions. [2018-10-15 14:59:24,685 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-10-15 14:59:24,685 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 422 [2018-10-15 14:59:24,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:24,688 INFO L225 Difference]: With dead ends: 444 [2018-10-15 14:59:24,688 INFO L226 Difference]: Without dead ends: 440 [2018-10-15 14:59:24,690 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 169 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5287 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=8832, Invalid=20238, Unknown=0, NotChecked=0, Total=29070 [2018-10-15 14:59:24,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 440 states. [2018-10-15 14:59:24,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 440 to 433. [2018-10-15 14:59:24,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 433 states. [2018-10-15 14:59:24,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 433 states to 433 states and 433 transitions. [2018-10-15 14:59:24,695 INFO L78 Accepts]: Start accepts. Automaton has 433 states and 433 transitions. Word has length 422 [2018-10-15 14:59:24,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:24,695 INFO L481 AbstractCegarLoop]: Abstraction has 433 states and 433 transitions. [2018-10-15 14:59:24,695 INFO L482 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-10-15 14:59:24,695 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 433 transitions. [2018-10-15 14:59:24,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2018-10-15 14:59:24,698 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:24,698 INFO L375 BasicCegarLoop]: trace histogram [43, 42, 42, 42, 42, 42, 42, 42, 42, 42, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:24,698 INFO L424 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:24,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:24,698 INFO L82 PathProgramCache]: Analyzing trace with hash -963462549, now seen corresponding path program 42 times [2018-10-15 14:59:24,699 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:24,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:27,055 INFO L134 CoverageAnalysis]: Checked inductivity of 8694 backedges. 0 proven. 8694 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:27,055 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:27,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-10-15 14:59:27,055 INFO L460 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-10-15 14:59:27,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-10-15 14:59:27,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1939, Invalid=5893, Unknown=0, NotChecked=0, Total=7832 [2018-10-15 14:59:27,057 INFO L87 Difference]: Start difference. First operand 433 states and 433 transitions. Second operand 89 states. [2018-10-15 14:59:31,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:31,154 INFO L93 Difference]: Finished difference Result 454 states and 454 transitions. [2018-10-15 14:59:31,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-10-15 14:59:31,155 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 432 [2018-10-15 14:59:31,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:31,158 INFO L225 Difference]: With dead ends: 454 [2018-10-15 14:59:31,158 INFO L226 Difference]: Without dead ends: 450 [2018-10-15 14:59:31,160 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 175 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 173 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5542 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=9257, Invalid=21193, Unknown=0, NotChecked=0, Total=30450 [2018-10-15 14:59:31,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 450 states. [2018-10-15 14:59:31,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 450 to 443. [2018-10-15 14:59:31,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2018-10-15 14:59:31,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 443 transitions. [2018-10-15 14:59:31,164 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 443 transitions. Word has length 432 [2018-10-15 14:59:31,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:31,165 INFO L481 AbstractCegarLoop]: Abstraction has 443 states and 443 transitions. [2018-10-15 14:59:31,165 INFO L482 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-10-15 14:59:31,165 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 443 transitions. [2018-10-15 14:59:31,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2018-10-15 14:59:31,167 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:31,168 INFO L375 BasicCegarLoop]: trace histogram [44, 43, 43, 43, 43, 43, 43, 43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:31,168 INFO L424 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:31,168 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:31,168 INFO L82 PathProgramCache]: Analyzing trace with hash -716435878, now seen corresponding path program 43 times [2018-10-15 14:59:31,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:31,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:33,650 INFO L134 CoverageAnalysis]: Checked inductivity of 9116 backedges. 0 proven. 9116 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:33,650 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:33,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-10-15 14:59:33,651 INFO L460 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-10-15 14:59:33,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-10-15 14:59:33,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2028, Invalid=6162, Unknown=0, NotChecked=0, Total=8190 [2018-10-15 14:59:33,652 INFO L87 Difference]: Start difference. First operand 443 states and 443 transitions. Second operand 91 states. [2018-10-15 14:59:37,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:37,815 INFO L93 Difference]: Finished difference Result 464 states and 464 transitions. [2018-10-15 14:59:37,815 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-10-15 14:59:37,815 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 442 [2018-10-15 14:59:37,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:37,818 INFO L225 Difference]: With dead ends: 464 [2018-10-15 14:59:37,818 INFO L226 Difference]: Without dead ends: 460 [2018-10-15 14:59:37,819 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5803 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=9692, Invalid=22170, Unknown=0, NotChecked=0, Total=31862 [2018-10-15 14:59:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 460 states. [2018-10-15 14:59:37,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 460 to 453. [2018-10-15 14:59:37,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 453 states. [2018-10-15 14:59:37,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 453 transitions. [2018-10-15 14:59:37,823 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 453 transitions. Word has length 442 [2018-10-15 14:59:37,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:37,823 INFO L481 AbstractCegarLoop]: Abstraction has 453 states and 453 transitions. [2018-10-15 14:59:37,823 INFO L482 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-10-15 14:59:37,823 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 453 transitions. [2018-10-15 14:59:37,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 453 [2018-10-15 14:59:37,825 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:37,825 INFO L375 BasicCegarLoop]: trace histogram [45, 44, 44, 44, 44, 44, 44, 44, 44, 44, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:37,825 INFO L424 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:37,825 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:37,825 INFO L82 PathProgramCache]: Analyzing trace with hash -1203993719, now seen corresponding path program 44 times [2018-10-15 14:59:37,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:37,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 9548 backedges. 0 proven. 9548 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:40,862 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:40,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-10-15 14:59:40,863 INFO L460 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-10-15 14:59:40,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-10-15 14:59:40,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2119, Invalid=6437, Unknown=0, NotChecked=0, Total=8556 [2018-10-15 14:59:40,864 INFO L87 Difference]: Start difference. First operand 453 states and 453 transitions. Second operand 93 states. [2018-10-15 14:59:45,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:45,327 INFO L93 Difference]: Finished difference Result 474 states and 474 transitions. [2018-10-15 14:59:45,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-10-15 14:59:45,327 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 452 [2018-10-15 14:59:45,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:45,330 INFO L225 Difference]: With dead ends: 474 [2018-10-15 14:59:45,330 INFO L226 Difference]: Without dead ends: 470 [2018-10-15 14:59:45,331 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 181 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6070 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=10137, Invalid=23169, Unknown=0, NotChecked=0, Total=33306 [2018-10-15 14:59:45,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2018-10-15 14:59:45,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 463. [2018-10-15 14:59:45,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 463 states. [2018-10-15 14:59:45,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 463 states to 463 states and 463 transitions. [2018-10-15 14:59:45,335 INFO L78 Accepts]: Start accepts. Automaton has 463 states and 463 transitions. Word has length 452 [2018-10-15 14:59:45,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:45,335 INFO L481 AbstractCegarLoop]: Abstraction has 463 states and 463 transitions. [2018-10-15 14:59:45,335 INFO L482 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-10-15 14:59:45,335 INFO L276 IsEmpty]: Start isEmpty. Operand 463 states and 463 transitions. [2018-10-15 14:59:45,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 463 [2018-10-15 14:59:45,338 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:45,338 INFO L375 BasicCegarLoop]: trace histogram [46, 45, 45, 45, 45, 45, 45, 45, 45, 45, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:45,338 INFO L424 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:45,338 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:45,339 INFO L82 PathProgramCache]: Analyzing trace with hash -1965323784, now seen corresponding path program 45 times [2018-10-15 14:59:45,339 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:45,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:48,000 INFO L134 CoverageAnalysis]: Checked inductivity of 9990 backedges. 0 proven. 9990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:48,000 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:48,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-10-15 14:59:48,001 INFO L460 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-10-15 14:59:48,001 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-10-15 14:59:48,001 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2212, Invalid=6718, Unknown=0, NotChecked=0, Total=8930 [2018-10-15 14:59:48,001 INFO L87 Difference]: Start difference. First operand 463 states and 463 transitions. Second operand 95 states. [2018-10-15 14:59:52,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 14:59:52,577 INFO L93 Difference]: Finished difference Result 484 states and 484 transitions. [2018-10-15 14:59:52,577 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 140 states. [2018-10-15 14:59:52,577 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 462 [2018-10-15 14:59:52,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 14:59:52,580 INFO L225 Difference]: With dead ends: 484 [2018-10-15 14:59:52,580 INFO L226 Difference]: Without dead ends: 480 [2018-10-15 14:59:52,581 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 185 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6343 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=10592, Invalid=24190, Unknown=0, NotChecked=0, Total=34782 [2018-10-15 14:59:52,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2018-10-15 14:59:52,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 473. [2018-10-15 14:59:52,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 473 states. [2018-10-15 14:59:52,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 473 states to 473 states and 473 transitions. [2018-10-15 14:59:52,585 INFO L78 Accepts]: Start accepts. Automaton has 473 states and 473 transitions. Word has length 462 [2018-10-15 14:59:52,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 14:59:52,586 INFO L481 AbstractCegarLoop]: Abstraction has 473 states and 473 transitions. [2018-10-15 14:59:52,586 INFO L482 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-10-15 14:59:52,586 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 473 transitions. [2018-10-15 14:59:52,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2018-10-15 14:59:52,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 14:59:52,588 INFO L375 BasicCegarLoop]: trace histogram [47, 46, 46, 46, 46, 46, 46, 46, 46, 46, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 14:59:52,588 INFO L424 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 14:59:52,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 14:59:52,588 INFO L82 PathProgramCache]: Analyzing trace with hash -837512793, now seen corresponding path program 46 times [2018-10-15 14:59:52,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 14:59:52,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 14:59:55,559 INFO L134 CoverageAnalysis]: Checked inductivity of 10442 backedges. 0 proven. 10442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 14:59:55,560 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 14:59:55,560 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-10-15 14:59:55,560 INFO L460 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-10-15 14:59:55,561 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-10-15 14:59:55,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2307, Invalid=7005, Unknown=0, NotChecked=0, Total=9312 [2018-10-15 14:59:55,561 INFO L87 Difference]: Start difference. First operand 473 states and 473 transitions. Second operand 97 states. [2018-10-15 15:00:00,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:00,478 INFO L93 Difference]: Finished difference Result 494 states and 494 transitions. [2018-10-15 15:00:00,479 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 143 states. [2018-10-15 15:00:00,479 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 472 [2018-10-15 15:00:00,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:00,481 INFO L225 Difference]: With dead ends: 494 [2018-10-15 15:00:00,481 INFO L226 Difference]: Without dead ends: 490 [2018-10-15 15:00:00,482 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 189 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6622 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=11057, Invalid=25233, Unknown=0, NotChecked=0, Total=36290 [2018-10-15 15:00:00,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2018-10-15 15:00:00,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 483. [2018-10-15 15:00:00,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 483 states. [2018-10-15 15:00:00,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 483 transitions. [2018-10-15 15:00:00,488 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 483 transitions. Word has length 472 [2018-10-15 15:00:00,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:00,488 INFO L481 AbstractCegarLoop]: Abstraction has 483 states and 483 transitions. [2018-10-15 15:00:00,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-10-15 15:00:00,488 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 483 transitions. [2018-10-15 15:00:00,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2018-10-15 15:00:00,491 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:00,491 INFO L375 BasicCegarLoop]: trace histogram [48, 47, 47, 47, 47, 47, 47, 47, 47, 47, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:00,491 INFO L424 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:00,491 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:00,492 INFO L82 PathProgramCache]: Analyzing trace with hash 658967190, now seen corresponding path program 47 times [2018-10-15 15:00:00,492 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:00,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:03,760 INFO L134 CoverageAnalysis]: Checked inductivity of 10904 backedges. 0 proven. 10904 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:03,760 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:03,761 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-10-15 15:00:03,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-10-15 15:00:03,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-10-15 15:00:03,762 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2404, Invalid=7298, Unknown=0, NotChecked=0, Total=9702 [2018-10-15 15:00:03,762 INFO L87 Difference]: Start difference. First operand 483 states and 483 transitions. Second operand 99 states. [2018-10-15 15:00:08,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:08,720 INFO L93 Difference]: Finished difference Result 504 states and 504 transitions. [2018-10-15 15:00:08,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 146 states. [2018-10-15 15:00:08,721 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 482 [2018-10-15 15:00:08,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:08,724 INFO L225 Difference]: With dead ends: 504 [2018-10-15 15:00:08,724 INFO L226 Difference]: Without dead ends: 500 [2018-10-15 15:00:08,726 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 193 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6907 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=11532, Invalid=26298, Unknown=0, NotChecked=0, Total=37830 [2018-10-15 15:00:08,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 500 states. [2018-10-15 15:00:08,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 500 to 493. [2018-10-15 15:00:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 493 states. [2018-10-15 15:00:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 493 states to 493 states and 493 transitions. [2018-10-15 15:00:08,730 INFO L78 Accepts]: Start accepts. Automaton has 493 states and 493 transitions. Word has length 482 [2018-10-15 15:00:08,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:08,730 INFO L481 AbstractCegarLoop]: Abstraction has 493 states and 493 transitions. [2018-10-15 15:00:08,730 INFO L482 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-10-15 15:00:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 493 states and 493 transitions. [2018-10-15 15:00:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 493 [2018-10-15 15:00:08,750 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:08,750 INFO L375 BasicCegarLoop]: trace histogram [49, 48, 48, 48, 48, 48, 48, 48, 48, 48, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:08,750 INFO L424 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:08,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:08,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1598448837, now seen corresponding path program 48 times [2018-10-15 15:00:08,751 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:12,143 INFO L134 CoverageAnalysis]: Checked inductivity of 11376 backedges. 0 proven. 11376 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:12,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:12,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-10-15 15:00:12,144 INFO L460 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-10-15 15:00:12,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-10-15 15:00:12,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2503, Invalid=7597, Unknown=0, NotChecked=0, Total=10100 [2018-10-15 15:00:12,145 INFO L87 Difference]: Start difference. First operand 493 states and 493 transitions. Second operand 101 states. [2018-10-15 15:00:17,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:17,313 INFO L93 Difference]: Finished difference Result 514 states and 514 transitions. [2018-10-15 15:00:17,314 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 149 states. [2018-10-15 15:00:17,314 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 492 [2018-10-15 15:00:17,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:17,317 INFO L225 Difference]: With dead ends: 514 [2018-10-15 15:00:17,317 INFO L226 Difference]: Without dead ends: 510 [2018-10-15 15:00:17,319 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 197 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7198 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=12017, Invalid=27385, Unknown=0, NotChecked=0, Total=39402 [2018-10-15 15:00:17,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 510 states. [2018-10-15 15:00:17,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 510 to 503. [2018-10-15 15:00:17,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 503 states. [2018-10-15 15:00:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 503 states to 503 states and 503 transitions. [2018-10-15 15:00:17,323 INFO L78 Accepts]: Start accepts. Automaton has 503 states and 503 transitions. Word has length 492 [2018-10-15 15:00:17,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:17,324 INFO L481 AbstractCegarLoop]: Abstraction has 503 states and 503 transitions. [2018-10-15 15:00:17,324 INFO L482 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-10-15 15:00:17,324 INFO L276 IsEmpty]: Start isEmpty. Operand 503 states and 503 transitions. [2018-10-15 15:00:17,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2018-10-15 15:00:17,326 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:17,326 INFO L375 BasicCegarLoop]: trace histogram [50, 49, 49, 49, 49, 49, 49, 49, 49, 49, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:17,326 INFO L424 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:17,326 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:17,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1587933132, now seen corresponding path program 49 times [2018-10-15 15:00:17,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:20,784 INFO L134 CoverageAnalysis]: Checked inductivity of 11858 backedges. 0 proven. 11858 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:20,784 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:20,784 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-10-15 15:00:20,785 INFO L460 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-10-15 15:00:20,786 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-10-15 15:00:20,786 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2604, Invalid=7902, Unknown=0, NotChecked=0, Total=10506 [2018-10-15 15:00:20,786 INFO L87 Difference]: Start difference. First operand 503 states and 503 transitions. Second operand 103 states. [2018-10-15 15:00:26,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:26,212 INFO L93 Difference]: Finished difference Result 524 states and 524 transitions. [2018-10-15 15:00:26,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2018-10-15 15:00:26,212 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 502 [2018-10-15 15:00:26,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:26,214 INFO L225 Difference]: With dead ends: 524 [2018-10-15 15:00:26,214 INFO L226 Difference]: Without dead ends: 520 [2018-10-15 15:00:26,216 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7495 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=12512, Invalid=28494, Unknown=0, NotChecked=0, Total=41006 [2018-10-15 15:00:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 520 states. [2018-10-15 15:00:26,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 520 to 513. [2018-10-15 15:00:26,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 513 states. [2018-10-15 15:00:26,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 513 states to 513 states and 513 transitions. [2018-10-15 15:00:26,221 INFO L78 Accepts]: Start accepts. Automaton has 513 states and 513 transitions. Word has length 502 [2018-10-15 15:00:26,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:26,222 INFO L481 AbstractCegarLoop]: Abstraction has 513 states and 513 transitions. [2018-10-15 15:00:26,222 INFO L482 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-10-15 15:00:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 513 states and 513 transitions. [2018-10-15 15:00:26,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 513 [2018-10-15 15:00:26,224 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:26,224 INFO L375 BasicCegarLoop]: trace histogram [51, 50, 50, 50, 50, 50, 50, 50, 50, 50, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:26,224 INFO L424 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:26,225 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:26,225 INFO L82 PathProgramCache]: Analyzing trace with hash -96633629, now seen corresponding path program 50 times [2018-10-15 15:00:26,225 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:26,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:29,520 INFO L134 CoverageAnalysis]: Checked inductivity of 12350 backedges. 0 proven. 12350 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:29,520 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:29,520 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-10-15 15:00:29,521 INFO L460 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-10-15 15:00:29,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-10-15 15:00:29,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2707, Invalid=8213, Unknown=0, NotChecked=0, Total=10920 [2018-10-15 15:00:29,522 INFO L87 Difference]: Start difference. First operand 513 states and 513 transitions. Second operand 105 states. [2018-10-15 15:00:35,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:35,449 INFO L93 Difference]: Finished difference Result 534 states and 534 transitions. [2018-10-15 15:00:35,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 155 states. [2018-10-15 15:00:35,451 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 512 [2018-10-15 15:00:35,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:35,454 INFO L225 Difference]: With dead ends: 534 [2018-10-15 15:00:35,454 INFO L226 Difference]: Without dead ends: 530 [2018-10-15 15:00:35,456 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 205 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7798 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13017, Invalid=29625, Unknown=0, NotChecked=0, Total=42642 [2018-10-15 15:00:35,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2018-10-15 15:00:35,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 523. [2018-10-15 15:00:35,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 523 states. [2018-10-15 15:00:35,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 523 transitions. [2018-10-15 15:00:35,460 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 523 transitions. Word has length 512 [2018-10-15 15:00:35,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:35,460 INFO L481 AbstractCegarLoop]: Abstraction has 523 states and 523 transitions. [2018-10-15 15:00:35,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-10-15 15:00:35,460 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 523 transitions. [2018-10-15 15:00:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 523 [2018-10-15 15:00:35,463 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:35,463 INFO L375 BasicCegarLoop]: trace histogram [52, 51, 51, 51, 51, 51, 51, 51, 51, 51, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:35,464 INFO L424 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:35,464 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:35,464 INFO L82 PathProgramCache]: Analyzing trace with hash 387979986, now seen corresponding path program 51 times [2018-10-15 15:00:35,464 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:38,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12852 backedges. 0 proven. 12852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:38,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:38,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-10-15 15:00:38,788 INFO L460 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-10-15 15:00:38,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-10-15 15:00:38,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2812, Invalid=8530, Unknown=0, NotChecked=0, Total=11342 [2018-10-15 15:00:38,790 INFO L87 Difference]: Start difference. First operand 523 states and 523 transitions. Second operand 107 states. [2018-10-15 15:00:44,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:44,585 INFO L93 Difference]: Finished difference Result 544 states and 544 transitions. [2018-10-15 15:00:44,585 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 158 states. [2018-10-15 15:00:44,585 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 522 [2018-10-15 15:00:44,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:44,588 INFO L225 Difference]: With dead ends: 544 [2018-10-15 15:00:44,588 INFO L226 Difference]: Without dead ends: 540 [2018-10-15 15:00:44,590 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 209 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8107 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=13532, Invalid=30778, Unknown=0, NotChecked=0, Total=44310 [2018-10-15 15:00:44,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2018-10-15 15:00:44,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 533. [2018-10-15 15:00:44,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2018-10-15 15:00:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 533 transitions. [2018-10-15 15:00:44,594 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 533 transitions. Word has length 522 [2018-10-15 15:00:44,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:44,594 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 533 transitions. [2018-10-15 15:00:44,594 INFO L482 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-10-15 15:00:44,594 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 533 transitions. [2018-10-15 15:00:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2018-10-15 15:00:44,596 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:44,597 INFO L375 BasicCegarLoop]: trace histogram [53, 52, 52, 52, 52, 52, 52, 52, 52, 52, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:44,597 INFO L424 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:44,597 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:44,597 INFO L82 PathProgramCache]: Analyzing trace with hash 1151687169, now seen corresponding path program 52 times [2018-10-15 15:00:44,598 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:44,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:48,239 INFO L134 CoverageAnalysis]: Checked inductivity of 13364 backedges. 0 proven. 13364 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:48,239 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:48,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-10-15 15:00:48,240 INFO L460 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-10-15 15:00:48,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-10-15 15:00:48,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=2919, Invalid=8853, Unknown=0, NotChecked=0, Total=11772 [2018-10-15 15:00:48,241 INFO L87 Difference]: Start difference. First operand 533 states and 533 transitions. Second operand 109 states. [2018-10-15 15:00:54,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:00:54,273 INFO L93 Difference]: Finished difference Result 554 states and 554 transitions. [2018-10-15 15:00:54,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 161 states. [2018-10-15 15:00:54,273 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 532 [2018-10-15 15:00:54,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:00:54,275 INFO L225 Difference]: With dead ends: 554 [2018-10-15 15:00:54,275 INFO L226 Difference]: Without dead ends: 550 [2018-10-15 15:00:54,277 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8422 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=14057, Invalid=31953, Unknown=0, NotChecked=0, Total=46010 [2018-10-15 15:00:54,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 550 states. [2018-10-15 15:00:54,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 550 to 543. [2018-10-15 15:00:54,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 543 states. [2018-10-15 15:00:54,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 543 states and 543 transitions. [2018-10-15 15:00:54,282 INFO L78 Accepts]: Start accepts. Automaton has 543 states and 543 transitions. Word has length 532 [2018-10-15 15:00:54,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:00:54,282 INFO L481 AbstractCegarLoop]: Abstraction has 543 states and 543 transitions. [2018-10-15 15:00:54,282 INFO L482 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-10-15 15:00:54,282 INFO L276 IsEmpty]: Start isEmpty. Operand 543 states and 543 transitions. [2018-10-15 15:00:54,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2018-10-15 15:00:54,284 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:00:54,285 INFO L375 BasicCegarLoop]: trace histogram [54, 53, 53, 53, 53, 53, 53, 53, 53, 53, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:00:54,285 INFO L424 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:00:54,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:00:54,285 INFO L82 PathProgramCache]: Analyzing trace with hash -1377523088, now seen corresponding path program 53 times [2018-10-15 15:00:54,286 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:00:54,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:00:58,202 INFO L134 CoverageAnalysis]: Checked inductivity of 13886 backedges. 0 proven. 13886 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:00:58,202 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:00:58,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-10-15 15:00:58,203 INFO L460 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-10-15 15:00:58,203 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-10-15 15:00:58,203 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3028, Invalid=9182, Unknown=0, NotChecked=0, Total=12210 [2018-10-15 15:00:58,204 INFO L87 Difference]: Start difference. First operand 543 states and 543 transitions. Second operand 111 states. [2018-10-15 15:01:04,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:04,233 INFO L93 Difference]: Finished difference Result 564 states and 564 transitions. [2018-10-15 15:01:04,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 164 states. [2018-10-15 15:01:04,234 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 542 [2018-10-15 15:01:04,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:04,237 INFO L225 Difference]: With dead ends: 564 [2018-10-15 15:01:04,237 INFO L226 Difference]: Without dead ends: 560 [2018-10-15 15:01:04,239 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 217 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8743 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=14592, Invalid=33150, Unknown=0, NotChecked=0, Total=47742 [2018-10-15 15:01:04,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2018-10-15 15:01:04,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 553. [2018-10-15 15:01:04,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 553 states. [2018-10-15 15:01:04,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 553 transitions. [2018-10-15 15:01:04,243 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 553 transitions. Word has length 542 [2018-10-15 15:01:04,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:04,243 INFO L481 AbstractCegarLoop]: Abstraction has 553 states and 553 transitions. [2018-10-15 15:01:04,243 INFO L482 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-10-15 15:01:04,243 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 553 transitions. [2018-10-15 15:01:04,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2018-10-15 15:01:04,245 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:04,246 INFO L375 BasicCegarLoop]: trace histogram [55, 54, 54, 54, 54, 54, 54, 54, 54, 54, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:04,246 INFO L424 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:04,246 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:04,246 INFO L82 PathProgramCache]: Analyzing trace with hash -613843937, now seen corresponding path program 54 times [2018-10-15 15:01:04,247 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:04,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:08,052 INFO L134 CoverageAnalysis]: Checked inductivity of 14418 backedges. 0 proven. 14418 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:08,052 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:08,052 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-10-15 15:01:08,053 INFO L460 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-10-15 15:01:08,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-10-15 15:01:08,054 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3139, Invalid=9517, Unknown=0, NotChecked=0, Total=12656 [2018-10-15 15:01:08,054 INFO L87 Difference]: Start difference. First operand 553 states and 553 transitions. Second operand 113 states. [2018-10-15 15:01:14,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:14,504 INFO L93 Difference]: Finished difference Result 574 states and 574 transitions. [2018-10-15 15:01:14,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 167 states. [2018-10-15 15:01:14,505 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 552 [2018-10-15 15:01:14,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:14,507 INFO L225 Difference]: With dead ends: 574 [2018-10-15 15:01:14,507 INFO L226 Difference]: Without dead ends: 570 [2018-10-15 15:01:14,509 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 223 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 221 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9070 ImplicationChecksByTransitivity, 9.2s TimeCoverageRelationStatistics Valid=15137, Invalid=34369, Unknown=0, NotChecked=0, Total=49506 [2018-10-15 15:01:14,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2018-10-15 15:01:14,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 563. [2018-10-15 15:01:14,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 563 states. [2018-10-15 15:01:14,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 563 states to 563 states and 563 transitions. [2018-10-15 15:01:14,513 INFO L78 Accepts]: Start accepts. Automaton has 563 states and 563 transitions. Word has length 552 [2018-10-15 15:01:14,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:14,513 INFO L481 AbstractCegarLoop]: Abstraction has 563 states and 563 transitions. [2018-10-15 15:01:14,513 INFO L482 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-10-15 15:01:14,513 INFO L276 IsEmpty]: Start isEmpty. Operand 563 states and 563 transitions. [2018-10-15 15:01:14,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 563 [2018-10-15 15:01:14,515 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:14,516 INFO L375 BasicCegarLoop]: trace histogram [56, 55, 55, 55, 55, 55, 55, 55, 55, 55, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:14,516 INFO L424 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:14,516 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:14,516 INFO L82 PathProgramCache]: Analyzing trace with hash 1915961102, now seen corresponding path program 55 times [2018-10-15 15:01:14,517 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:14,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:18,526 INFO L134 CoverageAnalysis]: Checked inductivity of 14960 backedges. 0 proven. 14960 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:18,526 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:18,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-10-15 15:01:18,527 INFO L460 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-10-15 15:01:18,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-10-15 15:01:18,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3252, Invalid=9858, Unknown=0, NotChecked=0, Total=13110 [2018-10-15 15:01:18,528 INFO L87 Difference]: Start difference. First operand 563 states and 563 transitions. Second operand 115 states. [2018-10-15 15:01:25,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:25,263 INFO L93 Difference]: Finished difference Result 584 states and 584 transitions. [2018-10-15 15:01:25,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 170 states. [2018-10-15 15:01:25,263 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 562 [2018-10-15 15:01:25,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:25,265 INFO L225 Difference]: With dead ends: 584 [2018-10-15 15:01:25,265 INFO L226 Difference]: Without dead ends: 580 [2018-10-15 15:01:25,267 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 225 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9403 ImplicationChecksByTransitivity, 9.7s TimeCoverageRelationStatistics Valid=15692, Invalid=35610, Unknown=0, NotChecked=0, Total=51302 [2018-10-15 15:01:25,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 580 states. [2018-10-15 15:01:25,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 580 to 573. [2018-10-15 15:01:25,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 573 states. [2018-10-15 15:01:25,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 573 states to 573 states and 573 transitions. [2018-10-15 15:01:25,273 INFO L78 Accepts]: Start accepts. Automaton has 573 states and 573 transitions. Word has length 562 [2018-10-15 15:01:25,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:25,273 INFO L481 AbstractCegarLoop]: Abstraction has 573 states and 573 transitions. [2018-10-15 15:01:25,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-10-15 15:01:25,274 INFO L276 IsEmpty]: Start isEmpty. Operand 573 states and 573 transitions. [2018-10-15 15:01:25,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 573 [2018-10-15 15:01:25,276 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:25,277 INFO L375 BasicCegarLoop]: trace histogram [57, 56, 56, 56, 56, 56, 56, 56, 56, 56, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:25,277 INFO L424 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:25,277 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:25,277 INFO L82 PathProgramCache]: Analyzing trace with hash 850748221, now seen corresponding path program 56 times [2018-10-15 15:01:25,277 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:25,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:29,389 INFO L134 CoverageAnalysis]: Checked inductivity of 15512 backedges. 0 proven. 15512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:29,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:29,389 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-10-15 15:01:29,390 INFO L460 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-10-15 15:01:29,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-10-15 15:01:29,391 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3367, Invalid=10205, Unknown=0, NotChecked=0, Total=13572 [2018-10-15 15:01:29,391 INFO L87 Difference]: Start difference. First operand 573 states and 573 transitions. Second operand 117 states. [2018-10-15 15:01:36,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:36,074 INFO L93 Difference]: Finished difference Result 594 states and 594 transitions. [2018-10-15 15:01:36,074 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 173 states. [2018-10-15 15:01:36,074 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 572 [2018-10-15 15:01:36,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:36,077 INFO L225 Difference]: With dead ends: 594 [2018-10-15 15:01:36,077 INFO L226 Difference]: Without dead ends: 590 [2018-10-15 15:01:36,079 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 229 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9742 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=16257, Invalid=36873, Unknown=0, NotChecked=0, Total=53130 [2018-10-15 15:01:36,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2018-10-15 15:01:36,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 583. [2018-10-15 15:01:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 583 states. [2018-10-15 15:01:36,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 583 states to 583 states and 583 transitions. [2018-10-15 15:01:36,084 INFO L78 Accepts]: Start accepts. Automaton has 583 states and 583 transitions. Word has length 572 [2018-10-15 15:01:36,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:36,084 INFO L481 AbstractCegarLoop]: Abstraction has 583 states and 583 transitions. [2018-10-15 15:01:36,084 INFO L482 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-10-15 15:01:36,084 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 583 transitions. [2018-10-15 15:01:36,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2018-10-15 15:01:36,088 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:36,088 INFO L375 BasicCegarLoop]: trace histogram [58, 57, 57, 57, 57, 57, 57, 57, 57, 57, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:36,089 INFO L424 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:36,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:36,089 INFO L82 PathProgramCache]: Analyzing trace with hash 936859820, now seen corresponding path program 57 times [2018-10-15 15:01:36,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:36,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:40,350 INFO L134 CoverageAnalysis]: Checked inductivity of 16074 backedges. 0 proven. 16074 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-10-15 15:01:40,351 INFO L460 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-10-15 15:01:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-10-15 15:01:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3484, Invalid=10558, Unknown=0, NotChecked=0, Total=14042 [2018-10-15 15:01:40,351 INFO L87 Difference]: Start difference. First operand 583 states and 583 transitions. Second operand 119 states. [2018-10-15 15:01:47,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:47,646 INFO L93 Difference]: Finished difference Result 604 states and 604 transitions. [2018-10-15 15:01:47,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 176 states. [2018-10-15 15:01:47,646 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 582 [2018-10-15 15:01:47,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:47,649 INFO L225 Difference]: With dead ends: 604 [2018-10-15 15:01:47,650 INFO L226 Difference]: Without dead ends: 600 [2018-10-15 15:01:47,651 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 233 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10087 ImplicationChecksByTransitivity, 10.5s TimeCoverageRelationStatistics Valid=16832, Invalid=38158, Unknown=0, NotChecked=0, Total=54990 [2018-10-15 15:01:47,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2018-10-15 15:01:47,655 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 593. [2018-10-15 15:01:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 593 states. [2018-10-15 15:01:47,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 593 states to 593 states and 593 transitions. [2018-10-15 15:01:47,655 INFO L78 Accepts]: Start accepts. Automaton has 593 states and 593 transitions. Word has length 582 [2018-10-15 15:01:47,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:47,656 INFO L481 AbstractCegarLoop]: Abstraction has 593 states and 593 transitions. [2018-10-15 15:01:47,656 INFO L482 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-10-15 15:01:47,656 INFO L276 IsEmpty]: Start isEmpty. Operand 593 states and 593 transitions. [2018-10-15 15:01:47,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2018-10-15 15:01:47,658 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:47,658 INFO L375 BasicCegarLoop]: trace histogram [59, 58, 58, 58, 58, 58, 58, 58, 58, 58, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:47,659 INFO L424 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:47,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:47,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1978961755, now seen corresponding path program 58 times [2018-10-15 15:01:47,659 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:47,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:01:51,750 INFO L134 CoverageAnalysis]: Checked inductivity of 16646 backedges. 0 proven. 16646 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:01:51,750 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:01:51,750 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-10-15 15:01:51,751 INFO L460 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-10-15 15:01:51,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-10-15 15:01:51,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3603, Invalid=10917, Unknown=0, NotChecked=0, Total=14520 [2018-10-15 15:01:51,752 INFO L87 Difference]: Start difference. First operand 593 states and 593 transitions. Second operand 121 states. [2018-10-15 15:01:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:01:59,162 INFO L93 Difference]: Finished difference Result 614 states and 614 transitions. [2018-10-15 15:01:59,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2018-10-15 15:01:59,162 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 592 [2018-10-15 15:01:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:01:59,165 INFO L225 Difference]: With dead ends: 614 [2018-10-15 15:01:59,165 INFO L226 Difference]: Without dead ends: 610 [2018-10-15 15:01:59,167 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 237 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10438 ImplicationChecksByTransitivity, 10.4s TimeCoverageRelationStatistics Valid=17417, Invalid=39465, Unknown=0, NotChecked=0, Total=56882 [2018-10-15 15:01:59,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2018-10-15 15:01:59,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 603. [2018-10-15 15:01:59,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 603 states. [2018-10-15 15:01:59,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 603 states and 603 transitions. [2018-10-15 15:01:59,172 INFO L78 Accepts]: Start accepts. Automaton has 603 states and 603 transitions. Word has length 592 [2018-10-15 15:01:59,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:01:59,172 INFO L481 AbstractCegarLoop]: Abstraction has 603 states and 603 transitions. [2018-10-15 15:01:59,172 INFO L482 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-10-15 15:01:59,172 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 603 transitions. [2018-10-15 15:01:59,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2018-10-15 15:01:59,175 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:01:59,175 INFO L375 BasicCegarLoop]: trace histogram [60, 59, 59, 59, 59, 59, 59, 59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:01:59,175 INFO L424 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:01:59,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:01:59,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2044491594, now seen corresponding path program 59 times [2018-10-15 15:01:59,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:01:59,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 17228 backedges. 0 proven. 17228 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:03,692 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:03,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-10-15 15:02:03,692 INFO L460 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-10-15 15:02:03,693 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-10-15 15:02:03,694 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3724, Invalid=11282, Unknown=0, NotChecked=0, Total=15006 [2018-10-15 15:02:03,694 INFO L87 Difference]: Start difference. First operand 603 states and 603 transitions. Second operand 123 states. [2018-10-15 15:02:11,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:11,253 INFO L93 Difference]: Finished difference Result 624 states and 624 transitions. [2018-10-15 15:02:11,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 182 states. [2018-10-15 15:02:11,253 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 602 [2018-10-15 15:02:11,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:11,255 INFO L225 Difference]: With dead ends: 624 [2018-10-15 15:02:11,255 INFO L226 Difference]: Without dead ends: 620 [2018-10-15 15:02:11,257 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 241 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10795 ImplicationChecksByTransitivity, 10.9s TimeCoverageRelationStatistics Valid=18012, Invalid=40794, Unknown=0, NotChecked=0, Total=58806 [2018-10-15 15:02:11,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 620 states. [2018-10-15 15:02:11,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 620 to 613. [2018-10-15 15:02:11,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 613 states. [2018-10-15 15:02:11,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 613 states to 613 states and 613 transitions. [2018-10-15 15:02:11,262 INFO L78 Accepts]: Start accepts. Automaton has 613 states and 613 transitions. Word has length 602 [2018-10-15 15:02:11,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:11,263 INFO L481 AbstractCegarLoop]: Abstraction has 613 states and 613 transitions. [2018-10-15 15:02:11,263 INFO L482 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-10-15 15:02:11,263 INFO L276 IsEmpty]: Start isEmpty. Operand 613 states and 613 transitions. [2018-10-15 15:02:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 613 [2018-10-15 15:02:11,266 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:11,266 INFO L375 BasicCegarLoop]: trace histogram [61, 60, 60, 60, 60, 60, 60, 60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:11,266 INFO L424 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:11,266 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1741848697, now seen corresponding path program 60 times [2018-10-15 15:02:11,267 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:11,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:15,891 INFO L134 CoverageAnalysis]: Checked inductivity of 17820 backedges. 0 proven. 17820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:15,891 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:15,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-10-15 15:02:15,892 INFO L460 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-10-15 15:02:15,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-10-15 15:02:15,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3847, Invalid=11653, Unknown=0, NotChecked=0, Total=15500 [2018-10-15 15:02:15,893 INFO L87 Difference]: Start difference. First operand 613 states and 613 transitions. Second operand 125 states. [2018-10-15 15:02:23,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:23,905 INFO L93 Difference]: Finished difference Result 634 states and 634 transitions. [2018-10-15 15:02:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 185 states. [2018-10-15 15:02:23,905 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 612 [2018-10-15 15:02:23,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:23,909 INFO L225 Difference]: With dead ends: 634 [2018-10-15 15:02:23,909 INFO L226 Difference]: Without dead ends: 630 [2018-10-15 15:02:23,911 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 245 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11158 ImplicationChecksByTransitivity, 11.5s TimeCoverageRelationStatistics Valid=18617, Invalid=42145, Unknown=0, NotChecked=0, Total=60762 [2018-10-15 15:02:23,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2018-10-15 15:02:23,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 623. [2018-10-15 15:02:23,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 623 states. [2018-10-15 15:02:23,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 623 transitions. [2018-10-15 15:02:23,916 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 623 transitions. Word has length 612 [2018-10-15 15:02:23,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:23,916 INFO L481 AbstractCegarLoop]: Abstraction has 623 states and 623 transitions. [2018-10-15 15:02:23,916 INFO L482 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-10-15 15:02:23,916 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 623 transitions. [2018-10-15 15:02:23,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2018-10-15 15:02:23,919 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:23,919 INFO L375 BasicCegarLoop]: trace histogram [62, 61, 61, 61, 61, 61, 61, 61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:23,919 INFO L424 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:23,919 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:23,920 INFO L82 PathProgramCache]: Analyzing trace with hash 982391528, now seen corresponding path program 61 times [2018-10-15 15:02:23,920 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:23,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:28,704 INFO L134 CoverageAnalysis]: Checked inductivity of 18422 backedges. 0 proven. 18422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:28,705 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:28,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-10-15 15:02:28,706 INFO L460 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-10-15 15:02:28,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-10-15 15:02:28,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3972, Invalid=12030, Unknown=0, NotChecked=0, Total=16002 [2018-10-15 15:02:28,707 INFO L87 Difference]: Start difference. First operand 623 states and 623 transitions. Second operand 127 states. [2018-10-15 15:02:36,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:36,409 INFO L93 Difference]: Finished difference Result 644 states and 644 transitions. [2018-10-15 15:02:36,410 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 188 states. [2018-10-15 15:02:36,410 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 622 [2018-10-15 15:02:36,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:36,413 INFO L225 Difference]: With dead ends: 644 [2018-10-15 15:02:36,413 INFO L226 Difference]: Without dead ends: 640 [2018-10-15 15:02:36,415 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 249 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11527 ImplicationChecksByTransitivity, 11.4s TimeCoverageRelationStatistics Valid=19232, Invalid=43518, Unknown=0, NotChecked=0, Total=62750 [2018-10-15 15:02:36,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2018-10-15 15:02:36,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 633. [2018-10-15 15:02:36,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 633 states. [2018-10-15 15:02:36,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 633 states to 633 states and 633 transitions. [2018-10-15 15:02:36,420 INFO L78 Accepts]: Start accepts. Automaton has 633 states and 633 transitions. Word has length 622 [2018-10-15 15:02:36,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:36,420 INFO L481 AbstractCegarLoop]: Abstraction has 633 states and 633 transitions. [2018-10-15 15:02:36,420 INFO L482 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-10-15 15:02:36,420 INFO L276 IsEmpty]: Start isEmpty. Operand 633 states and 633 transitions. [2018-10-15 15:02:36,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2018-10-15 15:02:36,423 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:36,423 INFO L375 BasicCegarLoop]: trace histogram [63, 62, 62, 62, 62, 62, 62, 62, 62, 62, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:36,423 INFO L424 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:36,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:36,424 INFO L82 PathProgramCache]: Analyzing trace with hash 1111144087, now seen corresponding path program 62 times [2018-10-15 15:02:36,424 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:36,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:41,333 INFO L134 CoverageAnalysis]: Checked inductivity of 19034 backedges. 0 proven. 19034 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:41,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:41,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-10-15 15:02:41,334 INFO L460 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-10-15 15:02:41,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-10-15 15:02:41,335 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4099, Invalid=12413, Unknown=0, NotChecked=0, Total=16512 [2018-10-15 15:02:41,335 INFO L87 Difference]: Start difference. First operand 633 states and 633 transitions. Second operand 129 states. [2018-10-15 15:02:49,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:02:49,930 INFO L93 Difference]: Finished difference Result 654 states and 654 transitions. [2018-10-15 15:02:49,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 191 states. [2018-10-15 15:02:49,931 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 632 [2018-10-15 15:02:49,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:02:49,934 INFO L225 Difference]: With dead ends: 654 [2018-10-15 15:02:49,934 INFO L226 Difference]: Without dead ends: 650 [2018-10-15 15:02:49,938 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 255 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 253 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11902 ImplicationChecksByTransitivity, 12.2s TimeCoverageRelationStatistics Valid=19857, Invalid=44913, Unknown=0, NotChecked=0, Total=64770 [2018-10-15 15:02:49,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 650 states. [2018-10-15 15:02:49,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 650 to 643. [2018-10-15 15:02:49,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 643 states. [2018-10-15 15:02:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 643 transitions. [2018-10-15 15:02:49,945 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 643 transitions. Word has length 632 [2018-10-15 15:02:49,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:02:49,945 INFO L481 AbstractCegarLoop]: Abstraction has 643 states and 643 transitions. [2018-10-15 15:02:49,945 INFO L482 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-10-15 15:02:49,945 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 643 transitions. [2018-10-15 15:02:49,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2018-10-15 15:02:49,948 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:02:49,948 INFO L375 BasicCegarLoop]: trace histogram [64, 63, 63, 63, 63, 63, 63, 63, 63, 63, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:02:49,948 INFO L424 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:02:49,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:02:49,949 INFO L82 PathProgramCache]: Analyzing trace with hash -478690426, now seen corresponding path program 63 times [2018-10-15 15:02:49,949 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:02:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:02:55,090 INFO L134 CoverageAnalysis]: Checked inductivity of 19656 backedges. 0 proven. 19656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:02:55,090 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:02:55,091 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-10-15 15:02:55,091 INFO L460 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-10-15 15:02:55,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-10-15 15:02:55,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4228, Invalid=12802, Unknown=0, NotChecked=0, Total=17030 [2018-10-15 15:02:55,093 INFO L87 Difference]: Start difference. First operand 643 states and 643 transitions. Second operand 131 states. [2018-10-15 15:03:03,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:03,370 INFO L93 Difference]: Finished difference Result 664 states and 664 transitions. [2018-10-15 15:03:03,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 194 states. [2018-10-15 15:03:03,371 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 642 [2018-10-15 15:03:03,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:03,374 INFO L225 Difference]: With dead ends: 664 [2018-10-15 15:03:03,374 INFO L226 Difference]: Without dead ends: 660 [2018-10-15 15:03:03,376 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 259 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12283 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=20492, Invalid=46330, Unknown=0, NotChecked=0, Total=66822 [2018-10-15 15:03:03,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 660 states. [2018-10-15 15:03:03,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 660 to 653. [2018-10-15 15:03:03,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 653 states. [2018-10-15 15:03:03,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 653 states to 653 states and 653 transitions. [2018-10-15 15:03:03,380 INFO L78 Accepts]: Start accepts. Automaton has 653 states and 653 transitions. Word has length 642 [2018-10-15 15:03:03,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:03,381 INFO L481 AbstractCegarLoop]: Abstraction has 653 states and 653 transitions. [2018-10-15 15:03:03,381 INFO L482 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-10-15 15:03:03,381 INFO L276 IsEmpty]: Start isEmpty. Operand 653 states and 653 transitions. [2018-10-15 15:03:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2018-10-15 15:03:03,384 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:03,384 INFO L375 BasicCegarLoop]: trace histogram [65, 64, 64, 64, 64, 64, 64, 64, 64, 64, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:03,385 INFO L424 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:03,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:03,385 INFO L82 PathProgramCache]: Analyzing trace with hash -1772572235, now seen corresponding path program 64 times [2018-10-15 15:03:03,386 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:08,693 INFO L134 CoverageAnalysis]: Checked inductivity of 20288 backedges. 0 proven. 20288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:08,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:08,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-10-15 15:03:08,694 INFO L460 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-10-15 15:03:08,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-10-15 15:03:08,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4359, Invalid=13197, Unknown=0, NotChecked=0, Total=17556 [2018-10-15 15:03:08,696 INFO L87 Difference]: Start difference. First operand 653 states and 653 transitions. Second operand 133 states. [2018-10-15 15:03:17,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:17,491 INFO L93 Difference]: Finished difference Result 674 states and 674 transitions. [2018-10-15 15:03:17,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 197 states. [2018-10-15 15:03:17,491 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 652 [2018-10-15 15:03:17,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:17,493 INFO L225 Difference]: With dead ends: 674 [2018-10-15 15:03:17,493 INFO L226 Difference]: Without dead ends: 670 [2018-10-15 15:03:17,495 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 261 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12670 ImplicationChecksByTransitivity, 12.7s TimeCoverageRelationStatistics Valid=21137, Invalid=47769, Unknown=0, NotChecked=0, Total=68906 [2018-10-15 15:03:17,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2018-10-15 15:03:17,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 663. [2018-10-15 15:03:17,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 663 states. [2018-10-15 15:03:17,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 663 transitions. [2018-10-15 15:03:17,500 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 663 transitions. Word has length 652 [2018-10-15 15:03:17,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:17,500 INFO L481 AbstractCegarLoop]: Abstraction has 663 states and 663 transitions. [2018-10-15 15:03:17,501 INFO L482 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-10-15 15:03:17,501 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 663 transitions. [2018-10-15 15:03:17,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 663 [2018-10-15 15:03:17,504 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:17,504 INFO L375 BasicCegarLoop]: trace histogram [66, 65, 65, 65, 65, 65, 65, 65, 65, 65, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:17,504 INFO L424 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:17,504 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:17,504 INFO L82 PathProgramCache]: Analyzing trace with hash 627372324, now seen corresponding path program 65 times [2018-10-15 15:03:17,505 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:17,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:22,839 INFO L134 CoverageAnalysis]: Checked inductivity of 20930 backedges. 0 proven. 20930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:22,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:22,839 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-10-15 15:03:22,840 INFO L460 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-10-15 15:03:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-10-15 15:03:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4492, Invalid=13598, Unknown=0, NotChecked=0, Total=18090 [2018-10-15 15:03:22,841 INFO L87 Difference]: Start difference. First operand 663 states and 663 transitions. Second operand 135 states. [2018-10-15 15:03:32,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:32,169 INFO L93 Difference]: Finished difference Result 684 states and 684 transitions. [2018-10-15 15:03:32,169 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 200 states. [2018-10-15 15:03:32,170 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 662 [2018-10-15 15:03:32,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:32,173 INFO L225 Difference]: With dead ends: 684 [2018-10-15 15:03:32,173 INFO L226 Difference]: Without dead ends: 680 [2018-10-15 15:03:32,175 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 265 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13063 ImplicationChecksByTransitivity, 13.2s TimeCoverageRelationStatistics Valid=21792, Invalid=49230, Unknown=0, NotChecked=0, Total=71022 [2018-10-15 15:03:32,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 680 states. [2018-10-15 15:03:32,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 680 to 673. [2018-10-15 15:03:32,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 673 states. [2018-10-15 15:03:32,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 673 states and 673 transitions. [2018-10-15 15:03:32,179 INFO L78 Accepts]: Start accepts. Automaton has 673 states and 673 transitions. Word has length 662 [2018-10-15 15:03:32,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:32,179 INFO L481 AbstractCegarLoop]: Abstraction has 673 states and 673 transitions. [2018-10-15 15:03:32,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-10-15 15:03:32,180 INFO L276 IsEmpty]: Start isEmpty. Operand 673 states and 673 transitions. [2018-10-15 15:03:32,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 673 [2018-10-15 15:03:32,183 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:32,183 INFO L375 BasicCegarLoop]: trace histogram [67, 66, 66, 66, 66, 66, 66, 66, 66, 66, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:32,183 INFO L424 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:32,183 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:32,183 INFO L82 PathProgramCache]: Analyzing trace with hash 748155347, now seen corresponding path program 66 times [2018-10-15 15:03:32,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:32,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:37,747 INFO L134 CoverageAnalysis]: Checked inductivity of 21582 backedges. 0 proven. 21582 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:37,748 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:37,748 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-10-15 15:03:37,749 INFO L460 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-10-15 15:03:37,749 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-10-15 15:03:37,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4627, Invalid=14005, Unknown=0, NotChecked=0, Total=18632 [2018-10-15 15:03:37,750 INFO L87 Difference]: Start difference. First operand 673 states and 673 transitions. Second operand 137 states. [2018-10-15 15:03:47,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:03:47,113 INFO L93 Difference]: Finished difference Result 694 states and 694 transitions. [2018-10-15 15:03:47,113 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 203 states. [2018-10-15 15:03:47,113 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 672 [2018-10-15 15:03:47,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:03:47,115 INFO L225 Difference]: With dead ends: 694 [2018-10-15 15:03:47,115 INFO L226 Difference]: Without dead ends: 690 [2018-10-15 15:03:47,117 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 271 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 269 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13462 ImplicationChecksByTransitivity, 13.6s TimeCoverageRelationStatistics Valid=22457, Invalid=50713, Unknown=0, NotChecked=0, Total=73170 [2018-10-15 15:03:47,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2018-10-15 15:03:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 683. [2018-10-15 15:03:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 683 states. [2018-10-15 15:03:47,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 683 states to 683 states and 683 transitions. [2018-10-15 15:03:47,122 INFO L78 Accepts]: Start accepts. Automaton has 683 states and 683 transitions. Word has length 672 [2018-10-15 15:03:47,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:03:47,122 INFO L481 AbstractCegarLoop]: Abstraction has 683 states and 683 transitions. [2018-10-15 15:03:47,122 INFO L482 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-10-15 15:03:47,122 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 683 transitions. [2018-10-15 15:03:47,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 683 [2018-10-15 15:03:47,125 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:03:47,125 INFO L375 BasicCegarLoop]: trace histogram [68, 67, 67, 67, 67, 67, 67, 67, 67, 67, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:03:47,126 INFO L424 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:03:47,126 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:03:47,126 INFO L82 PathProgramCache]: Analyzing trace with hash -664722494, now seen corresponding path program 67 times [2018-10-15 15:03:47,127 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:03:47,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:03:52,912 INFO L134 CoverageAnalysis]: Checked inductivity of 22244 backedges. 0 proven. 22244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:03:52,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:03:52,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [139] total 139 [2018-10-15 15:03:52,913 INFO L460 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-10-15 15:03:52,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-10-15 15:03:52,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4764, Invalid=14418, Unknown=0, NotChecked=0, Total=19182 [2018-10-15 15:03:52,914 INFO L87 Difference]: Start difference. First operand 683 states and 683 transitions. Second operand 139 states. [2018-10-15 15:04:02,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:02,678 INFO L93 Difference]: Finished difference Result 704 states and 704 transitions. [2018-10-15 15:04:02,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 206 states. [2018-10-15 15:04:02,678 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 682 [2018-10-15 15:04:02,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:02,680 INFO L225 Difference]: With dead ends: 704 [2018-10-15 15:04:02,680 INFO L226 Difference]: Without dead ends: 700 [2018-10-15 15:04:02,682 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 273 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13867 ImplicationChecksByTransitivity, 14.2s TimeCoverageRelationStatistics Valid=23132, Invalid=52218, Unknown=0, NotChecked=0, Total=75350 [2018-10-15 15:04:02,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states. [2018-10-15 15:04:02,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 693. [2018-10-15 15:04:02,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 693 states. [2018-10-15 15:04:02,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 693 transitions. [2018-10-15 15:04:02,687 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 693 transitions. Word has length 682 [2018-10-15 15:04:02,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:02,688 INFO L481 AbstractCegarLoop]: Abstraction has 693 states and 693 transitions. [2018-10-15 15:04:02,688 INFO L482 AbstractCegarLoop]: Interpolant automaton has 139 states. [2018-10-15 15:04:02,688 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 693 transitions. [2018-10-15 15:04:02,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 693 [2018-10-15 15:04:02,691 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:02,691 INFO L375 BasicCegarLoop]: trace histogram [69, 68, 68, 68, 68, 68, 68, 68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:02,691 INFO L424 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:02,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:02,692 INFO L82 PathProgramCache]: Analyzing trace with hash -459016463, now seen corresponding path program 68 times [2018-10-15 15:04:02,692 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:02,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:08,668 INFO L134 CoverageAnalysis]: Checked inductivity of 22916 backedges. 0 proven. 22916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:08,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:08,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [141] total 141 [2018-10-15 15:04:08,669 INFO L460 AbstractCegarLoop]: Interpolant automaton has 141 states [2018-10-15 15:04:08,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 141 interpolants. [2018-10-15 15:04:08,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=4903, Invalid=14837, Unknown=0, NotChecked=0, Total=19740 [2018-10-15 15:04:08,670 INFO L87 Difference]: Start difference. First operand 693 states and 693 transitions. Second operand 141 states. [2018-10-15 15:04:18,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:18,523 INFO L93 Difference]: Finished difference Result 714 states and 714 transitions. [2018-10-15 15:04:18,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 209 states. [2018-10-15 15:04:18,524 INFO L78 Accepts]: Start accepts. Automaton has 141 states. Word has length 692 [2018-10-15 15:04:18,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:18,526 INFO L225 Difference]: With dead ends: 714 [2018-10-15 15:04:18,526 INFO L226 Difference]: Without dead ends: 710 [2018-10-15 15:04:18,528 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 277 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14278 ImplicationChecksByTransitivity, 14.4s TimeCoverageRelationStatistics Valid=23817, Invalid=53745, Unknown=0, NotChecked=0, Total=77562 [2018-10-15 15:04:18,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2018-10-15 15:04:18,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 703. [2018-10-15 15:04:18,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 703 states. [2018-10-15 15:04:18,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 703 states to 703 states and 703 transitions. [2018-10-15 15:04:18,533 INFO L78 Accepts]: Start accepts. Automaton has 703 states and 703 transitions. Word has length 692 [2018-10-15 15:04:18,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:18,533 INFO L481 AbstractCegarLoop]: Abstraction has 703 states and 703 transitions. [2018-10-15 15:04:18,533 INFO L482 AbstractCegarLoop]: Interpolant automaton has 141 states. [2018-10-15 15:04:18,533 INFO L276 IsEmpty]: Start isEmpty. Operand 703 states and 703 transitions. [2018-10-15 15:04:18,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 703 [2018-10-15 15:04:18,536 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:18,537 INFO L375 BasicCegarLoop]: trace histogram [70, 69, 69, 69, 69, 69, 69, 69, 69, 69, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:18,537 INFO L424 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:18,537 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:18,537 INFO L82 PathProgramCache]: Analyzing trace with hash -608707744, now seen corresponding path program 69 times [2018-10-15 15:04:18,538 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:18,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:24,561 INFO L134 CoverageAnalysis]: Checked inductivity of 23598 backedges. 0 proven. 23598 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:24,561 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:24,562 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [143] total 143 [2018-10-15 15:04:24,562 INFO L460 AbstractCegarLoop]: Interpolant automaton has 143 states [2018-10-15 15:04:24,563 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 143 interpolants. [2018-10-15 15:04:24,563 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5044, Invalid=15262, Unknown=0, NotChecked=0, Total=20306 [2018-10-15 15:04:24,563 INFO L87 Difference]: Start difference. First operand 703 states and 703 transitions. Second operand 143 states. [2018-10-15 15:04:34,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:34,953 INFO L93 Difference]: Finished difference Result 724 states and 724 transitions. [2018-10-15 15:04:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 212 states. [2018-10-15 15:04:34,954 INFO L78 Accepts]: Start accepts. Automaton has 143 states. Word has length 702 [2018-10-15 15:04:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:34,957 INFO L225 Difference]: With dead ends: 724 [2018-10-15 15:04:34,957 INFO L226 Difference]: Without dead ends: 720 [2018-10-15 15:04:34,959 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 283 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 281 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14695 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=24512, Invalid=55294, Unknown=0, NotChecked=0, Total=79806 [2018-10-15 15:04:34,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 720 states. [2018-10-15 15:04:34,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 720 to 713. [2018-10-15 15:04:34,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 713 states. [2018-10-15 15:04:34,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 713 states to 713 states and 713 transitions. [2018-10-15 15:04:34,964 INFO L78 Accepts]: Start accepts. Automaton has 713 states and 713 transitions. Word has length 702 [2018-10-15 15:04:34,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:34,965 INFO L481 AbstractCegarLoop]: Abstraction has 713 states and 713 transitions. [2018-10-15 15:04:34,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 143 states. [2018-10-15 15:04:34,965 INFO L276 IsEmpty]: Start isEmpty. Operand 713 states and 713 transitions. [2018-10-15 15:04:34,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 713 [2018-10-15 15:04:34,968 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:34,968 INFO L375 BasicCegarLoop]: trace histogram [71, 70, 70, 70, 70, 70, 70, 70, 70, 70, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:34,969 INFO L424 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:34,969 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:34,969 INFO L82 PathProgramCache]: Analyzing trace with hash -1788329713, now seen corresponding path program 70 times [2018-10-15 15:04:34,970 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:35,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:41,588 INFO L134 CoverageAnalysis]: Checked inductivity of 24290 backedges. 0 proven. 24290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:41,588 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:41,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [145] total 145 [2018-10-15 15:04:41,589 INFO L460 AbstractCegarLoop]: Interpolant automaton has 145 states [2018-10-15 15:04:41,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 145 interpolants. [2018-10-15 15:04:41,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5187, Invalid=15693, Unknown=0, NotChecked=0, Total=20880 [2018-10-15 15:04:41,590 INFO L87 Difference]: Start difference. First operand 713 states and 713 transitions. Second operand 145 states. [2018-10-15 15:04:52,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:04:52,219 INFO L93 Difference]: Finished difference Result 734 states and 734 transitions. [2018-10-15 15:04:52,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 215 states. [2018-10-15 15:04:52,219 INFO L78 Accepts]: Start accepts. Automaton has 145 states. Word has length 712 [2018-10-15 15:04:52,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:04:52,222 INFO L225 Difference]: With dead ends: 734 [2018-10-15 15:04:52,222 INFO L226 Difference]: Without dead ends: 730 [2018-10-15 15:04:52,225 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 287 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 285 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15118 ImplicationChecksByTransitivity, 15.8s TimeCoverageRelationStatistics Valid=25217, Invalid=56865, Unknown=0, NotChecked=0, Total=82082 [2018-10-15 15:04:52,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2018-10-15 15:04:52,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 723. [2018-10-15 15:04:52,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 723 states. [2018-10-15 15:04:52,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 723 states to 723 states and 723 transitions. [2018-10-15 15:04:52,229 INFO L78 Accepts]: Start accepts. Automaton has 723 states and 723 transitions. Word has length 712 [2018-10-15 15:04:52,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:04:52,230 INFO L481 AbstractCegarLoop]: Abstraction has 723 states and 723 transitions. [2018-10-15 15:04:52,230 INFO L482 AbstractCegarLoop]: Interpolant automaton has 145 states. [2018-10-15 15:04:52,230 INFO L276 IsEmpty]: Start isEmpty. Operand 723 states and 723 transitions. [2018-10-15 15:04:52,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 723 [2018-10-15 15:04:52,233 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:04:52,234 INFO L375 BasicCegarLoop]: trace histogram [72, 71, 71, 71, 71, 71, 71, 71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:04:52,234 INFO L424 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:04:52,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:04:52,234 INFO L82 PathProgramCache]: Analyzing trace with hash -168519682, now seen corresponding path program 71 times [2018-10-15 15:04:52,235 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:04:52,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:04:58,900 INFO L134 CoverageAnalysis]: Checked inductivity of 24992 backedges. 0 proven. 24992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:04:58,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:04:58,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [147] total 147 [2018-10-15 15:04:58,901 INFO L460 AbstractCegarLoop]: Interpolant automaton has 147 states [2018-10-15 15:04:58,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2018-10-15 15:04:58,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5332, Invalid=16130, Unknown=0, NotChecked=0, Total=21462 [2018-10-15 15:04:58,903 INFO L87 Difference]: Start difference. First operand 723 states and 723 transitions. Second operand 147 states. [2018-10-15 15:05:09,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:09,738 INFO L93 Difference]: Finished difference Result 744 states and 744 transitions. [2018-10-15 15:05:09,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 218 states. [2018-10-15 15:05:09,739 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 722 [2018-10-15 15:05:09,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:09,742 INFO L225 Difference]: With dead ends: 744 [2018-10-15 15:05:09,742 INFO L226 Difference]: Without dead ends: 740 [2018-10-15 15:05:09,744 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 289 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15547 ImplicationChecksByTransitivity, 16.1s TimeCoverageRelationStatistics Valid=25932, Invalid=58458, Unknown=0, NotChecked=0, Total=84390 [2018-10-15 15:05:09,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 740 states. [2018-10-15 15:05:09,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 740 to 733. [2018-10-15 15:05:09,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 733 states. [2018-10-15 15:05:09,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 733 states to 733 states and 733 transitions. [2018-10-15 15:05:09,749 INFO L78 Accepts]: Start accepts. Automaton has 733 states and 733 transitions. Word has length 722 [2018-10-15 15:05:09,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:09,750 INFO L481 AbstractCegarLoop]: Abstraction has 733 states and 733 transitions. [2018-10-15 15:05:09,750 INFO L482 AbstractCegarLoop]: Interpolant automaton has 147 states. [2018-10-15 15:05:09,750 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 733 transitions. [2018-10-15 15:05:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 733 [2018-10-15 15:05:09,753 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:09,754 INFO L375 BasicCegarLoop]: trace histogram [73, 72, 72, 72, 72, 72, 72, 72, 72, 72, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:09,754 INFO L424 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:09,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:09,754 INFO L82 PathProgramCache]: Analyzing trace with hash -317698003, now seen corresponding path program 72 times [2018-10-15 15:05:09,755 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:09,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:16,288 INFO L134 CoverageAnalysis]: Checked inductivity of 25704 backedges. 0 proven. 25704 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:16,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:16,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [149] total 149 [2018-10-15 15:05:16,290 INFO L460 AbstractCegarLoop]: Interpolant automaton has 149 states [2018-10-15 15:05:16,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 149 interpolants. [2018-10-15 15:05:16,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5479, Invalid=16573, Unknown=0, NotChecked=0, Total=22052 [2018-10-15 15:05:16,291 INFO L87 Difference]: Start difference. First operand 733 states and 733 transitions. Second operand 149 states. [2018-10-15 15:05:27,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:27,665 INFO L93 Difference]: Finished difference Result 754 states and 754 transitions. [2018-10-15 15:05:27,665 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 221 states. [2018-10-15 15:05:27,665 INFO L78 Accepts]: Start accepts. Automaton has 149 states. Word has length 732 [2018-10-15 15:05:27,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:27,668 INFO L225 Difference]: With dead ends: 754 [2018-10-15 15:05:27,668 INFO L226 Difference]: Without dead ends: 750 [2018-10-15 15:05:27,670 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 293 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15982 ImplicationChecksByTransitivity, 16.3s TimeCoverageRelationStatistics Valid=26657, Invalid=60073, Unknown=0, NotChecked=0, Total=86730 [2018-10-15 15:05:27,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2018-10-15 15:05:27,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 743. [2018-10-15 15:05:27,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 743 states. [2018-10-15 15:05:27,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 743 states and 743 transitions. [2018-10-15 15:05:27,674 INFO L78 Accepts]: Start accepts. Automaton has 743 states and 743 transitions. Word has length 732 [2018-10-15 15:05:27,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:27,675 INFO L481 AbstractCegarLoop]: Abstraction has 743 states and 743 transitions. [2018-10-15 15:05:27,675 INFO L482 AbstractCegarLoop]: Interpolant automaton has 149 states. [2018-10-15 15:05:27,675 INFO L276 IsEmpty]: Start isEmpty. Operand 743 states and 743 transitions. [2018-10-15 15:05:27,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 743 [2018-10-15 15:05:27,678 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:27,678 INFO L375 BasicCegarLoop]: trace histogram [74, 73, 73, 73, 73, 73, 73, 73, 73, 73, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:27,679 INFO L424 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:27,679 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:27,679 INFO L82 PathProgramCache]: Analyzing trace with hash -1260201572, now seen corresponding path program 73 times [2018-10-15 15:05:27,679 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:27,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-15 15:05:34,332 INFO L134 CoverageAnalysis]: Checked inductivity of 26426 backedges. 0 proven. 26426 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-15 15:05:34,332 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-10-15 15:05:34,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [151] total 151 [2018-10-15 15:05:34,333 INFO L460 AbstractCegarLoop]: Interpolant automaton has 151 states [2018-10-15 15:05:34,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 151 interpolants. [2018-10-15 15:05:34,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5628, Invalid=17022, Unknown=0, NotChecked=0, Total=22650 [2018-10-15 15:05:34,334 INFO L87 Difference]: Start difference. First operand 743 states and 743 transitions. Second operand 151 states. [2018-10-15 15:05:45,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-15 15:05:45,571 INFO L93 Difference]: Finished difference Result 764 states and 764 transitions. [2018-10-15 15:05:45,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 224 states. [2018-10-15 15:05:45,571 INFO L78 Accepts]: Start accepts. Automaton has 151 states. Word has length 742 [2018-10-15 15:05:45,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-10-15 15:05:45,575 INFO L225 Difference]: With dead ends: 764 [2018-10-15 15:05:45,576 INFO L226 Difference]: Without dead ends: 760 [2018-10-15 15:05:45,578 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 297 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16423 ImplicationChecksByTransitivity, 16.4s TimeCoverageRelationStatistics Valid=27392, Invalid=61710, Unknown=0, NotChecked=0, Total=89102 [2018-10-15 15:05:45,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2018-10-15 15:05:45,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 753. [2018-10-15 15:05:45,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 753 states. [2018-10-15 15:05:45,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 753 states to 753 states and 753 transitions. [2018-10-15 15:05:45,583 INFO L78 Accepts]: Start accepts. Automaton has 753 states and 753 transitions. Word has length 742 [2018-10-15 15:05:45,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-10-15 15:05:45,584 INFO L481 AbstractCegarLoop]: Abstraction has 753 states and 753 transitions. [2018-10-15 15:05:45,584 INFO L482 AbstractCegarLoop]: Interpolant automaton has 151 states. [2018-10-15 15:05:45,584 INFO L276 IsEmpty]: Start isEmpty. Operand 753 states and 753 transitions. [2018-10-15 15:05:45,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 753 [2018-10-15 15:05:45,588 INFO L367 BasicCegarLoop]: Found error trace [2018-10-15 15:05:45,588 INFO L375 BasicCegarLoop]: trace histogram [75, 74, 74, 74, 74, 74, 74, 74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-15 15:05:45,588 INFO L424 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-10-15 15:05:45,588 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-15 15:05:45,588 INFO L82 PathProgramCache]: Analyzing trace with hash 1359455307, now seen corresponding path program 74 times [2018-10-15 15:05:45,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-10-15 15:05:45,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat