java -Xmx8000000000 -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml --generate-csv --csv-dir csv -s ../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf -i ../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.23-e6fd87c [2018-07-25 13:21:01,439 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-07-25 13:21:01,442 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-07-25 13:21:01,454 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-07-25 13:21:01,455 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-07-25 13:21:01,456 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-07-25 13:21:01,457 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-07-25 13:21:01,459 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-07-25 13:21:01,460 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-07-25 13:21:01,461 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-07-25 13:21:01,462 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-07-25 13:21:01,463 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-07-25 13:21:01,464 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-07-25 13:21:01,464 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-07-25 13:21:01,466 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-07-25 13:21:01,466 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-07-25 13:21:01,467 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-07-25 13:21:01,469 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-07-25 13:21:01,471 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-07-25 13:21:01,473 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-07-25 13:21:01,474 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-07-25 13:21:01,475 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-07-25 13:21:01,478 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-07-25 13:21:01,478 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-07-25 13:21:01,478 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-07-25 13:21:01,479 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-07-25 13:21:01,480 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-07-25 13:21:01,481 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-07-25 13:21:01,482 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-07-25 13:21:01,483 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-07-25 13:21:01,483 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-07-25 13:21:01,484 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-07-25 13:21:01,484 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-07-25 13:21:01,484 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-07-25 13:21:01,485 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-07-25 13:21:01,486 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-07-25 13:21:01,486 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/Pdr/AutomizerBpl-nestedInterpolants.epf [2018-07-25 13:21:01,495 INFO L110 SettingsManager]: Loading preferences was successful [2018-07-25 13:21:01,495 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-07-25 13:21:01,497 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-07-25 13:21:01,497 INFO L133 SettingsManager]: * SMT solver=Internal_SMTInterpol [2018-07-25 13:21:01,497 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-07-25 13:21:01,497 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2018-07-25 13:21:01,497 INFO L133 SettingsManager]: * Use separate solver for trace checks=false [2018-07-25 13:21:01,498 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-07-25 13:21:01,544 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-07-25 13:21:01,557 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-07-25 13:21:01,561 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-07-25 13:21:01,563 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2018-07-25 13:21:01,564 INFO L276 PluginConnector]: Boogie PL CUP Parser initialized [2018-07-25 13:21:01,565 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl [2018-07-25 13:21:01,565 INFO L111 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20170304-DifficultPathPrograms/afnp2014.c.i_3.bpl' [2018-07-25 13:21:01,615 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-07-25 13:21:01,617 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2018-07-25 13:21:01,617 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-07-25 13:21:01,618 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-07-25 13:21:01,618 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-07-25 13:21:01,637 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,646 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,653 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-07-25 13:21:01,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-07-25 13:21:01,654 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-07-25 13:21:01,654 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-07-25 13:21:01,665 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,666 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,667 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,669 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,672 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,674 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-07-25 13:21:01,674 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-07-25 13:21:01,675 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-07-25 13:21:01,675 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-07-25 13:21:01,676 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/1) ... [2018-07-25 13:21:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-07-25 13:21:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-07-25 13:21:01,923 INFO L273 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-07-25 13:21:01,927 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:21:01 BoogieIcfgContainer [2018-07-25 13:21:01,928 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-07-25 13:21:01,929 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-07-25 13:21:01,929 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-07-25 13:21:01,933 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-07-25 13:21:01,934 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 25.07 01:21:01" (1/2) ... [2018-07-25 13:21:01,935 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24764d08 and model type afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.07 01:21:01, skipping insertion in model container [2018-07-25 13:21:01,935 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.07 01:21:01" (2/2) ... [2018-07-25 13:21:01,940 INFO L112 eAbstractionObserver]: Analyzing ICFG afnp2014.c.i_3.bpl [2018-07-25 13:21:01,951 INFO L133 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2018-07-25 13:21:01,961 INFO L145 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-07-25 13:21:02,016 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2018-07-25 13:21:02,017 INFO L374 AbstractCegarLoop]: Interprodecural is true [2018-07-25 13:21:02,018 INFO L375 AbstractCegarLoop]: Hoare is true [2018-07-25 13:21:02,018 INFO L376 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2018-07-25 13:21:02,018 INFO L377 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-07-25 13:21:02,018 INFO L378 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-07-25 13:21:02,019 INFO L379 AbstractCegarLoop]: Difference is false [2018-07-25 13:21:02,019 INFO L380 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-07-25 13:21:02,019 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-07-25 13:21:02,037 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states. [2018-07-25 13:21:02,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2018-07-25 13:21:02,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,048 INFO L354 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2018-07-25 13:21:02,049 INFO L415 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,055 INFO L82 PathProgramCache]: Analyzing trace with hash 925701, now seen corresponding path program 1 times [2018-07-25 13:21:02,062 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,142 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,145 INFO L309 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-07-25 13:21:02,145 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-07-25 13:21:02,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-07-25 13:21:02,162 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-07-25 13:21:02,162 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-07-25 13:21:02,164 INFO L87 Difference]: Start difference. First operand 6 states. Second operand 3 states. [2018-07-25 13:21:02,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,202 INFO L93 Difference]: Finished difference Result 10 states and 11 transitions. [2018-07-25 13:21:02,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-07-25 13:21:02,204 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 4 [2018-07-25 13:21:02,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,216 INFO L225 Difference]: With dead ends: 10 [2018-07-25 13:21:02,216 INFO L226 Difference]: Without dead ends: 7 [2018-07-25 13:21:02,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-07-25 13:21:02,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2018-07-25 13:21:02,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2018-07-25 13:21:02,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-07-25 13:21:02,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2018-07-25 13:21:02,257 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 4 [2018-07-25 13:21:02,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,258 INFO L472 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2018-07-25 13:21:02,258 INFO L473 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-07-25 13:21:02,259 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2018-07-25 13:21:02,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2018-07-25 13:21:02,259 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,259 INFO L354 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1] [2018-07-25 13:21:02,260 INFO L415 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,260 INFO L82 PathProgramCache]: Analyzing trace with hash 889531649, now seen corresponding path program 1 times [2018-07-25 13:21:02,260 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,294 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,295 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,295 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2018-07-25 13:21:02,297 INFO L451 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-07-25 13:21:02,297 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-07-25 13:21:02,298 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-07-25 13:21:02,298 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 4 states. [2018-07-25 13:21:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,339 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2018-07-25 13:21:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-07-25 13:21:02,339 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 6 [2018-07-25 13:21:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,340 INFO L225 Difference]: With dead ends: 11 [2018-07-25 13:21:02,340 INFO L226 Difference]: Without dead ends: 9 [2018-07-25 13:21:02,342 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:21:02,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2018-07-25 13:21:02,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2018-07-25 13:21:02,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2018-07-25 13:21:02,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2018-07-25 13:21:02,345 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 6 [2018-07-25 13:21:02,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,346 INFO L472 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2018-07-25 13:21:02,346 INFO L473 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-07-25 13:21:02,346 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2018-07-25 13:21:02,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-07-25 13:21:02,347 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,347 INFO L354 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1] [2018-07-25 13:21:02,347 INFO L415 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,348 INFO L82 PathProgramCache]: Analyzing trace with hash 141355773, now seen corresponding path program 2 times [2018-07-25 13:21:02,348 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,392 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2018-07-25 13:21:02,393 INFO L451 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-07-25 13:21:02,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-07-25 13:21:02,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-07-25 13:21:02,394 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2018-07-25 13:21:02,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,492 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2018-07-25 13:21:02,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-07-25 13:21:02,492 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2018-07-25 13:21:02,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,493 INFO L225 Difference]: With dead ends: 13 [2018-07-25 13:21:02,493 INFO L226 Difference]: Without dead ends: 11 [2018-07-25 13:21:02,494 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:21:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2018-07-25 13:21:02,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-07-25 13:21:02,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-07-25 13:21:02,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2018-07-25 13:21:02,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2018-07-25 13:21:02,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,500 INFO L472 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2018-07-25 13:21:02,500 INFO L473 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-07-25 13:21:02,500 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2018-07-25 13:21:02,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-07-25 13:21:02,501 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,501 INFO L354 BasicCegarLoop]: trace histogram [4, 3, 1, 1, 1] [2018-07-25 13:21:02,501 INFO L415 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1596122631, now seen corresponding path program 3 times [2018-07-25 13:21:02,502 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,569 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,570 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,570 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2018-07-25 13:21:02,571 INFO L451 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-07-25 13:21:02,571 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-07-25 13:21:02,572 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-07-25 13:21:02,572 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 6 states. [2018-07-25 13:21:02,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,620 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2018-07-25 13:21:02,620 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-07-25 13:21:02,621 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 10 [2018-07-25 13:21:02,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,621 INFO L225 Difference]: With dead ends: 15 [2018-07-25 13:21:02,622 INFO L226 Difference]: Without dead ends: 13 [2018-07-25 13:21:02,622 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:21:02,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2018-07-25 13:21:02,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2018-07-25 13:21:02,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-07-25 13:21:02,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2018-07-25 13:21:02,628 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2018-07-25 13:21:02,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,628 INFO L472 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2018-07-25 13:21:02,628 INFO L473 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-07-25 13:21:02,628 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2018-07-25 13:21:02,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-07-25 13:21:02,629 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,629 INFO L354 BasicCegarLoop]: trace histogram [5, 4, 1, 1, 1] [2018-07-25 13:21:02,630 INFO L415 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,630 INFO L82 PathProgramCache]: Analyzing trace with hash -570590731, now seen corresponding path program 4 times [2018-07-25 13:21:02,630 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,748 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,749 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,749 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2018-07-25 13:21:02,751 INFO L451 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-07-25 13:21:02,752 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-07-25 13:21:02,752 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:21:02,752 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 7 states. [2018-07-25 13:21:02,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:02,840 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-07-25 13:21:02,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-07-25 13:21:02,840 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 12 [2018-07-25 13:21:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:02,841 INFO L225 Difference]: With dead ends: 17 [2018-07-25 13:21:02,841 INFO L226 Difference]: Without dead ends: 15 [2018-07-25 13:21:02,842 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2018-07-25 13:21:02,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-07-25 13:21:02,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-07-25 13:21:02,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-07-25 13:21:02,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-07-25 13:21:02,861 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-07-25 13:21:02,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:02,862 INFO L472 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-07-25 13:21:02,862 INFO L473 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-07-25 13:21:02,862 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-07-25 13:21:02,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-07-25 13:21:02,863 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:02,863 INFO L354 BasicCegarLoop]: trace histogram [6, 5, 1, 1, 1] [2018-07-25 13:21:02,863 INFO L415 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:02,864 INFO L82 PathProgramCache]: Analyzing trace with hash 1418054385, now seen corresponding path program 5 times [2018-07-25 13:21:02,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:02,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:02,937 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:02,937 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:02,938 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2018-07-25 13:21:02,938 INFO L451 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-07-25 13:21:02,941 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-07-25 13:21:02,942 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:21:02,942 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2018-07-25 13:21:03,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,032 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2018-07-25 13:21:03,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-07-25 13:21:03,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2018-07-25 13:21:03,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,034 INFO L225 Difference]: With dead ends: 19 [2018-07-25 13:21:03,034 INFO L226 Difference]: Without dead ends: 17 [2018-07-25 13:21:03,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2018-07-25 13:21:03,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-07-25 13:21:03,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2018-07-25 13:21:03,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-07-25 13:21:03,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-07-25 13:21:03,042 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2018-07-25 13:21:03,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,046 INFO L472 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-07-25 13:21:03,046 INFO L473 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-07-25 13:21:03,046 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-07-25 13:21:03,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-07-25 13:21:03,047 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,047 INFO L354 BasicCegarLoop]: trace histogram [7, 6, 1, 1, 1] [2018-07-25 13:21:03,048 INFO L415 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,048 INFO L82 PathProgramCache]: Analyzing trace with hash 1245564141, now seen corresponding path program 6 times [2018-07-25 13:21:03,048 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,147 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,148 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,148 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2018-07-25 13:21:03,149 INFO L451 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-07-25 13:21:03,149 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-07-25 13:21:03,149 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:21:03,150 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 9 states. [2018-07-25 13:21:03,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,246 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-07-25 13:21:03,246 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-07-25 13:21:03,246 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 16 [2018-07-25 13:21:03,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,247 INFO L225 Difference]: With dead ends: 21 [2018-07-25 13:21:03,247 INFO L226 Difference]: Without dead ends: 19 [2018-07-25 13:21:03,250 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2018-07-25 13:21:03,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2018-07-25 13:21:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2018-07-25 13:21:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-07-25 13:21:03,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-07-25 13:21:03,268 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 16 [2018-07-25 13:21:03,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,268 INFO L472 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-07-25 13:21:03,268 INFO L473 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-07-25 13:21:03,269 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-07-25 13:21:03,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-07-25 13:21:03,269 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,270 INFO L354 BasicCegarLoop]: trace histogram [8, 7, 1, 1, 1] [2018-07-25 13:21:03,270 INFO L415 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1308803095, now seen corresponding path program 7 times [2018-07-25 13:21:03,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,323 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,324 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,324 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2018-07-25 13:21:03,324 INFO L451 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-07-25 13:21:03,325 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-07-25 13:21:03,325 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:21:03,325 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 10 states. [2018-07-25 13:21:03,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,412 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-07-25 13:21:03,412 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-07-25 13:21:03,412 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 18 [2018-07-25 13:21:03,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,413 INFO L225 Difference]: With dead ends: 23 [2018-07-25 13:21:03,413 INFO L226 Difference]: Without dead ends: 21 [2018-07-25 13:21:03,414 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2018-07-25 13:21:03,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-07-25 13:21:03,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-07-25 13:21:03,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-07-25 13:21:03,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-07-25 13:21:03,422 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 18 [2018-07-25 13:21:03,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,422 INFO L472 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-07-25 13:21:03,422 INFO L473 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-07-25 13:21:03,422 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-07-25 13:21:03,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-07-25 13:21:03,423 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,425 INFO L354 BasicCegarLoop]: trace histogram [9, 8, 1, 1, 1] [2018-07-25 13:21:03,426 INFO L415 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,427 INFO L82 PathProgramCache]: Analyzing trace with hash 665576421, now seen corresponding path program 8 times [2018-07-25 13:21:03,427 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,517 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 72 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,518 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,521 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2018-07-25 13:21:03,521 INFO L451 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-07-25 13:21:03,522 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-07-25 13:21:03,522 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:21:03,523 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 11 states. [2018-07-25 13:21:03,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,610 INFO L93 Difference]: Finished difference Result 25 states and 25 transitions. [2018-07-25 13:21:03,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-07-25 13:21:03,611 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-07-25 13:21:03,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,612 INFO L225 Difference]: With dead ends: 25 [2018-07-25 13:21:03,614 INFO L226 Difference]: Without dead ends: 23 [2018-07-25 13:21:03,614 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2018-07-25 13:21:03,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2018-07-25 13:21:03,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2018-07-25 13:21:03,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2018-07-25 13:21:03,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2018-07-25 13:21:03,628 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 20 [2018-07-25 13:21:03,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,630 INFO L472 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2018-07-25 13:21:03,630 INFO L473 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-07-25 13:21:03,631 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2018-07-25 13:21:03,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-07-25 13:21:03,631 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,632 INFO L354 BasicCegarLoop]: trace histogram [10, 9, 1, 1, 1] [2018-07-25 13:21:03,632 INFO L415 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,632 INFO L82 PathProgramCache]: Analyzing trace with hash -331253535, now seen corresponding path program 9 times [2018-07-25 13:21:03,633 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,712 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 0 proven. 90 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,713 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,713 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2018-07-25 13:21:03,715 INFO L451 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-07-25 13:21:03,715 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-07-25 13:21:03,716 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:21:03,717 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 12 states. [2018-07-25 13:21:03,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,805 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2018-07-25 13:21:03,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-07-25 13:21:03,806 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 22 [2018-07-25 13:21:03,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,807 INFO L225 Difference]: With dead ends: 27 [2018-07-25 13:21:03,807 INFO L226 Difference]: Without dead ends: 25 [2018-07-25 13:21:03,807 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2018-07-25 13:21:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-07-25 13:21:03,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2018-07-25 13:21:03,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-07-25 13:21:03,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2018-07-25 13:21:03,817 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2018-07-25 13:21:03,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,817 INFO L472 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2018-07-25 13:21:03,818 INFO L473 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-07-25 13:21:03,818 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2018-07-25 13:21:03,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-07-25 13:21:03,819 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,819 INFO L354 BasicCegarLoop]: trace histogram [11, 10, 1, 1, 1] [2018-07-25 13:21:03,819 INFO L415 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,819 INFO L82 PathProgramCache]: Analyzing trace with hash -507134243, now seen corresponding path program 10 times [2018-07-25 13:21:03,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:03,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:03,892 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 0 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:03,893 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:03,893 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2018-07-25 13:21:03,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-07-25 13:21:03,894 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-07-25 13:21:03,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:21:03,894 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand 13 states. [2018-07-25 13:21:03,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:03,976 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2018-07-25 13:21:03,976 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-07-25 13:21:03,977 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 24 [2018-07-25 13:21:03,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:03,977 INFO L225 Difference]: With dead ends: 29 [2018-07-25 13:21:03,978 INFO L226 Difference]: Without dead ends: 27 [2018-07-25 13:21:03,978 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2018-07-25 13:21:03,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-07-25 13:21:03,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-07-25 13:21:03,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-07-25 13:21:03,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-07-25 13:21:03,991 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 24 [2018-07-25 13:21:03,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:03,992 INFO L472 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-07-25 13:21:03,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-07-25 13:21:03,992 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-07-25 13:21:03,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-07-25 13:21:03,994 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:03,994 INFO L354 BasicCegarLoop]: trace histogram [12, 11, 1, 1, 1] [2018-07-25 13:21:03,995 INFO L415 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:03,995 INFO L82 PathProgramCache]: Analyzing trace with hash -2024770087, now seen corresponding path program 11 times [2018-07-25 13:21:03,995 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:04,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:04,084 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 0 proven. 132 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:04,085 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:04,085 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2018-07-25 13:21:04,085 INFO L451 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-07-25 13:21:04,086 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-07-25 13:21:04,086 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:21:04,089 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 14 states. [2018-07-25 13:21:04,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:04,197 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-07-25 13:21:04,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-07-25 13:21:04,198 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 26 [2018-07-25 13:21:04,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:04,198 INFO L225 Difference]: With dead ends: 31 [2018-07-25 13:21:04,199 INFO L226 Difference]: Without dead ends: 29 [2018-07-25 13:21:04,199 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2018-07-25 13:21:04,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2018-07-25 13:21:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2018-07-25 13:21:04,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-07-25 13:21:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-07-25 13:21:04,211 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 26 [2018-07-25 13:21:04,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:04,211 INFO L472 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-07-25 13:21:04,211 INFO L473 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-07-25 13:21:04,212 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-07-25 13:21:04,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2018-07-25 13:21:04,212 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:04,213 INFO L354 BasicCegarLoop]: trace histogram [13, 12, 1, 1, 1] [2018-07-25 13:21:04,213 INFO L415 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:04,214 INFO L82 PathProgramCache]: Analyzing trace with hash -183935531, now seen corresponding path program 12 times [2018-07-25 13:21:04,214 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:04,311 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:04,312 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:04,312 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2018-07-25 13:21:04,312 INFO L451 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-07-25 13:21:04,313 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-07-25 13:21:04,313 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:21:04,313 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 15 states. [2018-07-25 13:21:04,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:04,438 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-07-25 13:21:04,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-07-25 13:21:04,439 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 28 [2018-07-25 13:21:04,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:04,439 INFO L225 Difference]: With dead ends: 33 [2018-07-25 13:21:04,440 INFO L226 Difference]: Without dead ends: 31 [2018-07-25 13:21:04,440 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2018-07-25 13:21:04,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-07-25 13:21:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2018-07-25 13:21:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-07-25 13:21:04,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-07-25 13:21:04,453 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 28 [2018-07-25 13:21:04,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:04,455 INFO L472 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-07-25 13:21:04,455 INFO L473 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-07-25 13:21:04,455 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-07-25 13:21:04,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2018-07-25 13:21:04,457 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:04,457 INFO L354 BasicCegarLoop]: trace histogram [14, 13, 1, 1, 1] [2018-07-25 13:21:04,457 INFO L415 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:04,457 INFO L82 PathProgramCache]: Analyzing trace with hash -668453167, now seen corresponding path program 13 times [2018-07-25 13:21:04,458 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:04,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:04,587 INFO L134 CoverageAnalysis]: Checked inductivity of 182 backedges. 0 proven. 182 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:04,587 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:04,588 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2018-07-25 13:21:04,588 INFO L451 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-07-25 13:21:04,588 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-07-25 13:21:04,589 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:21:04,589 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 16 states. [2018-07-25 13:21:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:04,723 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2018-07-25 13:21:04,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-07-25 13:21:04,723 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 30 [2018-07-25 13:21:04,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:04,724 INFO L225 Difference]: With dead ends: 35 [2018-07-25 13:21:04,724 INFO L226 Difference]: Without dead ends: 33 [2018-07-25 13:21:04,725 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=211, Unknown=0, NotChecked=0, Total=240 [2018-07-25 13:21:04,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-07-25 13:21:04,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-07-25 13:21:04,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-07-25 13:21:04,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2018-07-25 13:21:04,741 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 30 [2018-07-25 13:21:04,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:04,741 INFO L472 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2018-07-25 13:21:04,741 INFO L473 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-07-25 13:21:04,742 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2018-07-25 13:21:04,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-07-25 13:21:04,742 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:04,743 INFO L354 BasicCegarLoop]: trace histogram [15, 14, 1, 1, 1] [2018-07-25 13:21:04,743 INFO L415 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:04,745 INFO L82 PathProgramCache]: Analyzing trace with hash 1861533901, now seen corresponding path program 14 times [2018-07-25 13:21:04,745 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:04,871 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:04,872 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:04,873 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2018-07-25 13:21:04,873 INFO L451 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-07-25 13:21:04,874 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-07-25 13:21:04,874 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:21:04,875 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand 17 states. [2018-07-25 13:21:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:05,030 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2018-07-25 13:21:05,030 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-07-25 13:21:05,032 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 32 [2018-07-25 13:21:05,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:05,033 INFO L225 Difference]: With dead ends: 37 [2018-07-25 13:21:05,033 INFO L226 Difference]: Without dead ends: 35 [2018-07-25 13:21:05,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=241, Unknown=0, NotChecked=0, Total=272 [2018-07-25 13:21:05,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-07-25 13:21:05,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-07-25 13:21:05,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-07-25 13:21:05,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 35 transitions. [2018-07-25 13:21:05,054 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 35 transitions. Word has length 32 [2018-07-25 13:21:05,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:05,054 INFO L472 AbstractCegarLoop]: Abstraction has 35 states and 35 transitions. [2018-07-25 13:21:05,055 INFO L473 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-07-25 13:21:05,055 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2018-07-25 13:21:05,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-07-25 13:21:05,056 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:05,056 INFO L354 BasicCegarLoop]: trace histogram [16, 15, 1, 1, 1] [2018-07-25 13:21:05,056 INFO L415 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:05,058 INFO L82 PathProgramCache]: Analyzing trace with hash -2067350583, now seen corresponding path program 15 times [2018-07-25 13:21:05,058 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:05,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:05,185 INFO L134 CoverageAnalysis]: Checked inductivity of 240 backedges. 0 proven. 240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:05,185 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:05,185 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2018-07-25 13:21:05,186 INFO L451 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-07-25 13:21:05,186 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-07-25 13:21:05,187 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:21:05,187 INFO L87 Difference]: Start difference. First operand 35 states and 35 transitions. Second operand 18 states. [2018-07-25 13:21:05,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:05,353 INFO L93 Difference]: Finished difference Result 39 states and 39 transitions. [2018-07-25 13:21:05,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-07-25 13:21:05,353 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 34 [2018-07-25 13:21:05,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:05,354 INFO L225 Difference]: With dead ends: 39 [2018-07-25 13:21:05,354 INFO L226 Difference]: Without dead ends: 37 [2018-07-25 13:21:05,355 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=273, Unknown=0, NotChecked=0, Total=306 [2018-07-25 13:21:05,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-07-25 13:21:05,371 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2018-07-25 13:21:05,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-07-25 13:21:05,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2018-07-25 13:21:05,372 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 34 [2018-07-25 13:21:05,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:05,372 INFO L472 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2018-07-25 13:21:05,373 INFO L473 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-07-25 13:21:05,373 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2018-07-25 13:21:05,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2018-07-25 13:21:05,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:05,374 INFO L354 BasicCegarLoop]: trace histogram [17, 16, 1, 1, 1] [2018-07-25 13:21:05,375 INFO L415 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:05,375 INFO L82 PathProgramCache]: Analyzing trace with hash 1845880773, now seen corresponding path program 16 times [2018-07-25 13:21:05,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:05,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:05,500 INFO L134 CoverageAnalysis]: Checked inductivity of 272 backedges. 0 proven. 272 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:05,501 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:05,501 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2018-07-25 13:21:05,501 INFO L451 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-07-25 13:21:05,502 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-07-25 13:21:05,502 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:21:05,503 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 19 states. [2018-07-25 13:21:05,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:05,684 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-07-25 13:21:05,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-07-25 13:21:05,684 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 36 [2018-07-25 13:21:05,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:05,686 INFO L225 Difference]: With dead ends: 41 [2018-07-25 13:21:05,686 INFO L226 Difference]: Without dead ends: 39 [2018-07-25 13:21:05,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2018-07-25 13:21:05,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2018-07-25 13:21:05,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2018-07-25 13:21:05,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-07-25 13:21:05,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-07-25 13:21:05,706 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 36 [2018-07-25 13:21:05,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:05,706 INFO L472 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-07-25 13:21:05,707 INFO L473 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-07-25 13:21:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-07-25 13:21:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2018-07-25 13:21:05,708 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:05,709 INFO L354 BasicCegarLoop]: trace histogram [18, 17, 1, 1, 1] [2018-07-25 13:21:05,709 INFO L415 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:05,709 INFO L82 PathProgramCache]: Analyzing trace with hash 69862593, now seen corresponding path program 17 times [2018-07-25 13:21:05,711 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:05,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:05,859 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:05,860 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:05,860 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2018-07-25 13:21:05,860 INFO L451 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-07-25 13:21:05,860 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-07-25 13:21:05,861 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:21:05,861 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 20 states. [2018-07-25 13:21:06,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,047 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-07-25 13:21:06,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-07-25 13:21:06,048 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 38 [2018-07-25 13:21:06,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,048 INFO L225 Difference]: With dead ends: 43 [2018-07-25 13:21:06,048 INFO L226 Difference]: Without dead ends: 41 [2018-07-25 13:21:06,049 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=343, Unknown=0, NotChecked=0, Total=380 [2018-07-25 13:21:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2018-07-25 13:21:06,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2018-07-25 13:21:06,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-07-25 13:21:06,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-07-25 13:21:06,063 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 38 [2018-07-25 13:21:06,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,063 INFO L472 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-07-25 13:21:06,064 INFO L473 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-07-25 13:21:06,064 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-07-25 13:21:06,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-07-25 13:21:06,065 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,065 INFO L354 BasicCegarLoop]: trace histogram [19, 18, 1, 1, 1] [2018-07-25 13:21:06,065 INFO L415 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,065 INFO L82 PathProgramCache]: Analyzing trace with hash -1581591875, now seen corresponding path program 18 times [2018-07-25 13:21:06,066 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,267 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,267 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,267 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2018-07-25 13:21:06,268 INFO L451 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-07-25 13:21:06,268 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-07-25 13:21:06,269 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:21:06,269 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 21 states. [2018-07-25 13:21:06,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,488 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2018-07-25 13:21:06,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-07-25 13:21:06,488 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 40 [2018-07-25 13:21:06,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,489 INFO L225 Difference]: With dead ends: 45 [2018-07-25 13:21:06,489 INFO L226 Difference]: Without dead ends: 43 [2018-07-25 13:21:06,490 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2018-07-25 13:21:06,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2018-07-25 13:21:06,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2018-07-25 13:21:06,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43 states. [2018-07-25 13:21:06,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 43 transitions. [2018-07-25 13:21:06,507 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 43 transitions. Word has length 40 [2018-07-25 13:21:06,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,508 INFO L472 AbstractCegarLoop]: Abstraction has 43 states and 43 transitions. [2018-07-25 13:21:06,508 INFO L473 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-07-25 13:21:06,508 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 43 transitions. [2018-07-25 13:21:06,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-07-25 13:21:06,509 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,510 INFO L354 BasicCegarLoop]: trace histogram [20, 19, 1, 1, 1] [2018-07-25 13:21:06,510 INFO L415 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,510 INFO L82 PathProgramCache]: Analyzing trace with hash 508563897, now seen corresponding path program 19 times [2018-07-25 13:21:06,510 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:06,682 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 380 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:06,682 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:06,683 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2018-07-25 13:21:06,683 INFO L451 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-07-25 13:21:06,683 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-07-25 13:21:06,684 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:21:06,684 INFO L87 Difference]: Start difference. First operand 43 states and 43 transitions. Second operand 22 states. [2018-07-25 13:21:06,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:06,895 INFO L93 Difference]: Finished difference Result 47 states and 47 transitions. [2018-07-25 13:21:06,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-07-25 13:21:06,896 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 42 [2018-07-25 13:21:06,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:06,896 INFO L225 Difference]: With dead ends: 47 [2018-07-25 13:21:06,897 INFO L226 Difference]: Without dead ends: 45 [2018-07-25 13:21:06,897 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=421, Unknown=0, NotChecked=0, Total=462 [2018-07-25 13:21:06,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-07-25 13:21:06,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2018-07-25 13:21:06,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2018-07-25 13:21:06,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2018-07-25 13:21:06,926 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 42 [2018-07-25 13:21:06,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:06,926 INFO L472 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2018-07-25 13:21:06,926 INFO L473 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-07-25 13:21:06,926 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2018-07-25 13:21:06,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-07-25 13:21:06,927 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:06,927 INFO L354 BasicCegarLoop]: trace histogram [21, 20, 1, 1, 1] [2018-07-25 13:21:06,927 INFO L415 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:06,928 INFO L82 PathProgramCache]: Analyzing trace with hash -896433739, now seen corresponding path program 20 times [2018-07-25 13:21:06,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,092 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 420 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,092 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,092 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2018-07-25 13:21:07,093 INFO L451 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-07-25 13:21:07,093 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-07-25 13:21:07,093 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:21:07,094 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 23 states. [2018-07-25 13:21:07,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,344 INFO L93 Difference]: Finished difference Result 49 states and 49 transitions. [2018-07-25 13:21:07,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2018-07-25 13:21:07,345 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 44 [2018-07-25 13:21:07,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,345 INFO L225 Difference]: With dead ends: 49 [2018-07-25 13:21:07,345 INFO L226 Difference]: Without dead ends: 47 [2018-07-25 13:21:07,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=463, Unknown=0, NotChecked=0, Total=506 [2018-07-25 13:21:07,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-07-25 13:21:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2018-07-25 13:21:07,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-07-25 13:21:07,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 47 transitions. [2018-07-25 13:21:07,362 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 47 transitions. Word has length 44 [2018-07-25 13:21:07,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,362 INFO L472 AbstractCegarLoop]: Abstraction has 47 states and 47 transitions. [2018-07-25 13:21:07,362 INFO L473 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-07-25 13:21:07,363 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 47 transitions. [2018-07-25 13:21:07,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-07-25 13:21:07,363 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,363 INFO L354 BasicCegarLoop]: trace histogram [22, 21, 1, 1, 1] [2018-07-25 13:21:07,364 INFO L415 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,364 INFO L82 PathProgramCache]: Analyzing trace with hash 1815536305, now seen corresponding path program 21 times [2018-07-25 13:21:07,364 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,541 INFO L134 CoverageAnalysis]: Checked inductivity of 462 backedges. 0 proven. 462 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [23] total 23 [2018-07-25 13:21:07,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 24 states [2018-07-25 13:21:07,542 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2018-07-25 13:21:07,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:21:07,543 INFO L87 Difference]: Start difference. First operand 47 states and 47 transitions. Second operand 24 states. [2018-07-25 13:21:07,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:07,768 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-07-25 13:21:07,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2018-07-25 13:21:07,769 INFO L78 Accepts]: Start accepts. Automaton has 24 states. Word has length 46 [2018-07-25 13:21:07,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:07,769 INFO L225 Difference]: With dead ends: 51 [2018-07-25 13:21:07,770 INFO L226 Difference]: Without dead ends: 49 [2018-07-25 13:21:07,773 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2018-07-25 13:21:07,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-07-25 13:21:07,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-07-25 13:21:07,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-07-25 13:21:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-07-25 13:21:07,786 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 46 [2018-07-25 13:21:07,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:07,786 INFO L472 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-07-25 13:21:07,787 INFO L473 AbstractCegarLoop]: Interpolant automaton has 24 states. [2018-07-25 13:21:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-07-25 13:21:07,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2018-07-25 13:21:07,787 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:07,787 INFO L354 BasicCegarLoop]: trace histogram [23, 22, 1, 1, 1] [2018-07-25 13:21:07,788 INFO L415 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:07,788 INFO L82 PathProgramCache]: Analyzing trace with hash 973599917, now seen corresponding path program 22 times [2018-07-25 13:21:07,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:07,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:07,950 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:07,951 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:07,951 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2018-07-25 13:21:07,951 INFO L451 AbstractCegarLoop]: Interpolant automaton has 25 states [2018-07-25 13:21:07,952 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2018-07-25 13:21:07,952 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:21:07,953 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 25 states. [2018-07-25 13:21:08,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,192 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-07-25 13:21:08,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2018-07-25 13:21:08,192 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 48 [2018-07-25 13:21:08,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,193 INFO L225 Difference]: With dead ends: 53 [2018-07-25 13:21:08,193 INFO L226 Difference]: Without dead ends: 51 [2018-07-25 13:21:08,193 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=553, Unknown=0, NotChecked=0, Total=600 [2018-07-25 13:21:08,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2018-07-25 13:21:08,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2018-07-25 13:21:08,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-07-25 13:21:08,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-07-25 13:21:08,217 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 48 [2018-07-25 13:21:08,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,221 INFO L472 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-07-25 13:21:08,221 INFO L473 AbstractCegarLoop]: Interpolant automaton has 25 states. [2018-07-25 13:21:08,221 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-07-25 13:21:08,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2018-07-25 13:21:08,221 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,222 INFO L354 BasicCegarLoop]: trace histogram [24, 23, 1, 1, 1] [2018-07-25 13:21:08,222 INFO L415 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,224 INFO L82 PathProgramCache]: Analyzing trace with hash -673417303, now seen corresponding path program 23 times [2018-07-25 13:21:08,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,391 INFO L134 CoverageAnalysis]: Checked inductivity of 552 backedges. 0 proven. 552 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,392 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,392 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2018-07-25 13:21:08,392 INFO L451 AbstractCegarLoop]: Interpolant automaton has 26 states [2018-07-25 13:21:08,393 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2018-07-25 13:21:08,393 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:21:08,393 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 26 states. [2018-07-25 13:21:08,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:08,681 INFO L93 Difference]: Finished difference Result 55 states and 55 transitions. [2018-07-25 13:21:08,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2018-07-25 13:21:08,682 INFO L78 Accepts]: Start accepts. Automaton has 26 states. Word has length 50 [2018-07-25 13:21:08,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:08,682 INFO L225 Difference]: With dead ends: 55 [2018-07-25 13:21:08,683 INFO L226 Difference]: Without dead ends: 53 [2018-07-25 13:21:08,684 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=601, Unknown=0, NotChecked=0, Total=650 [2018-07-25 13:21:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-07-25 13:21:08,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2018-07-25 13:21:08,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-07-25 13:21:08,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2018-07-25 13:21:08,701 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 50 [2018-07-25 13:21:08,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:08,701 INFO L472 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2018-07-25 13:21:08,701 INFO L473 AbstractCegarLoop]: Interpolant automaton has 26 states. [2018-07-25 13:21:08,701 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2018-07-25 13:21:08,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-07-25 13:21:08,702 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:08,702 INFO L354 BasicCegarLoop]: trace histogram [25, 24, 1, 1, 1] [2018-07-25 13:21:08,702 INFO L415 AbstractCegarLoop]: === Iteration 25 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:08,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1385966501, now seen corresponding path program 24 times [2018-07-25 13:21:08,703 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:08,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:08,892 INFO L134 CoverageAnalysis]: Checked inductivity of 600 backedges. 0 proven. 600 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:08,892 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:08,892 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2018-07-25 13:21:08,893 INFO L451 AbstractCegarLoop]: Interpolant automaton has 27 states [2018-07-25 13:21:08,893 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2018-07-25 13:21:08,894 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:21:08,894 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 27 states. [2018-07-25 13:21:09,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,199 INFO L93 Difference]: Finished difference Result 57 states and 57 transitions. [2018-07-25 13:21:09,199 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-07-25 13:21:09,200 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 52 [2018-07-25 13:21:09,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,200 INFO L225 Difference]: With dead ends: 57 [2018-07-25 13:21:09,201 INFO L226 Difference]: Without dead ends: 55 [2018-07-25 13:21:09,201 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=651, Unknown=0, NotChecked=0, Total=702 [2018-07-25 13:21:09,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-07-25 13:21:09,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2018-07-25 13:21:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55 states. [2018-07-25 13:21:09,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 55 transitions. [2018-07-25 13:21:09,226 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 55 transitions. Word has length 52 [2018-07-25 13:21:09,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,226 INFO L472 AbstractCegarLoop]: Abstraction has 55 states and 55 transitions. [2018-07-25 13:21:09,226 INFO L473 AbstractCegarLoop]: Interpolant automaton has 27 states. [2018-07-25 13:21:09,226 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 55 transitions. [2018-07-25 13:21:09,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-07-25 13:21:09,227 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,227 INFO L354 BasicCegarLoop]: trace histogram [26, 25, 1, 1, 1] [2018-07-25 13:21:09,227 INFO L415 AbstractCegarLoop]: === Iteration 26 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,228 INFO L82 PathProgramCache]: Analyzing trace with hash 473878689, now seen corresponding path program 25 times [2018-07-25 13:21:09,228 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,450 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 0 proven. 650 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,450 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,451 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2018-07-25 13:21:09,451 INFO L451 AbstractCegarLoop]: Interpolant automaton has 28 states [2018-07-25 13:21:09,451 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2018-07-25 13:21:09,452 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:21:09,452 INFO L87 Difference]: Start difference. First operand 55 states and 55 transitions. Second operand 28 states. [2018-07-25 13:21:09,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:09,762 INFO L93 Difference]: Finished difference Result 59 states and 59 transitions. [2018-07-25 13:21:09,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2018-07-25 13:21:09,763 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 54 [2018-07-25 13:21:09,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:09,763 INFO L225 Difference]: With dead ends: 59 [2018-07-25 13:21:09,763 INFO L226 Difference]: Without dead ends: 57 [2018-07-25 13:21:09,766 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=703, Unknown=0, NotChecked=0, Total=756 [2018-07-25 13:21:09,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-07-25 13:21:09,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2018-07-25 13:21:09,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57 states. [2018-07-25 13:21:09,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 57 transitions. [2018-07-25 13:21:09,783 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 57 transitions. Word has length 54 [2018-07-25 13:21:09,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:09,784 INFO L472 AbstractCegarLoop]: Abstraction has 57 states and 57 transitions. [2018-07-25 13:21:09,784 INFO L473 AbstractCegarLoop]: Interpolant automaton has 28 states. [2018-07-25 13:21:09,784 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 57 transitions. [2018-07-25 13:21:09,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2018-07-25 13:21:09,785 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:09,785 INFO L354 BasicCegarLoop]: trace histogram [27, 26, 1, 1, 1] [2018-07-25 13:21:09,785 INFO L415 AbstractCegarLoop]: === Iteration 27 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:09,787 INFO L82 PathProgramCache]: Analyzing trace with hash 130819741, now seen corresponding path program 26 times [2018-07-25 13:21:09,788 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:09,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:09,993 INFO L134 CoverageAnalysis]: Checked inductivity of 702 backedges. 0 proven. 702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:09,993 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:09,993 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [28] total 28 [2018-07-25 13:21:09,994 INFO L451 AbstractCegarLoop]: Interpolant automaton has 29 states [2018-07-25 13:21:09,994 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2018-07-25 13:21:09,994 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:21:09,995 INFO L87 Difference]: Start difference. First operand 57 states and 57 transitions. Second operand 29 states. [2018-07-25 13:21:10,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,288 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-07-25 13:21:10,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2018-07-25 13:21:10,289 INFO L78 Accepts]: Start accepts. Automaton has 29 states. Word has length 56 [2018-07-25 13:21:10,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,289 INFO L225 Difference]: With dead ends: 61 [2018-07-25 13:21:10,289 INFO L226 Difference]: Without dead ends: 59 [2018-07-25 13:21:10,290 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=757, Unknown=0, NotChecked=0, Total=812 [2018-07-25 13:21:10,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2018-07-25 13:21:10,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2018-07-25 13:21:10,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-07-25 13:21:10,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-07-25 13:21:10,305 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 56 [2018-07-25 13:21:10,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,306 INFO L472 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-07-25 13:21:10,306 INFO L473 AbstractCegarLoop]: Interpolant automaton has 29 states. [2018-07-25 13:21:10,306 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-07-25 13:21:10,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-07-25 13:21:10,307 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,307 INFO L354 BasicCegarLoop]: trace histogram [28, 27, 1, 1, 1] [2018-07-25 13:21:10,307 INFO L415 AbstractCegarLoop]: === Iteration 28 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1163652505, now seen corresponding path program 27 times [2018-07-25 13:21:10,307 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:10,495 INFO L134 CoverageAnalysis]: Checked inductivity of 756 backedges. 0 proven. 756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:10,496 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:10,496 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [29] total 29 [2018-07-25 13:21:10,496 INFO L451 AbstractCegarLoop]: Interpolant automaton has 30 states [2018-07-25 13:21:10,497 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2018-07-25 13:21:10,497 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:21:10,497 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 30 states. [2018-07-25 13:21:10,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:10,802 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-07-25 13:21:10,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2018-07-25 13:21:10,802 INFO L78 Accepts]: Start accepts. Automaton has 30 states. Word has length 58 [2018-07-25 13:21:10,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:10,803 INFO L225 Difference]: With dead ends: 63 [2018-07-25 13:21:10,803 INFO L226 Difference]: Without dead ends: 61 [2018-07-25 13:21:10,803 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=813, Unknown=0, NotChecked=0, Total=870 [2018-07-25 13:21:10,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2018-07-25 13:21:10,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2018-07-25 13:21:10,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-07-25 13:21:10,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-07-25 13:21:10,819 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 58 [2018-07-25 13:21:10,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:10,819 INFO L472 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-07-25 13:21:10,819 INFO L473 AbstractCegarLoop]: Interpolant automaton has 30 states. [2018-07-25 13:21:10,819 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-07-25 13:21:10,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-07-25 13:21:10,820 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:10,820 INFO L354 BasicCegarLoop]: trace histogram [29, 28, 1, 1, 1] [2018-07-25 13:21:10,820 INFO L415 AbstractCegarLoop]: === Iteration 29 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:10,821 INFO L82 PathProgramCache]: Analyzing trace with hash 1578493333, now seen corresponding path program 28 times [2018-07-25 13:21:10,821 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:10,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,022 INFO L134 CoverageAnalysis]: Checked inductivity of 812 backedges. 0 proven. 812 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,022 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,023 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2018-07-25 13:21:11,023 INFO L451 AbstractCegarLoop]: Interpolant automaton has 31 states [2018-07-25 13:21:11,023 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2018-07-25 13:21:11,024 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:21:11,024 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 31 states. [2018-07-25 13:21:11,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,320 INFO L93 Difference]: Finished difference Result 65 states and 65 transitions. [2018-07-25 13:21:11,320 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2018-07-25 13:21:11,321 INFO L78 Accepts]: Start accepts. Automaton has 31 states. Word has length 60 [2018-07-25 13:21:11,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,321 INFO L225 Difference]: With dead ends: 65 [2018-07-25 13:21:11,321 INFO L226 Difference]: Without dead ends: 63 [2018-07-25 13:21:11,322 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=871, Unknown=0, NotChecked=0, Total=930 [2018-07-25 13:21:11,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2018-07-25 13:21:11,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2018-07-25 13:21:11,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63 states. [2018-07-25 13:21:11,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 63 transitions. [2018-07-25 13:21:11,339 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 63 transitions. Word has length 60 [2018-07-25 13:21:11,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,339 INFO L472 AbstractCegarLoop]: Abstraction has 63 states and 63 transitions. [2018-07-25 13:21:11,339 INFO L473 AbstractCegarLoop]: Interpolant automaton has 31 states. [2018-07-25 13:21:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 63 transitions. [2018-07-25 13:21:11,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-07-25 13:21:11,340 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,340 INFO L354 BasicCegarLoop]: trace histogram [30, 29, 1, 1, 1] [2018-07-25 13:21:11,340 INFO L415 AbstractCegarLoop]: === Iteration 30 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,341 INFO L82 PathProgramCache]: Analyzing trace with hash 808570513, now seen corresponding path program 29 times [2018-07-25 13:21:11,341 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:11,554 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 0 proven. 870 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:11,554 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:11,554 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2018-07-25 13:21:11,555 INFO L451 AbstractCegarLoop]: Interpolant automaton has 32 states [2018-07-25 13:21:11,555 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2018-07-25 13:21:11,556 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:21:11,556 INFO L87 Difference]: Start difference. First operand 63 states and 63 transitions. Second operand 32 states. [2018-07-25 13:21:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:11,893 INFO L93 Difference]: Finished difference Result 67 states and 67 transitions. [2018-07-25 13:21:11,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2018-07-25 13:21:11,893 INFO L78 Accepts]: Start accepts. Automaton has 32 states. Word has length 62 [2018-07-25 13:21:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:11,894 INFO L225 Difference]: With dead ends: 67 [2018-07-25 13:21:11,894 INFO L226 Difference]: Without dead ends: 65 [2018-07-25 13:21:11,895 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=931, Unknown=0, NotChecked=0, Total=992 [2018-07-25 13:21:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-07-25 13:21:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2018-07-25 13:21:11,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-07-25 13:21:11,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 65 transitions. [2018-07-25 13:21:11,913 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 65 transitions. Word has length 62 [2018-07-25 13:21:11,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:11,914 INFO L472 AbstractCegarLoop]: Abstraction has 65 states and 65 transitions. [2018-07-25 13:21:11,914 INFO L473 AbstractCegarLoop]: Interpolant automaton has 32 states. [2018-07-25 13:21:11,914 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 65 transitions. [2018-07-25 13:21:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-07-25 13:21:11,915 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:11,915 INFO L354 BasicCegarLoop]: trace histogram [31, 30, 1, 1, 1] [2018-07-25 13:21:11,915 INFO L415 AbstractCegarLoop]: === Iteration 31 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -352884595, now seen corresponding path program 30 times [2018-07-25 13:21:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:11,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,188 INFO L134 CoverageAnalysis]: Checked inductivity of 930 backedges. 0 proven. 930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,189 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,189 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [32] total 32 [2018-07-25 13:21:12,189 INFO L451 AbstractCegarLoop]: Interpolant automaton has 33 states [2018-07-25 13:21:12,190 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2018-07-25 13:21:12,190 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:21:12,191 INFO L87 Difference]: Start difference. First operand 65 states and 65 transitions. Second operand 33 states. [2018-07-25 13:21:12,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:12,582 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2018-07-25 13:21:12,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2018-07-25 13:21:12,582 INFO L78 Accepts]: Start accepts. Automaton has 33 states. Word has length 64 [2018-07-25 13:21:12,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:12,583 INFO L225 Difference]: With dead ends: 69 [2018-07-25 13:21:12,583 INFO L226 Difference]: Without dead ends: 67 [2018-07-25 13:21:12,584 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=993, Unknown=0, NotChecked=0, Total=1056 [2018-07-25 13:21:12,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-07-25 13:21:12,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2018-07-25 13:21:12,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-07-25 13:21:12,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 67 transitions. [2018-07-25 13:21:12,628 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 67 transitions. Word has length 64 [2018-07-25 13:21:12,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:12,629 INFO L472 AbstractCegarLoop]: Abstraction has 67 states and 67 transitions. [2018-07-25 13:21:12,629 INFO L473 AbstractCegarLoop]: Interpolant automaton has 33 states. [2018-07-25 13:21:12,629 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 67 transitions. [2018-07-25 13:21:12,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2018-07-25 13:21:12,630 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:12,630 INFO L354 BasicCegarLoop]: trace histogram [32, 31, 1, 1, 1] [2018-07-25 13:21:12,630 INFO L415 AbstractCegarLoop]: === Iteration 32 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:12,631 INFO L82 PathProgramCache]: Analyzing trace with hash 180253577, now seen corresponding path program 31 times [2018-07-25 13:21:12,631 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:12,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 992 backedges. 0 proven. 992 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:12,862 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:12,863 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2018-07-25 13:21:12,863 INFO L451 AbstractCegarLoop]: Interpolant automaton has 34 states [2018-07-25 13:21:12,863 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2018-07-25 13:21:12,864 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:21:12,864 INFO L87 Difference]: Start difference. First operand 67 states and 67 transitions. Second operand 34 states. [2018-07-25 13:21:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,212 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-07-25 13:21:13,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2018-07-25 13:21:13,212 INFO L78 Accepts]: Start accepts. Automaton has 34 states. Word has length 66 [2018-07-25 13:21:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,213 INFO L225 Difference]: With dead ends: 71 [2018-07-25 13:21:13,213 INFO L226 Difference]: Without dead ends: 69 [2018-07-25 13:21:13,214 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=1057, Unknown=0, NotChecked=0, Total=1122 [2018-07-25 13:21:13,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2018-07-25 13:21:13,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2018-07-25 13:21:13,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-07-25 13:21:13,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-07-25 13:21:13,232 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 66 [2018-07-25 13:21:13,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,232 INFO L472 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-07-25 13:21:13,232 INFO L473 AbstractCegarLoop]: Interpolant automaton has 34 states. [2018-07-25 13:21:13,232 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-07-25 13:21:13,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2018-07-25 13:21:13,233 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,233 INFO L354 BasicCegarLoop]: trace histogram [33, 32, 1, 1, 1] [2018-07-25 13:21:13,233 INFO L415 AbstractCegarLoop]: === Iteration 33 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,234 INFO L82 PathProgramCache]: Analyzing trace with hash 1424928645, now seen corresponding path program 32 times [2018-07-25 13:21:13,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:13,460 INFO L134 CoverageAnalysis]: Checked inductivity of 1056 backedges. 0 proven. 1056 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:13,460 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:13,461 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2018-07-25 13:21:13,461 INFO L451 AbstractCegarLoop]: Interpolant automaton has 35 states [2018-07-25 13:21:13,461 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2018-07-25 13:21:13,462 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:21:13,462 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 35 states. [2018-07-25 13:21:13,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:13,824 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-07-25 13:21:13,825 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2018-07-25 13:21:13,825 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 68 [2018-07-25 13:21:13,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:13,826 INFO L225 Difference]: With dead ends: 73 [2018-07-25 13:21:13,826 INFO L226 Difference]: Without dead ends: 71 [2018-07-25 13:21:13,827 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=1123, Unknown=0, NotChecked=0, Total=1190 [2018-07-25 13:21:13,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2018-07-25 13:21:13,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2018-07-25 13:21:13,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-07-25 13:21:13,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-07-25 13:21:13,846 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 68 [2018-07-25 13:21:13,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:13,846 INFO L472 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-07-25 13:21:13,846 INFO L473 AbstractCegarLoop]: Interpolant automaton has 35 states. [2018-07-25 13:21:13,846 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-07-25 13:21:13,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2018-07-25 13:21:13,847 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:13,847 INFO L354 BasicCegarLoop]: trace histogram [34, 33, 1, 1, 1] [2018-07-25 13:21:13,847 INFO L415 AbstractCegarLoop]: === Iteration 34 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:13,847 INFO L82 PathProgramCache]: Analyzing trace with hash -738206591, now seen corresponding path program 33 times [2018-07-25 13:21:13,847 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:13,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1122 backedges. 0 proven. 1122 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,073 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,073 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2018-07-25 13:21:14,074 INFO L451 AbstractCegarLoop]: Interpolant automaton has 36 states [2018-07-25 13:21:14,074 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2018-07-25 13:21:14,075 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:21:14,075 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 36 states. [2018-07-25 13:21:14,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:14,443 INFO L93 Difference]: Finished difference Result 75 states and 75 transitions. [2018-07-25 13:21:14,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2018-07-25 13:21:14,443 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 70 [2018-07-25 13:21:14,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:14,444 INFO L225 Difference]: With dead ends: 75 [2018-07-25 13:21:14,444 INFO L226 Difference]: Without dead ends: 73 [2018-07-25 13:21:14,445 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=1191, Unknown=0, NotChecked=0, Total=1260 [2018-07-25 13:21:14,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2018-07-25 13:21:14,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2018-07-25 13:21:14,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2018-07-25 13:21:14,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 73 transitions. [2018-07-25 13:21:14,464 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 73 transitions. Word has length 70 [2018-07-25 13:21:14,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:14,464 INFO L472 AbstractCegarLoop]: Abstraction has 73 states and 73 transitions. [2018-07-25 13:21:14,464 INFO L473 AbstractCegarLoop]: Interpolant automaton has 36 states. [2018-07-25 13:21:14,464 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 73 transitions. [2018-07-25 13:21:14,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-07-25 13:21:14,465 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:14,465 INFO L354 BasicCegarLoop]: trace histogram [35, 34, 1, 1, 1] [2018-07-25 13:21:14,466 INFO L415 AbstractCegarLoop]: === Iteration 35 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:14,466 INFO L82 PathProgramCache]: Analyzing trace with hash -746997123, now seen corresponding path program 34 times [2018-07-25 13:21:14,466 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:14,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1190 backedges. 0 proven. 1190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:14,696 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:14,696 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [36] total 36 [2018-07-25 13:21:14,697 INFO L451 AbstractCegarLoop]: Interpolant automaton has 37 states [2018-07-25 13:21:14,697 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2018-07-25 13:21:14,698 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:21:14,698 INFO L87 Difference]: Start difference. First operand 73 states and 73 transitions. Second operand 37 states. [2018-07-25 13:21:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,084 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2018-07-25 13:21:15,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2018-07-25 13:21:15,084 INFO L78 Accepts]: Start accepts. Automaton has 37 states. Word has length 72 [2018-07-25 13:21:15,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,085 INFO L225 Difference]: With dead ends: 77 [2018-07-25 13:21:15,085 INFO L226 Difference]: Without dead ends: 75 [2018-07-25 13:21:15,086 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=1261, Unknown=0, NotChecked=0, Total=1332 [2018-07-25 13:21:15,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-07-25 13:21:15,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-07-25 13:21:15,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-07-25 13:21:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 75 transitions. [2018-07-25 13:21:15,106 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 75 transitions. Word has length 72 [2018-07-25 13:21:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,106 INFO L472 AbstractCegarLoop]: Abstraction has 75 states and 75 transitions. [2018-07-25 13:21:15,106 INFO L473 AbstractCegarLoop]: Interpolant automaton has 37 states. [2018-07-25 13:21:15,106 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 75 transitions. [2018-07-25 13:21:15,107 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-07-25 13:21:15,107 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,107 INFO L354 BasicCegarLoop]: trace histogram [36, 35, 1, 1, 1] [2018-07-25 13:21:15,107 INFO L415 AbstractCegarLoop]: === Iteration 36 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,108 INFO L82 PathProgramCache]: Analyzing trace with hash -604763783, now seen corresponding path program 35 times [2018-07-25 13:21:15,108 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:15,367 INFO L134 CoverageAnalysis]: Checked inductivity of 1260 backedges. 0 proven. 1260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:15,367 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:15,368 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [37] total 37 [2018-07-25 13:21:15,368 INFO L451 AbstractCegarLoop]: Interpolant automaton has 38 states [2018-07-25 13:21:15,368 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2018-07-25 13:21:15,369 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:21:15,369 INFO L87 Difference]: Start difference. First operand 75 states and 75 transitions. Second operand 38 states. [2018-07-25 13:21:15,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:15,863 INFO L93 Difference]: Finished difference Result 79 states and 79 transitions. [2018-07-25 13:21:15,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2018-07-25 13:21:15,863 INFO L78 Accepts]: Start accepts. Automaton has 38 states. Word has length 74 [2018-07-25 13:21:15,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:15,864 INFO L225 Difference]: With dead ends: 79 [2018-07-25 13:21:15,864 INFO L226 Difference]: Without dead ends: 77 [2018-07-25 13:21:15,866 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=1333, Unknown=0, NotChecked=0, Total=1406 [2018-07-25 13:21:15,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-07-25 13:21:15,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2018-07-25 13:21:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2018-07-25 13:21:15,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2018-07-25 13:21:15,891 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 74 [2018-07-25 13:21:15,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:15,891 INFO L472 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2018-07-25 13:21:15,891 INFO L473 AbstractCegarLoop]: Interpolant automaton has 38 states. [2018-07-25 13:21:15,891 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2018-07-25 13:21:15,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-07-25 13:21:15,892 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:15,892 INFO L354 BasicCegarLoop]: trace histogram [37, 36, 1, 1, 1] [2018-07-25 13:21:15,892 INFO L415 AbstractCegarLoop]: === Iteration 37 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:15,893 INFO L82 PathProgramCache]: Analyzing trace with hash -1357477515, now seen corresponding path program 36 times [2018-07-25 13:21:15,893 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,165 INFO L134 CoverageAnalysis]: Checked inductivity of 1332 backedges. 0 proven. 1332 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,166 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,166 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [38] total 38 [2018-07-25 13:21:16,166 INFO L451 AbstractCegarLoop]: Interpolant automaton has 39 states [2018-07-25 13:21:16,167 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2018-07-25 13:21:16,170 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:21:16,171 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 39 states. [2018-07-25 13:21:16,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:16,564 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-07-25 13:21:16,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2018-07-25 13:21:16,565 INFO L78 Accepts]: Start accepts. Automaton has 39 states. Word has length 76 [2018-07-25 13:21:16,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:16,565 INFO L225 Difference]: With dead ends: 81 [2018-07-25 13:21:16,565 INFO L226 Difference]: Without dead ends: 79 [2018-07-25 13:21:16,566 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=1407, Unknown=0, NotChecked=0, Total=1482 [2018-07-25 13:21:16,567 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-07-25 13:21:16,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2018-07-25 13:21:16,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-07-25 13:21:16,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-07-25 13:21:16,587 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 76 [2018-07-25 13:21:16,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:16,588 INFO L472 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-07-25 13:21:16,588 INFO L473 AbstractCegarLoop]: Interpolant automaton has 39 states. [2018-07-25 13:21:16,588 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-07-25 13:21:16,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2018-07-25 13:21:16,589 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:16,589 INFO L354 BasicCegarLoop]: trace histogram [38, 37, 1, 1, 1] [2018-07-25 13:21:16,591 INFO L415 AbstractCegarLoop]: === Iteration 38 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:16,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1134099057, now seen corresponding path program 37 times [2018-07-25 13:21:16,591 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:16,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:16,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1406 backedges. 0 proven. 1406 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:16,837 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:16,837 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [39] total 39 [2018-07-25 13:21:16,838 INFO L451 AbstractCegarLoop]: Interpolant automaton has 40 states [2018-07-25 13:21:16,838 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2018-07-25 13:21:16,839 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:21:16,839 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 40 states. [2018-07-25 13:21:17,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:17,269 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-07-25 13:21:17,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2018-07-25 13:21:17,269 INFO L78 Accepts]: Start accepts. Automaton has 40 states. Word has length 78 [2018-07-25 13:21:17,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:17,270 INFO L225 Difference]: With dead ends: 83 [2018-07-25 13:21:17,270 INFO L226 Difference]: Without dead ends: 81 [2018-07-25 13:21:17,271 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=1483, Unknown=0, NotChecked=0, Total=1560 [2018-07-25 13:21:17,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2018-07-25 13:21:17,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2018-07-25 13:21:17,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-07-25 13:21:17,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-07-25 13:21:17,297 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 78 [2018-07-25 13:21:17,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:17,297 INFO L472 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-07-25 13:21:17,297 INFO L473 AbstractCegarLoop]: Interpolant automaton has 40 states. [2018-07-25 13:21:17,297 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-07-25 13:21:17,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2018-07-25 13:21:17,298 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:17,298 INFO L354 BasicCegarLoop]: trace histogram [39, 38, 1, 1, 1] [2018-07-25 13:21:17,299 INFO L415 AbstractCegarLoop]: === Iteration 39 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:17,299 INFO L82 PathProgramCache]: Analyzing trace with hash -1052566419, now seen corresponding path program 38 times [2018-07-25 13:21:17,299 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:17,542 INFO L134 CoverageAnalysis]: Checked inductivity of 1482 backedges. 0 proven. 1482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:17,542 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:17,542 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [40] total 40 [2018-07-25 13:21:17,542 INFO L451 AbstractCegarLoop]: Interpolant automaton has 41 states [2018-07-25 13:21:17,543 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2018-07-25 13:21:17,543 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:21:17,544 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 41 states. [2018-07-25 13:21:17,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:17,991 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2018-07-25 13:21:17,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2018-07-25 13:21:17,991 INFO L78 Accepts]: Start accepts. Automaton has 41 states. Word has length 80 [2018-07-25 13:21:17,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:17,992 INFO L225 Difference]: With dead ends: 85 [2018-07-25 13:21:17,992 INFO L226 Difference]: Without dead ends: 83 [2018-07-25 13:21:17,993 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=1561, Unknown=0, NotChecked=0, Total=1640 [2018-07-25 13:21:17,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-07-25 13:21:18,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2018-07-25 13:21:18,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2018-07-25 13:21:18,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 83 transitions. [2018-07-25 13:21:18,013 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 83 transitions. Word has length 80 [2018-07-25 13:21:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,014 INFO L472 AbstractCegarLoop]: Abstraction has 83 states and 83 transitions. [2018-07-25 13:21:18,014 INFO L473 AbstractCegarLoop]: Interpolant automaton has 41 states. [2018-07-25 13:21:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 83 transitions. [2018-07-25 13:21:18,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-07-25 13:21:18,015 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,015 INFO L354 BasicCegarLoop]: trace histogram [40, 39, 1, 1, 1] [2018-07-25 13:21:18,015 INFO L415 AbstractCegarLoop]: === Iteration 40 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,015 INFO L82 PathProgramCache]: Analyzing trace with hash 2095886185, now seen corresponding path program 39 times [2018-07-25 13:21:18,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:18,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:18,259 INFO L134 CoverageAnalysis]: Checked inductivity of 1560 backedges. 0 proven. 1560 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,259 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,259 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [41] total 41 [2018-07-25 13:21:18,259 INFO L451 AbstractCegarLoop]: Interpolant automaton has 42 states [2018-07-25 13:21:18,260 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2018-07-25 13:21:18,261 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:21:18,261 INFO L87 Difference]: Start difference. First operand 83 states and 83 transitions. Second operand 42 states. [2018-07-25 13:21:18,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:18,720 INFO L93 Difference]: Finished difference Result 87 states and 87 transitions. [2018-07-25 13:21:18,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2018-07-25 13:21:18,721 INFO L78 Accepts]: Start accepts. Automaton has 42 states. Word has length 82 [2018-07-25 13:21:18,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:18,721 INFO L225 Difference]: With dead ends: 87 [2018-07-25 13:21:18,721 INFO L226 Difference]: Without dead ends: 85 [2018-07-25 13:21:18,723 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=1641, Unknown=0, NotChecked=0, Total=1722 [2018-07-25 13:21:18,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-07-25 13:21:18,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2018-07-25 13:21:18,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2018-07-25 13:21:18,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2018-07-25 13:21:18,745 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 82 [2018-07-25 13:21:18,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:18,745 INFO L472 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2018-07-25 13:21:18,745 INFO L473 AbstractCegarLoop]: Interpolant automaton has 42 states. [2018-07-25 13:21:18,745 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2018-07-25 13:21:18,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-07-25 13:21:18,746 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:18,746 INFO L354 BasicCegarLoop]: trace histogram [41, 40, 1, 1, 1] [2018-07-25 13:21:18,746 INFO L415 AbstractCegarLoop]: === Iteration 41 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:18,747 INFO L82 PathProgramCache]: Analyzing trace with hash -193105051, now seen corresponding path program 40 times [2018-07-25 13:21:18,747 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:18,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:18,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1640 backedges. 0 proven. 1640 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:18,988 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:18,988 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2018-07-25 13:21:18,989 INFO L451 AbstractCegarLoop]: Interpolant automaton has 43 states [2018-07-25 13:21:18,989 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2018-07-25 13:21:18,990 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:21:18,990 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 43 states. [2018-07-25 13:21:19,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:19,421 INFO L93 Difference]: Finished difference Result 89 states and 89 transitions. [2018-07-25 13:21:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2018-07-25 13:21:19,421 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 84 [2018-07-25 13:21:19,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:19,422 INFO L225 Difference]: With dead ends: 89 [2018-07-25 13:21:19,423 INFO L226 Difference]: Without dead ends: 87 [2018-07-25 13:21:19,424 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=1723, Unknown=0, NotChecked=0, Total=1806 [2018-07-25 13:21:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-07-25 13:21:19,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2018-07-25 13:21:19,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 87 states. [2018-07-25 13:21:19,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 87 transitions. [2018-07-25 13:21:19,447 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 87 transitions. Word has length 84 [2018-07-25 13:21:19,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:19,447 INFO L472 AbstractCegarLoop]: Abstraction has 87 states and 87 transitions. [2018-07-25 13:21:19,447 INFO L473 AbstractCegarLoop]: Interpolant automaton has 43 states. [2018-07-25 13:21:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 87 transitions. [2018-07-25 13:21:19,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2018-07-25 13:21:19,448 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:19,448 INFO L354 BasicCegarLoop]: trace histogram [42, 41, 1, 1, 1] [2018-07-25 13:21:19,449 INFO L415 AbstractCegarLoop]: === Iteration 42 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:19,449 INFO L82 PathProgramCache]: Analyzing trace with hash -890427295, now seen corresponding path program 41 times [2018-07-25 13:21:19,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:19,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:19,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1722 backedges. 0 proven. 1722 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:19,728 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:19,728 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2018-07-25 13:21:19,729 INFO L451 AbstractCegarLoop]: Interpolant automaton has 44 states [2018-07-25 13:21:19,729 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2018-07-25 13:21:19,730 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:21:19,730 INFO L87 Difference]: Start difference. First operand 87 states and 87 transitions. Second operand 44 states. [2018-07-25 13:21:20,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,137 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-07-25 13:21:20,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2018-07-25 13:21:20,137 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 86 [2018-07-25 13:21:20,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,138 INFO L225 Difference]: With dead ends: 91 [2018-07-25 13:21:20,138 INFO L226 Difference]: Without dead ends: 89 [2018-07-25 13:21:20,139 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=85, Invalid=1807, Unknown=0, NotChecked=0, Total=1892 [2018-07-25 13:21:20,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2018-07-25 13:21:20,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2018-07-25 13:21:20,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-07-25 13:21:20,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-07-25 13:21:20,161 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 86 [2018-07-25 13:21:20,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,162 INFO L472 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-07-25 13:21:20,162 INFO L473 AbstractCegarLoop]: Interpolant automaton has 44 states. [2018-07-25 13:21:20,162 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-07-25 13:21:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-07-25 13:21:20,163 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,163 INFO L354 BasicCegarLoop]: trace histogram [43, 42, 1, 1, 1] [2018-07-25 13:21:20,163 INFO L415 AbstractCegarLoop]: === Iteration 43 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,163 INFO L82 PathProgramCache]: Analyzing trace with hash -1002205603, now seen corresponding path program 42 times [2018-07-25 13:21:20,163 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:20,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:20,442 INFO L134 CoverageAnalysis]: Checked inductivity of 1806 backedges. 0 proven. 1806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:20,442 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:20,442 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2018-07-25 13:21:20,443 INFO L451 AbstractCegarLoop]: Interpolant automaton has 45 states [2018-07-25 13:21:20,443 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2018-07-25 13:21:20,444 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:21:20,445 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 45 states. [2018-07-25 13:21:20,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:20,938 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-07-25 13:21:20,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2018-07-25 13:21:20,939 INFO L78 Accepts]: Start accepts. Automaton has 45 states. Word has length 88 [2018-07-25 13:21:20,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:20,940 INFO L225 Difference]: With dead ends: 93 [2018-07-25 13:21:20,940 INFO L226 Difference]: Without dead ends: 91 [2018-07-25 13:21:20,941 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=1893, Unknown=0, NotChecked=0, Total=1980 [2018-07-25 13:21:20,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2018-07-25 13:21:20,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2018-07-25 13:21:20,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-07-25 13:21:20,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-07-25 13:21:20,970 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 88 [2018-07-25 13:21:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:20,971 INFO L472 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-07-25 13:21:20,971 INFO L473 AbstractCegarLoop]: Interpolant automaton has 45 states. [2018-07-25 13:21:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-07-25 13:21:20,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2018-07-25 13:21:20,972 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:20,972 INFO L354 BasicCegarLoop]: trace histogram [44, 43, 1, 1, 1] [2018-07-25 13:21:20,972 INFO L415 AbstractCegarLoop]: === Iteration 44 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:20,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1046977191, now seen corresponding path program 43 times [2018-07-25 13:21:20,973 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 1892 backedges. 0 proven. 1892 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:21,303 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:21,304 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [45] total 45 [2018-07-25 13:21:21,304 INFO L451 AbstractCegarLoop]: Interpolant automaton has 46 states [2018-07-25 13:21:21,304 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2018-07-25 13:21:21,305 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:21:21,305 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 46 states. [2018-07-25 13:21:21,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:21,864 INFO L93 Difference]: Finished difference Result 95 states and 95 transitions. [2018-07-25 13:21:21,864 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2018-07-25 13:21:21,864 INFO L78 Accepts]: Start accepts. Automaton has 46 states. Word has length 90 [2018-07-25 13:21:21,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:21,865 INFO L225 Difference]: With dead ends: 95 [2018-07-25 13:21:21,865 INFO L226 Difference]: Without dead ends: 93 [2018-07-25 13:21:21,866 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=1981, Unknown=0, NotChecked=0, Total=2070 [2018-07-25 13:21:21,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2018-07-25 13:21:21,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2018-07-25 13:21:21,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2018-07-25 13:21:21,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 93 transitions. [2018-07-25 13:21:21,888 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 93 transitions. Word has length 90 [2018-07-25 13:21:21,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:21,889 INFO L472 AbstractCegarLoop]: Abstraction has 93 states and 93 transitions. [2018-07-25 13:21:21,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 46 states. [2018-07-25 13:21:21,889 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 93 transitions. [2018-07-25 13:21:21,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-07-25 13:21:21,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:21,890 INFO L354 BasicCegarLoop]: trace histogram [45, 44, 1, 1, 1] [2018-07-25 13:21:21,890 INFO L415 AbstractCegarLoop]: === Iteration 45 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:21,890 INFO L82 PathProgramCache]: Analyzing trace with hash -1122800299, now seen corresponding path program 44 times [2018-07-25 13:21:21,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:21,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:22,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1980 backedges. 0 proven. 1980 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:22,182 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:22,182 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [46] total 46 [2018-07-25 13:21:22,182 INFO L451 AbstractCegarLoop]: Interpolant automaton has 47 states [2018-07-25 13:21:22,183 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 47 interpolants. [2018-07-25 13:21:22,183 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:21:22,183 INFO L87 Difference]: Start difference. First operand 93 states and 93 transitions. Second operand 47 states. [2018-07-25 13:21:22,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:22,601 INFO L93 Difference]: Finished difference Result 97 states and 97 transitions. [2018-07-25 13:21:22,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2018-07-25 13:21:22,602 INFO L78 Accepts]: Start accepts. Automaton has 47 states. Word has length 92 [2018-07-25 13:21:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:22,603 INFO L225 Difference]: With dead ends: 97 [2018-07-25 13:21:22,603 INFO L226 Difference]: Without dead ends: 95 [2018-07-25 13:21:22,603 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=2071, Unknown=0, NotChecked=0, Total=2162 [2018-07-25 13:21:22,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-07-25 13:21:22,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2018-07-25 13:21:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95 states. [2018-07-25 13:21:22,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 95 transitions. [2018-07-25 13:21:22,626 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 95 transitions. Word has length 92 [2018-07-25 13:21:22,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:22,627 INFO L472 AbstractCegarLoop]: Abstraction has 95 states and 95 transitions. [2018-07-25 13:21:22,627 INFO L473 AbstractCegarLoop]: Interpolant automaton has 47 states. [2018-07-25 13:21:22,627 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 95 transitions. [2018-07-25 13:21:22,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-07-25 13:21:22,628 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:22,628 INFO L354 BasicCegarLoop]: trace histogram [46, 45, 1, 1, 1] [2018-07-25 13:21:22,629 INFO L415 AbstractCegarLoop]: === Iteration 46 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:22,629 INFO L82 PathProgramCache]: Analyzing trace with hash -974363055, now seen corresponding path program 45 times [2018-07-25 13:21:22,629 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:22,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:22,941 INFO L134 CoverageAnalysis]: Checked inductivity of 2070 backedges. 0 proven. 2070 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:22,942 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:22,942 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [47] total 47 [2018-07-25 13:21:22,942 INFO L451 AbstractCegarLoop]: Interpolant automaton has 48 states [2018-07-25 13:21:22,942 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2018-07-25 13:21:22,943 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:21:22,943 INFO L87 Difference]: Start difference. First operand 95 states and 95 transitions. Second operand 48 states. [2018-07-25 13:21:23,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:23,504 INFO L93 Difference]: Finished difference Result 99 states and 99 transitions. [2018-07-25 13:21:23,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2018-07-25 13:21:23,505 INFO L78 Accepts]: Start accepts. Automaton has 48 states. Word has length 94 [2018-07-25 13:21:23,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:23,506 INFO L225 Difference]: With dead ends: 99 [2018-07-25 13:21:23,506 INFO L226 Difference]: Without dead ends: 97 [2018-07-25 13:21:23,507 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=2163, Unknown=0, NotChecked=0, Total=2256 [2018-07-25 13:21:23,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-07-25 13:21:23,530 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2018-07-25 13:21:23,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2018-07-25 13:21:23,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 97 transitions. [2018-07-25 13:21:23,531 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 97 transitions. Word has length 94 [2018-07-25 13:21:23,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:23,531 INFO L472 AbstractCegarLoop]: Abstraction has 97 states and 97 transitions. [2018-07-25 13:21:23,531 INFO L473 AbstractCegarLoop]: Interpolant automaton has 48 states. [2018-07-25 13:21:23,532 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 97 transitions. [2018-07-25 13:21:23,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2018-07-25 13:21:23,532 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:23,533 INFO L354 BasicCegarLoop]: trace histogram [47, 46, 1, 1, 1] [2018-07-25 13:21:23,533 INFO L415 AbstractCegarLoop]: === Iteration 47 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:23,533 INFO L82 PathProgramCache]: Analyzing trace with hash -60092339, now seen corresponding path program 46 times [2018-07-25 13:21:23,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:23,824 INFO L134 CoverageAnalysis]: Checked inductivity of 2162 backedges. 0 proven. 2162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:23,825 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:23,825 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [48] total 48 [2018-07-25 13:21:23,825 INFO L451 AbstractCegarLoop]: Interpolant automaton has 49 states [2018-07-25 13:21:23,826 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2018-07-25 13:21:23,826 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:21:23,826 INFO L87 Difference]: Start difference. First operand 97 states and 97 transitions. Second operand 49 states. [2018-07-25 13:21:24,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:24,404 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-07-25 13:21:24,404 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2018-07-25 13:21:24,405 INFO L78 Accepts]: Start accepts. Automaton has 49 states. Word has length 96 [2018-07-25 13:21:24,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:24,406 INFO L225 Difference]: With dead ends: 101 [2018-07-25 13:21:24,406 INFO L226 Difference]: Without dead ends: 99 [2018-07-25 13:21:24,406 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=95, Invalid=2257, Unknown=0, NotChecked=0, Total=2352 [2018-07-25 13:21:24,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2018-07-25 13:21:24,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2018-07-25 13:21:24,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-07-25 13:21:24,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-07-25 13:21:24,433 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 96 [2018-07-25 13:21:24,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:24,433 INFO L472 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-07-25 13:21:24,433 INFO L473 AbstractCegarLoop]: Interpolant automaton has 49 states. [2018-07-25 13:21:24,434 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-07-25 13:21:24,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2018-07-25 13:21:24,435 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:24,435 INFO L354 BasicCegarLoop]: trace histogram [48, 47, 1, 1, 1] [2018-07-25 13:21:24,435 INFO L415 AbstractCegarLoop]: === Iteration 48 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:24,435 INFO L82 PathProgramCache]: Analyzing trace with hash -1914229943, now seen corresponding path program 47 times [2018-07-25 13:21:24,436 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:24,788 INFO L134 CoverageAnalysis]: Checked inductivity of 2256 backedges. 0 proven. 2256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:24,789 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:24,789 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2018-07-25 13:21:24,789 INFO L451 AbstractCegarLoop]: Interpolant automaton has 50 states [2018-07-25 13:21:24,790 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2018-07-25 13:21:24,790 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:21:24,790 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 50 states. [2018-07-25 13:21:25,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:25,195 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-07-25 13:21:25,195 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2018-07-25 13:21:25,195 INFO L78 Accepts]: Start accepts. Automaton has 50 states. Word has length 98 [2018-07-25 13:21:25,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:25,196 INFO L225 Difference]: With dead ends: 103 [2018-07-25 13:21:25,196 INFO L226 Difference]: Without dead ends: 101 [2018-07-25 13:21:25,197 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=97, Invalid=2353, Unknown=0, NotChecked=0, Total=2450 [2018-07-25 13:21:25,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2018-07-25 13:21:25,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2018-07-25 13:21:25,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-07-25 13:21:25,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-07-25 13:21:25,222 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 98 [2018-07-25 13:21:25,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:25,222 INFO L472 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-07-25 13:21:25,222 INFO L473 AbstractCegarLoop]: Interpolant automaton has 50 states. [2018-07-25 13:21:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-07-25 13:21:25,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2018-07-25 13:21:25,224 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:25,224 INFO L354 BasicCegarLoop]: trace histogram [49, 48, 1, 1, 1] [2018-07-25 13:21:25,224 INFO L415 AbstractCegarLoop]: === Iteration 49 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:25,224 INFO L82 PathProgramCache]: Analyzing trace with hash -1329039547, now seen corresponding path program 48 times [2018-07-25 13:21:25,224 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:25,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:25,509 INFO L134 CoverageAnalysis]: Checked inductivity of 2352 backedges. 0 proven. 2352 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:25,510 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:25,510 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2018-07-25 13:21:25,510 INFO L451 AbstractCegarLoop]: Interpolant automaton has 51 states [2018-07-25 13:21:25,510 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2018-07-25 13:21:25,511 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:21:25,511 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 51 states. [2018-07-25 13:21:25,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:25,960 INFO L93 Difference]: Finished difference Result 105 states and 105 transitions. [2018-07-25 13:21:25,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2018-07-25 13:21:25,961 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 100 [2018-07-25 13:21:25,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:25,962 INFO L225 Difference]: With dead ends: 105 [2018-07-25 13:21:25,962 INFO L226 Difference]: Without dead ends: 103 [2018-07-25 13:21:25,962 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=2451, Unknown=0, NotChecked=0, Total=2550 [2018-07-25 13:21:25,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2018-07-25 13:21:25,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2018-07-25 13:21:25,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 103 states. [2018-07-25 13:21:25,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 103 transitions. [2018-07-25 13:21:25,986 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 103 transitions. Word has length 100 [2018-07-25 13:21:25,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:25,987 INFO L472 AbstractCegarLoop]: Abstraction has 103 states and 103 transitions. [2018-07-25 13:21:25,987 INFO L473 AbstractCegarLoop]: Interpolant automaton has 51 states. [2018-07-25 13:21:25,987 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 103 transitions. [2018-07-25 13:21:25,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-07-25 13:21:25,987 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:25,988 INFO L354 BasicCegarLoop]: trace histogram [50, 49, 1, 1, 1] [2018-07-25 13:21:25,988 INFO L415 AbstractCegarLoop]: === Iteration 50 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:25,988 INFO L82 PathProgramCache]: Analyzing trace with hash -1601784767, now seen corresponding path program 49 times [2018-07-25 13:21:25,988 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:26,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:26,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2450 backedges. 0 proven. 2450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:26,325 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:26,326 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2018-07-25 13:21:26,326 INFO L451 AbstractCegarLoop]: Interpolant automaton has 52 states [2018-07-25 13:21:26,326 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2018-07-25 13:21:26,327 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:21:26,327 INFO L87 Difference]: Start difference. First operand 103 states and 103 transitions. Second operand 52 states. [2018-07-25 13:21:26,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:26,790 INFO L93 Difference]: Finished difference Result 107 states and 107 transitions. [2018-07-25 13:21:26,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2018-07-25 13:21:26,790 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 102 [2018-07-25 13:21:26,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:26,791 INFO L225 Difference]: With dead ends: 107 [2018-07-25 13:21:26,791 INFO L226 Difference]: Without dead ends: 105 [2018-07-25 13:21:26,792 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=101, Invalid=2551, Unknown=0, NotChecked=0, Total=2652 [2018-07-25 13:21:26,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-07-25 13:21:26,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2018-07-25 13:21:26,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 105 states. [2018-07-25 13:21:26,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 105 transitions. [2018-07-25 13:21:26,814 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 105 transitions. Word has length 102 [2018-07-25 13:21:26,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:26,814 INFO L472 AbstractCegarLoop]: Abstraction has 105 states and 105 transitions. [2018-07-25 13:21:26,814 INFO L473 AbstractCegarLoop]: Interpolant automaton has 52 states. [2018-07-25 13:21:26,814 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 105 transitions. [2018-07-25 13:21:26,815 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-07-25 13:21:26,815 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:26,815 INFO L354 BasicCegarLoop]: trace histogram [51, 50, 1, 1, 1] [2018-07-25 13:21:26,815 INFO L415 AbstractCegarLoop]: === Iteration 51 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:26,816 INFO L82 PathProgramCache]: Analyzing trace with hash -1716936131, now seen corresponding path program 50 times [2018-07-25 13:21:26,816 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:26,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:27,207 INFO L134 CoverageAnalysis]: Checked inductivity of 2550 backedges. 0 proven. 2550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:27,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:27,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [52] total 52 [2018-07-25 13:21:27,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 53 states [2018-07-25 13:21:27,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2018-07-25 13:21:27,208 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:21:27,208 INFO L87 Difference]: Start difference. First operand 105 states and 105 transitions. Second operand 53 states. [2018-07-25 13:21:27,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:27,609 INFO L93 Difference]: Finished difference Result 109 states and 109 transitions. [2018-07-25 13:21:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2018-07-25 13:21:27,609 INFO L78 Accepts]: Start accepts. Automaton has 53 states. Word has length 104 [2018-07-25 13:21:27,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:27,610 INFO L225 Difference]: With dead ends: 109 [2018-07-25 13:21:27,610 INFO L226 Difference]: Without dead ends: 107 [2018-07-25 13:21:27,610 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=2653, Unknown=0, NotChecked=0, Total=2756 [2018-07-25 13:21:27,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-07-25 13:21:27,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2018-07-25 13:21:27,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107 states. [2018-07-25 13:21:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 107 transitions. [2018-07-25 13:21:27,633 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 107 transitions. Word has length 104 [2018-07-25 13:21:27,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:27,634 INFO L472 AbstractCegarLoop]: Abstraction has 107 states and 107 transitions. [2018-07-25 13:21:27,634 INFO L473 AbstractCegarLoop]: Interpolant automaton has 53 states. [2018-07-25 13:21:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 107 transitions. [2018-07-25 13:21:27,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2018-07-25 13:21:27,635 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:27,635 INFO L354 BasicCegarLoop]: trace histogram [52, 51, 1, 1, 1] [2018-07-25 13:21:27,635 INFO L415 AbstractCegarLoop]: === Iteration 52 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:27,635 INFO L82 PathProgramCache]: Analyzing trace with hash -708247239, now seen corresponding path program 51 times [2018-07-25 13:21:27,635 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:27,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:27,972 INFO L134 CoverageAnalysis]: Checked inductivity of 2652 backedges. 0 proven. 2652 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:27,972 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:27,973 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [53] total 53 [2018-07-25 13:21:27,973 INFO L451 AbstractCegarLoop]: Interpolant automaton has 54 states [2018-07-25 13:21:27,973 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2018-07-25 13:21:27,973 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:21:27,974 INFO L87 Difference]: Start difference. First operand 107 states and 107 transitions. Second operand 54 states. [2018-07-25 13:21:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:28,405 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-07-25 13:21:28,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 54 states. [2018-07-25 13:21:28,406 INFO L78 Accepts]: Start accepts. Automaton has 54 states. Word has length 106 [2018-07-25 13:21:28,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:28,407 INFO L225 Difference]: With dead ends: 111 [2018-07-25 13:21:28,407 INFO L226 Difference]: Without dead ends: 109 [2018-07-25 13:21:28,408 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=2757, Unknown=0, NotChecked=0, Total=2862 [2018-07-25 13:21:28,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2018-07-25 13:21:28,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2018-07-25 13:21:28,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-07-25 13:21:28,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-07-25 13:21:28,432 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 106 [2018-07-25 13:21:28,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:28,432 INFO L472 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-07-25 13:21:28,432 INFO L473 AbstractCegarLoop]: Interpolant automaton has 54 states. [2018-07-25 13:21:28,432 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-07-25 13:21:28,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2018-07-25 13:21:28,433 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:28,433 INFO L354 BasicCegarLoop]: trace histogram [53, 52, 1, 1, 1] [2018-07-25 13:21:28,433 INFO L415 AbstractCegarLoop]: === Iteration 53 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:28,433 INFO L82 PathProgramCache]: Analyzing trace with hash -2020830923, now seen corresponding path program 52 times [2018-07-25 13:21:28,433 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:28,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:28,761 INFO L134 CoverageAnalysis]: Checked inductivity of 2756 backedges. 0 proven. 2756 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:28,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:28,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [54] total 54 [2018-07-25 13:21:28,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 55 states [2018-07-25 13:21:28,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2018-07-25 13:21:28,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:21:28,762 INFO L87 Difference]: Start difference. First operand 109 states and 109 transitions. Second operand 55 states. [2018-07-25 13:21:29,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:29,231 INFO L93 Difference]: Finished difference Result 113 states and 113 transitions. [2018-07-25 13:21:29,231 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2018-07-25 13:21:29,232 INFO L78 Accepts]: Start accepts. Automaton has 55 states. Word has length 108 [2018-07-25 13:21:29,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:29,232 INFO L225 Difference]: With dead ends: 113 [2018-07-25 13:21:29,233 INFO L226 Difference]: Without dead ends: 111 [2018-07-25 13:21:29,233 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=107, Invalid=2863, Unknown=0, NotChecked=0, Total=2970 [2018-07-25 13:21:29,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2018-07-25 13:21:29,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2018-07-25 13:21:29,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2018-07-25 13:21:29,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 111 transitions. [2018-07-25 13:21:29,264 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 111 transitions. Word has length 108 [2018-07-25 13:21:29,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:29,264 INFO L472 AbstractCegarLoop]: Abstraction has 111 states and 111 transitions. [2018-07-25 13:21:29,264 INFO L473 AbstractCegarLoop]: Interpolant automaton has 55 states. [2018-07-25 13:21:29,264 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 111 transitions. [2018-07-25 13:21:29,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2018-07-25 13:21:29,265 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:29,265 INFO L354 BasicCegarLoop]: trace histogram [54, 53, 1, 1, 1] [2018-07-25 13:21:29,265 INFO L415 AbstractCegarLoop]: === Iteration 54 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:29,266 INFO L82 PathProgramCache]: Analyzing trace with hash -693366223, now seen corresponding path program 53 times [2018-07-25 13:21:29,266 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:29,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:29,634 INFO L134 CoverageAnalysis]: Checked inductivity of 2862 backedges. 0 proven. 2862 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:29,634 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:29,634 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [55] total 55 [2018-07-25 13:21:29,635 INFO L451 AbstractCegarLoop]: Interpolant automaton has 56 states [2018-07-25 13:21:29,635 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2018-07-25 13:21:29,635 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:21:29,635 INFO L87 Difference]: Start difference. First operand 111 states and 111 transitions. Second operand 56 states. [2018-07-25 13:21:30,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:30,150 INFO L93 Difference]: Finished difference Result 115 states and 115 transitions. [2018-07-25 13:21:30,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2018-07-25 13:21:30,150 INFO L78 Accepts]: Start accepts. Automaton has 56 states. Word has length 110 [2018-07-25 13:21:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:30,151 INFO L225 Difference]: With dead ends: 115 [2018-07-25 13:21:30,151 INFO L226 Difference]: Without dead ends: 113 [2018-07-25 13:21:30,151 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=109, Invalid=2971, Unknown=0, NotChecked=0, Total=3080 [2018-07-25 13:21:30,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2018-07-25 13:21:30,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2018-07-25 13:21:30,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2018-07-25 13:21:30,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 113 transitions. [2018-07-25 13:21:30,176 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 113 transitions. Word has length 110 [2018-07-25 13:21:30,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:30,177 INFO L472 AbstractCegarLoop]: Abstraction has 113 states and 113 transitions. [2018-07-25 13:21:30,177 INFO L473 AbstractCegarLoop]: Interpolant automaton has 56 states. [2018-07-25 13:21:30,177 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 113 transitions. [2018-07-25 13:21:30,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2018-07-25 13:21:30,178 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:30,178 INFO L354 BasicCegarLoop]: trace histogram [55, 54, 1, 1, 1] [2018-07-25 13:21:30,178 INFO L415 AbstractCegarLoop]: === Iteration 55 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:30,178 INFO L82 PathProgramCache]: Analyzing trace with hash -605076435, now seen corresponding path program 54 times [2018-07-25 13:21:30,178 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:30,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:30,469 INFO L134 CoverageAnalysis]: Checked inductivity of 2970 backedges. 0 proven. 2970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:30,470 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:30,470 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [56] total 56 [2018-07-25 13:21:30,470 INFO L451 AbstractCegarLoop]: Interpolant automaton has 57 states [2018-07-25 13:21:30,470 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2018-07-25 13:21:30,471 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:21:30,471 INFO L87 Difference]: Start difference. First operand 113 states and 113 transitions. Second operand 57 states. [2018-07-25 13:21:30,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:30,978 INFO L93 Difference]: Finished difference Result 117 states and 117 transitions. [2018-07-25 13:21:30,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2018-07-25 13:21:30,978 INFO L78 Accepts]: Start accepts. Automaton has 57 states. Word has length 112 [2018-07-25 13:21:30,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:30,979 INFO L225 Difference]: With dead ends: 117 [2018-07-25 13:21:30,979 INFO L226 Difference]: Without dead ends: 115 [2018-07-25 13:21:30,980 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=111, Invalid=3081, Unknown=0, NotChecked=0, Total=3192 [2018-07-25 13:21:30,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2018-07-25 13:21:31,003 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2018-07-25 13:21:31,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 115 states. [2018-07-25 13:21:31,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 115 transitions. [2018-07-25 13:21:31,004 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 115 transitions. Word has length 112 [2018-07-25 13:21:31,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:31,004 INFO L472 AbstractCegarLoop]: Abstraction has 115 states and 115 transitions. [2018-07-25 13:21:31,004 INFO L473 AbstractCegarLoop]: Interpolant automaton has 57 states. [2018-07-25 13:21:31,004 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 115 transitions. [2018-07-25 13:21:31,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2018-07-25 13:21:31,005 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:31,005 INFO L354 BasicCegarLoop]: trace histogram [56, 55, 1, 1, 1] [2018-07-25 13:21:31,005 INFO L415 AbstractCegarLoop]: === Iteration 56 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:31,005 INFO L82 PathProgramCache]: Analyzing trace with hash -1657936087, now seen corresponding path program 55 times [2018-07-25 13:21:31,005 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:31,302 INFO L134 CoverageAnalysis]: Checked inductivity of 3080 backedges. 0 proven. 3080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:31,302 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:31,303 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [57] total 57 [2018-07-25 13:21:31,303 INFO L451 AbstractCegarLoop]: Interpolant automaton has 58 states [2018-07-25 13:21:31,303 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2018-07-25 13:21:31,303 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:21:31,304 INFO L87 Difference]: Start difference. First operand 115 states and 115 transitions. Second operand 58 states. [2018-07-25 13:21:31,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:31,973 INFO L93 Difference]: Finished difference Result 119 states and 119 transitions. [2018-07-25 13:21:31,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2018-07-25 13:21:31,973 INFO L78 Accepts]: Start accepts. Automaton has 58 states. Word has length 114 [2018-07-25 13:21:31,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:31,974 INFO L225 Difference]: With dead ends: 119 [2018-07-25 13:21:31,974 INFO L226 Difference]: Without dead ends: 117 [2018-07-25 13:21:31,975 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=113, Invalid=3193, Unknown=0, NotChecked=0, Total=3306 [2018-07-25 13:21:31,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2018-07-25 13:21:32,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2018-07-25 13:21:32,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 117 states. [2018-07-25 13:21:32,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 117 transitions. [2018-07-25 13:21:32,009 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 117 transitions. Word has length 114 [2018-07-25 13:21:32,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:32,009 INFO L472 AbstractCegarLoop]: Abstraction has 117 states and 117 transitions. [2018-07-25 13:21:32,009 INFO L473 AbstractCegarLoop]: Interpolant automaton has 58 states. [2018-07-25 13:21:32,009 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 117 transitions. [2018-07-25 13:21:32,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2018-07-25 13:21:32,010 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:32,010 INFO L354 BasicCegarLoop]: trace histogram [57, 56, 1, 1, 1] [2018-07-25 13:21:32,011 INFO L415 AbstractCegarLoop]: === Iteration 57 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:32,011 INFO L82 PathProgramCache]: Analyzing trace with hash 156220197, now seen corresponding path program 56 times [2018-07-25 13:21:32,011 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:32,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:32,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3192 backedges. 0 proven. 3192 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:32,454 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:32,454 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2018-07-25 13:21:32,454 INFO L451 AbstractCegarLoop]: Interpolant automaton has 59 states [2018-07-25 13:21:32,455 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2018-07-25 13:21:32,455 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:21:32,455 INFO L87 Difference]: Start difference. First operand 117 states and 117 transitions. Second operand 59 states. [2018-07-25 13:21:32,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:32,957 INFO L93 Difference]: Finished difference Result 121 states and 121 transitions. [2018-07-25 13:21:32,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2018-07-25 13:21:32,957 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 116 [2018-07-25 13:21:32,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:32,958 INFO L225 Difference]: With dead ends: 121 [2018-07-25 13:21:32,958 INFO L226 Difference]: Without dead ends: 119 [2018-07-25 13:21:32,958 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=115, Invalid=3307, Unknown=0, NotChecked=0, Total=3422 [2018-07-25 13:21:32,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2018-07-25 13:21:32,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2018-07-25 13:21:32,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2018-07-25 13:21:32,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 119 transitions. [2018-07-25 13:21:32,983 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 119 transitions. Word has length 116 [2018-07-25 13:21:32,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:32,983 INFO L472 AbstractCegarLoop]: Abstraction has 119 states and 119 transitions. [2018-07-25 13:21:32,983 INFO L473 AbstractCegarLoop]: Interpolant automaton has 59 states. [2018-07-25 13:21:32,984 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 119 transitions. [2018-07-25 13:21:32,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2018-07-25 13:21:32,984 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:32,984 INFO L354 BasicCegarLoop]: trace histogram [58, 57, 1, 1, 1] [2018-07-25 13:21:32,985 INFO L415 AbstractCegarLoop]: === Iteration 58 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:32,985 INFO L82 PathProgramCache]: Analyzing trace with hash -196313055, now seen corresponding path program 57 times [2018-07-25 13:21:32,985 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:33,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3306 backedges. 0 proven. 3306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:33,299 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:33,299 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2018-07-25 13:21:33,299 INFO L451 AbstractCegarLoop]: Interpolant automaton has 60 states [2018-07-25 13:21:33,299 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2018-07-25 13:21:33,300 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:21:33,300 INFO L87 Difference]: Start difference. First operand 119 states and 119 transitions. Second operand 60 states. [2018-07-25 13:21:33,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:33,859 INFO L93 Difference]: Finished difference Result 123 states and 123 transitions. [2018-07-25 13:21:33,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2018-07-25 13:21:33,859 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 118 [2018-07-25 13:21:33,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:33,860 INFO L225 Difference]: With dead ends: 123 [2018-07-25 13:21:33,860 INFO L226 Difference]: Without dead ends: 121 [2018-07-25 13:21:33,861 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=117, Invalid=3423, Unknown=0, NotChecked=0, Total=3540 [2018-07-25 13:21:33,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2018-07-25 13:21:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2018-07-25 13:21:33,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 121 states. [2018-07-25 13:21:33,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 121 transitions. [2018-07-25 13:21:33,889 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 121 transitions. Word has length 118 [2018-07-25 13:21:33,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:33,889 INFO L472 AbstractCegarLoop]: Abstraction has 121 states and 121 transitions. [2018-07-25 13:21:33,889 INFO L473 AbstractCegarLoop]: Interpolant automaton has 60 states. [2018-07-25 13:21:33,889 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 121 transitions. [2018-07-25 13:21:33,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2018-07-25 13:21:33,890 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:33,890 INFO L354 BasicCegarLoop]: trace histogram [59, 58, 1, 1, 1] [2018-07-25 13:21:33,890 INFO L415 AbstractCegarLoop]: === Iteration 59 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:33,890 INFO L82 PathProgramCache]: Analyzing trace with hash 321648157, now seen corresponding path program 58 times [2018-07-25 13:21:33,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:34,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3422 backedges. 0 proven. 3422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:34,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:34,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [60] total 60 [2018-07-25 13:21:34,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 61 states [2018-07-25 13:21:34,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2018-07-25 13:21:34,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:21:34,234 INFO L87 Difference]: Start difference. First operand 121 states and 121 transitions. Second operand 61 states. [2018-07-25 13:21:34,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:34,827 INFO L93 Difference]: Finished difference Result 125 states and 125 transitions. [2018-07-25 13:21:34,827 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 61 states. [2018-07-25 13:21:34,827 INFO L78 Accepts]: Start accepts. Automaton has 61 states. Word has length 120 [2018-07-25 13:21:34,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:34,828 INFO L225 Difference]: With dead ends: 125 [2018-07-25 13:21:34,828 INFO L226 Difference]: Without dead ends: 123 [2018-07-25 13:21:34,829 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=3541, Unknown=0, NotChecked=0, Total=3660 [2018-07-25 13:21:34,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2018-07-25 13:21:34,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2018-07-25 13:21:34,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2018-07-25 13:21:34,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 123 transitions. [2018-07-25 13:21:34,858 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 123 transitions. Word has length 120 [2018-07-25 13:21:34,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:34,858 INFO L472 AbstractCegarLoop]: Abstraction has 123 states and 123 transitions. [2018-07-25 13:21:34,858 INFO L473 AbstractCegarLoop]: Interpolant automaton has 61 states. [2018-07-25 13:21:34,858 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 123 transitions. [2018-07-25 13:21:34,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2018-07-25 13:21:34,859 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:34,859 INFO L354 BasicCegarLoop]: trace histogram [60, 59, 1, 1, 1] [2018-07-25 13:21:34,859 INFO L415 AbstractCegarLoop]: === Iteration 60 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:34,859 INFO L82 PathProgramCache]: Analyzing trace with hash -133833447, now seen corresponding path program 59 times [2018-07-25 13:21:34,859 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:34,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:35,242 INFO L134 CoverageAnalysis]: Checked inductivity of 3540 backedges. 0 proven. 3540 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:35,243 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:35,243 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [61] total 61 [2018-07-25 13:21:35,243 INFO L451 AbstractCegarLoop]: Interpolant automaton has 62 states [2018-07-25 13:21:35,243 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2018-07-25 13:21:35,244 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:21:35,244 INFO L87 Difference]: Start difference. First operand 123 states and 123 transitions. Second operand 62 states. [2018-07-25 13:21:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:35,854 INFO L93 Difference]: Finished difference Result 127 states and 127 transitions. [2018-07-25 13:21:35,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2018-07-25 13:21:35,855 INFO L78 Accepts]: Start accepts. Automaton has 62 states. Word has length 122 [2018-07-25 13:21:35,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:35,855 INFO L225 Difference]: With dead ends: 127 [2018-07-25 13:21:35,856 INFO L226 Difference]: Without dead ends: 125 [2018-07-25 13:21:35,856 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=3661, Unknown=0, NotChecked=0, Total=3782 [2018-07-25 13:21:35,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2018-07-25 13:21:35,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2018-07-25 13:21:35,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 125 states. [2018-07-25 13:21:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 125 transitions. [2018-07-25 13:21:35,884 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 125 transitions. Word has length 122 [2018-07-25 13:21:35,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:35,885 INFO L472 AbstractCegarLoop]: Abstraction has 125 states and 125 transitions. [2018-07-25 13:21:35,885 INFO L473 AbstractCegarLoop]: Interpolant automaton has 62 states. [2018-07-25 13:21:35,885 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 125 transitions. [2018-07-25 13:21:35,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2018-07-25 13:21:35,885 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:35,886 INFO L354 BasicCegarLoop]: trace histogram [61, 60, 1, 1, 1] [2018-07-25 13:21:35,886 INFO L415 AbstractCegarLoop]: === Iteration 61 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:35,886 INFO L82 PathProgramCache]: Analyzing trace with hash 235009301, now seen corresponding path program 60 times [2018-07-25 13:21:35,886 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:35,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:36,233 INFO L134 CoverageAnalysis]: Checked inductivity of 3660 backedges. 0 proven. 3660 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:36,233 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:36,233 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [62] total 62 [2018-07-25 13:21:36,234 INFO L451 AbstractCegarLoop]: Interpolant automaton has 63 states [2018-07-25 13:21:36,234 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 63 interpolants. [2018-07-25 13:21:36,234 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:21:36,235 INFO L87 Difference]: Start difference. First operand 125 states and 125 transitions. Second operand 63 states. [2018-07-25 13:21:36,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:36,865 INFO L93 Difference]: Finished difference Result 129 states and 129 transitions. [2018-07-25 13:21:36,865 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 63 states. [2018-07-25 13:21:36,865 INFO L78 Accepts]: Start accepts. Automaton has 63 states. Word has length 124 [2018-07-25 13:21:36,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:36,866 INFO L225 Difference]: With dead ends: 129 [2018-07-25 13:21:36,866 INFO L226 Difference]: Without dead ends: 127 [2018-07-25 13:21:36,867 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=3783, Unknown=0, NotChecked=0, Total=3906 [2018-07-25 13:21:36,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2018-07-25 13:21:36,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2018-07-25 13:21:36,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127 states. [2018-07-25 13:21:36,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 127 transitions. [2018-07-25 13:21:36,907 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 127 transitions. Word has length 124 [2018-07-25 13:21:36,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:36,907 INFO L472 AbstractCegarLoop]: Abstraction has 127 states and 127 transitions. [2018-07-25 13:21:36,908 INFO L473 AbstractCegarLoop]: Interpolant automaton has 63 states. [2018-07-25 13:21:36,908 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 127 transitions. [2018-07-25 13:21:36,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2018-07-25 13:21:36,908 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:36,909 INFO L354 BasicCegarLoop]: trace histogram [62, 61, 1, 1, 1] [2018-07-25 13:21:36,909 INFO L415 AbstractCegarLoop]: === Iteration 62 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:36,909 INFO L82 PathProgramCache]: Analyzing trace with hash -1789395439, now seen corresponding path program 61 times [2018-07-25 13:21:36,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:37,341 INFO L134 CoverageAnalysis]: Checked inductivity of 3782 backedges. 0 proven. 3782 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:37,341 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:37,342 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [63] total 63 [2018-07-25 13:21:37,342 INFO L451 AbstractCegarLoop]: Interpolant automaton has 64 states [2018-07-25 13:21:37,342 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2018-07-25 13:21:37,343 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:21:37,343 INFO L87 Difference]: Start difference. First operand 127 states and 127 transitions. Second operand 64 states. [2018-07-25 13:21:38,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:38,118 INFO L93 Difference]: Finished difference Result 131 states and 131 transitions. [2018-07-25 13:21:38,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2018-07-25 13:21:38,118 INFO L78 Accepts]: Start accepts. Automaton has 64 states. Word has length 126 [2018-07-25 13:21:38,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:38,119 INFO L225 Difference]: With dead ends: 131 [2018-07-25 13:21:38,119 INFO L226 Difference]: Without dead ends: 129 [2018-07-25 13:21:38,120 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=125, Invalid=3907, Unknown=0, NotChecked=0, Total=4032 [2018-07-25 13:21:38,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2018-07-25 13:21:38,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2018-07-25 13:21:38,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 129 states. [2018-07-25 13:21:38,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 129 transitions. [2018-07-25 13:21:38,156 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 129 transitions. Word has length 126 [2018-07-25 13:21:38,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:38,156 INFO L472 AbstractCegarLoop]: Abstraction has 129 states and 129 transitions. [2018-07-25 13:21:38,156 INFO L473 AbstractCegarLoop]: Interpolant automaton has 64 states. [2018-07-25 13:21:38,156 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 129 transitions. [2018-07-25 13:21:38,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2018-07-25 13:21:38,157 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:38,157 INFO L354 BasicCegarLoop]: trace histogram [63, 62, 1, 1, 1] [2018-07-25 13:21:38,157 INFO L415 AbstractCegarLoop]: === Iteration 63 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:38,158 INFO L82 PathProgramCache]: Analyzing trace with hash -1622165491, now seen corresponding path program 62 times [2018-07-25 13:21:38,158 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:38,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:38,545 INFO L134 CoverageAnalysis]: Checked inductivity of 3906 backedges. 0 proven. 3906 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:38,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:38,545 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [64] total 64 [2018-07-25 13:21:38,545 INFO L451 AbstractCegarLoop]: Interpolant automaton has 65 states [2018-07-25 13:21:38,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2018-07-25 13:21:38,546 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:21:38,546 INFO L87 Difference]: Start difference. First operand 129 states and 129 transitions. Second operand 65 states. [2018-07-25 13:21:39,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:39,223 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2018-07-25 13:21:39,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2018-07-25 13:21:39,223 INFO L78 Accepts]: Start accepts. Automaton has 65 states. Word has length 128 [2018-07-25 13:21:39,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:39,224 INFO L225 Difference]: With dead ends: 133 [2018-07-25 13:21:39,225 INFO L226 Difference]: Without dead ends: 131 [2018-07-25 13:21:39,225 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=127, Invalid=4033, Unknown=0, NotChecked=0, Total=4160 [2018-07-25 13:21:39,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2018-07-25 13:21:39,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2018-07-25 13:21:39,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131 states. [2018-07-25 13:21:39,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 131 transitions. [2018-07-25 13:21:39,260 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 131 transitions. Word has length 128 [2018-07-25 13:21:39,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:39,261 INFO L472 AbstractCegarLoop]: Abstraction has 131 states and 131 transitions. [2018-07-25 13:21:39,261 INFO L473 AbstractCegarLoop]: Interpolant automaton has 65 states. [2018-07-25 13:21:39,261 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 131 transitions. [2018-07-25 13:21:39,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2018-07-25 13:21:39,262 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:39,263 INFO L354 BasicCegarLoop]: trace histogram [64, 63, 1, 1, 1] [2018-07-25 13:21:39,263 INFO L415 AbstractCegarLoop]: === Iteration 64 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:39,264 INFO L82 PathProgramCache]: Analyzing trace with hash 172024585, now seen corresponding path program 63 times [2018-07-25 13:21:39,264 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:39,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:39,669 INFO L134 CoverageAnalysis]: Checked inductivity of 4032 backedges. 0 proven. 4032 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:39,669 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:39,669 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [65] total 65 [2018-07-25 13:21:39,670 INFO L451 AbstractCegarLoop]: Interpolant automaton has 66 states [2018-07-25 13:21:39,670 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2018-07-25 13:21:39,670 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:21:39,671 INFO L87 Difference]: Start difference. First operand 131 states and 131 transitions. Second operand 66 states. [2018-07-25 13:21:40,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:40,322 INFO L93 Difference]: Finished difference Result 135 states and 135 transitions. [2018-07-25 13:21:40,322 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 66 states. [2018-07-25 13:21:40,322 INFO L78 Accepts]: Start accepts. Automaton has 66 states. Word has length 130 [2018-07-25 13:21:40,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:40,323 INFO L225 Difference]: With dead ends: 135 [2018-07-25 13:21:40,323 INFO L226 Difference]: Without dead ends: 133 [2018-07-25 13:21:40,324 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=4161, Unknown=0, NotChecked=0, Total=4290 [2018-07-25 13:21:40,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2018-07-25 13:21:40,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2018-07-25 13:21:40,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-07-25 13:21:40,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2018-07-25 13:21:40,357 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 130 [2018-07-25 13:21:40,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:40,357 INFO L472 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2018-07-25 13:21:40,357 INFO L473 AbstractCegarLoop]: Interpolant automaton has 66 states. [2018-07-25 13:21:40,357 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2018-07-25 13:21:40,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2018-07-25 13:21:40,358 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:40,358 INFO L354 BasicCegarLoop]: trace histogram [65, 64, 1, 1, 1] [2018-07-25 13:21:40,358 INFO L415 AbstractCegarLoop]: === Iteration 65 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:40,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2106801925, now seen corresponding path program 64 times [2018-07-25 13:21:40,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:40,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 4160 backedges. 0 proven. 4160 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:40,784 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:40,785 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2018-07-25 13:21:40,785 INFO L451 AbstractCegarLoop]: Interpolant automaton has 67 states [2018-07-25 13:21:40,785 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2018-07-25 13:21:40,785 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:21:40,785 INFO L87 Difference]: Start difference. First operand 133 states and 133 transitions. Second operand 67 states. [2018-07-25 13:21:41,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:41,487 INFO L93 Difference]: Finished difference Result 137 states and 137 transitions. [2018-07-25 13:21:41,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2018-07-25 13:21:41,487 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 132 [2018-07-25 13:21:41,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:41,488 INFO L225 Difference]: With dead ends: 137 [2018-07-25 13:21:41,489 INFO L226 Difference]: Without dead ends: 135 [2018-07-25 13:21:41,489 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=4291, Unknown=0, NotChecked=0, Total=4422 [2018-07-25 13:21:41,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2018-07-25 13:21:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 135. [2018-07-25 13:21:41,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2018-07-25 13:21:41,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 135 transitions. [2018-07-25 13:21:41,523 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 135 transitions. Word has length 132 [2018-07-25 13:21:41,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:41,524 INFO L472 AbstractCegarLoop]: Abstraction has 135 states and 135 transitions. [2018-07-25 13:21:41,524 INFO L473 AbstractCegarLoop]: Interpolant automaton has 67 states. [2018-07-25 13:21:41,524 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 135 transitions. [2018-07-25 13:21:41,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2018-07-25 13:21:41,524 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:41,524 INFO L354 BasicCegarLoop]: trace histogram [66, 65, 1, 1, 1] [2018-07-25 13:21:41,525 INFO L415 AbstractCegarLoop]: === Iteration 66 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:41,525 INFO L82 PathProgramCache]: Analyzing trace with hash 1706986497, now seen corresponding path program 65 times [2018-07-25 13:21:41,525 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:41,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:41,954 INFO L134 CoverageAnalysis]: Checked inductivity of 4290 backedges. 0 proven. 4290 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:41,954 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:41,954 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2018-07-25 13:21:41,955 INFO L451 AbstractCegarLoop]: Interpolant automaton has 68 states [2018-07-25 13:21:41,955 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2018-07-25 13:21:41,955 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:21:41,955 INFO L87 Difference]: Start difference. First operand 135 states and 135 transitions. Second operand 68 states. [2018-07-25 13:21:42,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:42,688 INFO L93 Difference]: Finished difference Result 139 states and 139 transitions. [2018-07-25 13:21:42,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2018-07-25 13:21:42,688 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 134 [2018-07-25 13:21:42,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:42,689 INFO L225 Difference]: With dead ends: 139 [2018-07-25 13:21:42,689 INFO L226 Difference]: Without dead ends: 137 [2018-07-25 13:21:42,689 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=4423, Unknown=0, NotChecked=0, Total=4556 [2018-07-25 13:21:42,689 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2018-07-25 13:21:42,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2018-07-25 13:21:42,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137 states. [2018-07-25 13:21:42,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 137 transitions. [2018-07-25 13:21:42,725 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 137 transitions. Word has length 134 [2018-07-25 13:21:42,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:42,725 INFO L472 AbstractCegarLoop]: Abstraction has 137 states and 137 transitions. [2018-07-25 13:21:42,725 INFO L473 AbstractCegarLoop]: Interpolant automaton has 68 states. [2018-07-25 13:21:42,725 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 137 transitions. [2018-07-25 13:21:42,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2018-07-25 13:21:42,726 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:42,726 INFO L354 BasicCegarLoop]: trace histogram [67, 66, 1, 1, 1] [2018-07-25 13:21:42,726 INFO L415 AbstractCegarLoop]: === Iteration 67 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:42,727 INFO L82 PathProgramCache]: Analyzing trace with hash -263550467, now seen corresponding path program 66 times [2018-07-25 13:21:42,727 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:42,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:43,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4422 backedges. 0 proven. 4422 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:43,172 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:43,172 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [68] total 68 [2018-07-25 13:21:43,173 INFO L451 AbstractCegarLoop]: Interpolant automaton has 69 states [2018-07-25 13:21:43,173 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2018-07-25 13:21:43,173 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:21:43,174 INFO L87 Difference]: Start difference. First operand 137 states and 137 transitions. Second operand 69 states. [2018-07-25 13:21:44,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:44,062 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2018-07-25 13:21:44,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 69 states. [2018-07-25 13:21:44,063 INFO L78 Accepts]: Start accepts. Automaton has 69 states. Word has length 136 [2018-07-25 13:21:44,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:44,064 INFO L225 Difference]: With dead ends: 141 [2018-07-25 13:21:44,064 INFO L226 Difference]: Without dead ends: 139 [2018-07-25 13:21:44,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=4557, Unknown=0, NotChecked=0, Total=4692 [2018-07-25 13:21:44,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2018-07-25 13:21:44,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 139. [2018-07-25 13:21:44,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 139 states. [2018-07-25 13:21:44,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 139 transitions. [2018-07-25 13:21:44,131 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 139 transitions. Word has length 136 [2018-07-25 13:21:44,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:44,131 INFO L472 AbstractCegarLoop]: Abstraction has 139 states and 139 transitions. [2018-07-25 13:21:44,131 INFO L473 AbstractCegarLoop]: Interpolant automaton has 69 states. [2018-07-25 13:21:44,131 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 139 transitions. [2018-07-25 13:21:44,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2018-07-25 13:21:44,132 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:44,133 INFO L354 BasicCegarLoop]: trace histogram [68, 67, 1, 1, 1] [2018-07-25 13:21:44,133 INFO L415 AbstractCegarLoop]: === Iteration 68 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:44,133 INFO L82 PathProgramCache]: Analyzing trace with hash 131004665, now seen corresponding path program 67 times [2018-07-25 13:21:44,134 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:44,747 INFO L134 CoverageAnalysis]: Checked inductivity of 4556 backedges. 0 proven. 4556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:44,748 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:44,748 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [69] total 69 [2018-07-25 13:21:44,748 INFO L451 AbstractCegarLoop]: Interpolant automaton has 70 states [2018-07-25 13:21:44,748 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 70 interpolants. [2018-07-25 13:21:44,749 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:21:44,749 INFO L87 Difference]: Start difference. First operand 139 states and 139 transitions. Second operand 70 states. [2018-07-25 13:21:45,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:45,656 INFO L93 Difference]: Finished difference Result 143 states and 143 transitions. [2018-07-25 13:21:45,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 70 states. [2018-07-25 13:21:45,656 INFO L78 Accepts]: Start accepts. Automaton has 70 states. Word has length 138 [2018-07-25 13:21:45,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:45,658 INFO L225 Difference]: With dead ends: 143 [2018-07-25 13:21:45,658 INFO L226 Difference]: Without dead ends: 141 [2018-07-25 13:21:45,658 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=137, Invalid=4693, Unknown=0, NotChecked=0, Total=4830 [2018-07-25 13:21:45,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-07-25 13:21:45,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2018-07-25 13:21:45,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 141 states. [2018-07-25 13:21:45,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 141 transitions. [2018-07-25 13:21:45,713 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 141 transitions. Word has length 138 [2018-07-25 13:21:45,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:45,713 INFO L472 AbstractCegarLoop]: Abstraction has 141 states and 141 transitions. [2018-07-25 13:21:45,713 INFO L473 AbstractCegarLoop]: Interpolant automaton has 70 states. [2018-07-25 13:21:45,713 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 141 transitions. [2018-07-25 13:21:45,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2018-07-25 13:21:45,714 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:45,714 INFO L354 BasicCegarLoop]: trace histogram [69, 68, 1, 1, 1] [2018-07-25 13:21:45,715 INFO L415 AbstractCegarLoop]: === Iteration 69 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:45,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1341364469, now seen corresponding path program 68 times [2018-07-25 13:21:45,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:45,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:46,359 INFO L134 CoverageAnalysis]: Checked inductivity of 4692 backedges. 0 proven. 4692 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:46,359 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:46,359 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [70] total 70 [2018-07-25 13:21:46,360 INFO L451 AbstractCegarLoop]: Interpolant automaton has 71 states [2018-07-25 13:21:46,360 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2018-07-25 13:21:46,360 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:21:46,360 INFO L87 Difference]: Start difference. First operand 141 states and 141 transitions. Second operand 71 states. [2018-07-25 13:21:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:47,149 INFO L93 Difference]: Finished difference Result 145 states and 145 transitions. [2018-07-25 13:21:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2018-07-25 13:21:47,149 INFO L78 Accepts]: Start accepts. Automaton has 71 states. Word has length 140 [2018-07-25 13:21:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:47,150 INFO L225 Difference]: With dead ends: 145 [2018-07-25 13:21:47,150 INFO L226 Difference]: Without dead ends: 143 [2018-07-25 13:21:47,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=139, Invalid=4831, Unknown=0, NotChecked=0, Total=4970 [2018-07-25 13:21:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2018-07-25 13:21:47,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2018-07-25 13:21:47,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2018-07-25 13:21:47,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 143 transitions. [2018-07-25 13:21:47,183 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 143 transitions. Word has length 140 [2018-07-25 13:21:47,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:47,183 INFO L472 AbstractCegarLoop]: Abstraction has 143 states and 143 transitions. [2018-07-25 13:21:47,183 INFO L473 AbstractCegarLoop]: Interpolant automaton has 71 states. [2018-07-25 13:21:47,183 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 143 transitions. [2018-07-25 13:21:47,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2018-07-25 13:21:47,184 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:47,184 INFO L354 BasicCegarLoop]: trace histogram [70, 69, 1, 1, 1] [2018-07-25 13:21:47,184 INFO L415 AbstractCegarLoop]: === Iteration 70 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:47,184 INFO L82 PathProgramCache]: Analyzing trace with hash 560998897, now seen corresponding path program 69 times [2018-07-25 13:21:47,184 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:47,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:47,685 INFO L134 CoverageAnalysis]: Checked inductivity of 4830 backedges. 0 proven. 4830 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:47,686 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:47,686 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [71] total 71 [2018-07-25 13:21:47,686 INFO L451 AbstractCegarLoop]: Interpolant automaton has 72 states [2018-07-25 13:21:47,686 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 72 interpolants. [2018-07-25 13:21:47,687 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:21:47,687 INFO L87 Difference]: Start difference. First operand 143 states and 143 transitions. Second operand 72 states. [2018-07-25 13:21:48,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:48,503 INFO L93 Difference]: Finished difference Result 147 states and 147 transitions. [2018-07-25 13:21:48,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2018-07-25 13:21:48,503 INFO L78 Accepts]: Start accepts. Automaton has 72 states. Word has length 142 [2018-07-25 13:21:48,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:48,504 INFO L225 Difference]: With dead ends: 147 [2018-07-25 13:21:48,504 INFO L226 Difference]: Without dead ends: 145 [2018-07-25 13:21:48,504 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=141, Invalid=4971, Unknown=0, NotChecked=0, Total=5112 [2018-07-25 13:21:48,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2018-07-25 13:21:48,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2018-07-25 13:21:48,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 145 states. [2018-07-25 13:21:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 145 transitions. [2018-07-25 13:21:48,546 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 145 transitions. Word has length 142 [2018-07-25 13:21:48,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:48,546 INFO L472 AbstractCegarLoop]: Abstraction has 145 states and 145 transitions. [2018-07-25 13:21:48,546 INFO L473 AbstractCegarLoop]: Interpolant automaton has 72 states. [2018-07-25 13:21:48,546 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 145 transitions. [2018-07-25 13:21:48,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2018-07-25 13:21:48,547 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:48,547 INFO L354 BasicCegarLoop]: trace histogram [71, 70, 1, 1, 1] [2018-07-25 13:21:48,547 INFO L415 AbstractCegarLoop]: === Iteration 71 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:48,548 INFO L82 PathProgramCache]: Analyzing trace with hash -2046006291, now seen corresponding path program 70 times [2018-07-25 13:21:48,548 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:48,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:49,049 INFO L134 CoverageAnalysis]: Checked inductivity of 4970 backedges. 0 proven. 4970 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:49,049 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:49,049 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [72] total 72 [2018-07-25 13:21:49,050 INFO L451 AbstractCegarLoop]: Interpolant automaton has 73 states [2018-07-25 13:21:49,050 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 73 interpolants. [2018-07-25 13:21:49,050 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:21:49,050 INFO L87 Difference]: Start difference. First operand 145 states and 145 transitions. Second operand 73 states. [2018-07-25 13:21:49,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:49,960 INFO L93 Difference]: Finished difference Result 149 states and 149 transitions. [2018-07-25 13:21:49,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 73 states. [2018-07-25 13:21:49,960 INFO L78 Accepts]: Start accepts. Automaton has 73 states. Word has length 144 [2018-07-25 13:21:49,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:49,961 INFO L225 Difference]: With dead ends: 149 [2018-07-25 13:21:49,961 INFO L226 Difference]: Without dead ends: 147 [2018-07-25 13:21:49,961 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=143, Invalid=5113, Unknown=0, NotChecked=0, Total=5256 [2018-07-25 13:21:49,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2018-07-25 13:21:50,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2018-07-25 13:21:50,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 147 states. [2018-07-25 13:21:50,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 147 transitions. [2018-07-25 13:21:50,013 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 147 transitions. Word has length 144 [2018-07-25 13:21:50,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:50,013 INFO L472 AbstractCegarLoop]: Abstraction has 147 states and 147 transitions. [2018-07-25 13:21:50,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 73 states. [2018-07-25 13:21:50,013 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 147 transitions. [2018-07-25 13:21:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2018-07-25 13:21:50,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:50,014 INFO L354 BasicCegarLoop]: trace histogram [72, 71, 1, 1, 1] [2018-07-25 13:21:50,014 INFO L415 AbstractCegarLoop]: === Iteration 72 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:50,015 INFO L82 PathProgramCache]: Analyzing trace with hash 882908905, now seen corresponding path program 71 times [2018-07-25 13:21:50,015 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:50,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5112 backedges. 0 proven. 5112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:50,523 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:50,523 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [73] total 73 [2018-07-25 13:21:50,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 74 states [2018-07-25 13:21:50,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2018-07-25 13:21:50,523 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:21:50,524 INFO L87 Difference]: Start difference. First operand 147 states and 147 transitions. Second operand 74 states. [2018-07-25 13:21:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:51,569 INFO L93 Difference]: Finished difference Result 151 states and 151 transitions. [2018-07-25 13:21:51,569 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 74 states. [2018-07-25 13:21:51,569 INFO L78 Accepts]: Start accepts. Automaton has 74 states. Word has length 146 [2018-07-25 13:21:51,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:51,570 INFO L225 Difference]: With dead ends: 151 [2018-07-25 13:21:51,570 INFO L226 Difference]: Without dead ends: 149 [2018-07-25 13:21:51,570 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=145, Invalid=5257, Unknown=0, NotChecked=0, Total=5402 [2018-07-25 13:21:51,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-07-25 13:21:51,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2018-07-25 13:21:51,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149 states. [2018-07-25 13:21:51,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 149 transitions. [2018-07-25 13:21:51,614 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 149 transitions. Word has length 146 [2018-07-25 13:21:51,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:51,615 INFO L472 AbstractCegarLoop]: Abstraction has 149 states and 149 transitions. [2018-07-25 13:21:51,615 INFO L473 AbstractCegarLoop]: Interpolant automaton has 74 states. [2018-07-25 13:21:51,615 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 149 transitions. [2018-07-25 13:21:51,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2018-07-25 13:21:51,616 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:51,616 INFO L354 BasicCegarLoop]: trace histogram [73, 72, 1, 1, 1] [2018-07-25 13:21:51,616 INFO L415 AbstractCegarLoop]: === Iteration 73 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:51,616 INFO L82 PathProgramCache]: Analyzing trace with hash -1928133915, now seen corresponding path program 72 times [2018-07-25 13:21:51,616 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:51,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:52,153 INFO L134 CoverageAnalysis]: Checked inductivity of 5256 backedges. 0 proven. 5256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:52,154 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:52,154 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2018-07-25 13:21:52,154 INFO L451 AbstractCegarLoop]: Interpolant automaton has 75 states [2018-07-25 13:21:52,154 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2018-07-25 13:21:52,155 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:21:52,155 INFO L87 Difference]: Start difference. First operand 149 states and 149 transitions. Second operand 75 states. [2018-07-25 13:21:53,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:53,004 INFO L93 Difference]: Finished difference Result 153 states and 153 transitions. [2018-07-25 13:21:53,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2018-07-25 13:21:53,005 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 148 [2018-07-25 13:21:53,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:53,006 INFO L225 Difference]: With dead ends: 153 [2018-07-25 13:21:53,006 INFO L226 Difference]: Without dead ends: 151 [2018-07-25 13:21:53,006 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=147, Invalid=5403, Unknown=0, NotChecked=0, Total=5550 [2018-07-25 13:21:53,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2018-07-25 13:21:53,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2018-07-25 13:21:53,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2018-07-25 13:21:53,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 151 transitions. [2018-07-25 13:21:53,062 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 151 transitions. Word has length 148 [2018-07-25 13:21:53,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:53,062 INFO L472 AbstractCegarLoop]: Abstraction has 151 states and 151 transitions. [2018-07-25 13:21:53,062 INFO L473 AbstractCegarLoop]: Interpolant automaton has 75 states. [2018-07-25 13:21:53,062 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 151 transitions. [2018-07-25 13:21:53,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2018-07-25 13:21:53,063 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:53,063 INFO L354 BasicCegarLoop]: trace histogram [74, 73, 1, 1, 1] [2018-07-25 13:21:53,063 INFO L415 AbstractCegarLoop]: === Iteration 74 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:53,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1805854751, now seen corresponding path program 73 times [2018-07-25 13:21:53,064 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:53,769 INFO L134 CoverageAnalysis]: Checked inductivity of 5402 backedges. 0 proven. 5402 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:53,769 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:53,770 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [75] total 75 [2018-07-25 13:21:53,770 INFO L451 AbstractCegarLoop]: Interpolant automaton has 76 states [2018-07-25 13:21:53,770 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 76 interpolants. [2018-07-25 13:21:53,770 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:21:53,771 INFO L87 Difference]: Start difference. First operand 151 states and 151 transitions. Second operand 76 states. [2018-07-25 13:21:54,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:54,670 INFO L93 Difference]: Finished difference Result 155 states and 155 transitions. [2018-07-25 13:21:54,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 76 states. [2018-07-25 13:21:54,671 INFO L78 Accepts]: Start accepts. Automaton has 76 states. Word has length 150 [2018-07-25 13:21:54,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:54,672 INFO L225 Difference]: With dead ends: 155 [2018-07-25 13:21:54,672 INFO L226 Difference]: Without dead ends: 153 [2018-07-25 13:21:54,672 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=149, Invalid=5551, Unknown=0, NotChecked=0, Total=5700 [2018-07-25 13:21:54,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2018-07-25 13:21:54,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2018-07-25 13:21:54,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2018-07-25 13:21:54,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 153 transitions. [2018-07-25 13:21:54,718 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 153 transitions. Word has length 150 [2018-07-25 13:21:54,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:54,719 INFO L472 AbstractCegarLoop]: Abstraction has 153 states and 153 transitions. [2018-07-25 13:21:54,719 INFO L473 AbstractCegarLoop]: Interpolant automaton has 76 states. [2018-07-25 13:21:54,719 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 153 transitions. [2018-07-25 13:21:54,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2018-07-25 13:21:54,719 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:54,719 INFO L354 BasicCegarLoop]: trace histogram [75, 74, 1, 1, 1] [2018-07-25 13:21:54,720 INFO L415 AbstractCegarLoop]: === Iteration 75 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:54,720 INFO L82 PathProgramCache]: Analyzing trace with hash -259695139, now seen corresponding path program 74 times [2018-07-25 13:21:54,720 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:54,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:55,369 INFO L134 CoverageAnalysis]: Checked inductivity of 5550 backedges. 0 proven. 5550 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:55,369 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:55,370 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [76] total 76 [2018-07-25 13:21:55,370 INFO L451 AbstractCegarLoop]: Interpolant automaton has 77 states [2018-07-25 13:21:55,370 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 77 interpolants. [2018-07-25 13:21:55,371 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:21:55,371 INFO L87 Difference]: Start difference. First operand 153 states and 153 transitions. Second operand 77 states. [2018-07-25 13:21:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:56,276 INFO L93 Difference]: Finished difference Result 157 states and 157 transitions. [2018-07-25 13:21:56,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2018-07-25 13:21:56,276 INFO L78 Accepts]: Start accepts. Automaton has 77 states. Word has length 152 [2018-07-25 13:21:56,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:56,277 INFO L225 Difference]: With dead ends: 157 [2018-07-25 13:21:56,277 INFO L226 Difference]: Without dead ends: 155 [2018-07-25 13:21:56,277 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=151, Invalid=5701, Unknown=0, NotChecked=0, Total=5852 [2018-07-25 13:21:56,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2018-07-25 13:21:56,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2018-07-25 13:21:56,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 155 states. [2018-07-25 13:21:56,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 155 transitions. [2018-07-25 13:21:56,319 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 155 transitions. Word has length 152 [2018-07-25 13:21:56,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:56,319 INFO L472 AbstractCegarLoop]: Abstraction has 155 states and 155 transitions. [2018-07-25 13:21:56,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 77 states. [2018-07-25 13:21:56,319 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 155 transitions. [2018-07-25 13:21:56,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2018-07-25 13:21:56,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:56,320 INFO L354 BasicCegarLoop]: trace histogram [76, 75, 1, 1, 1] [2018-07-25 13:21:56,321 INFO L415 AbstractCegarLoop]: === Iteration 76 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:56,321 INFO L82 PathProgramCache]: Analyzing trace with hash -458992423, now seen corresponding path program 75 times [2018-07-25 13:21:56,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:56,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:56,865 INFO L134 CoverageAnalysis]: Checked inductivity of 5700 backedges. 0 proven. 5700 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:56,865 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:56,866 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [77] total 77 [2018-07-25 13:21:56,866 INFO L451 AbstractCegarLoop]: Interpolant automaton has 78 states [2018-07-25 13:21:56,866 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2018-07-25 13:21:56,867 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:21:56,867 INFO L87 Difference]: Start difference. First operand 155 states and 155 transitions. Second operand 78 states. [2018-07-25 13:21:57,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:57,758 INFO L93 Difference]: Finished difference Result 159 states and 159 transitions. [2018-07-25 13:21:57,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 78 states. [2018-07-25 13:21:57,758 INFO L78 Accepts]: Start accepts. Automaton has 78 states. Word has length 154 [2018-07-25 13:21:57,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:57,759 INFO L225 Difference]: With dead ends: 159 [2018-07-25 13:21:57,759 INFO L226 Difference]: Without dead ends: 157 [2018-07-25 13:21:57,760 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=5853, Unknown=0, NotChecked=0, Total=6006 [2018-07-25 13:21:57,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2018-07-25 13:21:57,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2018-07-25 13:21:57,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 157 states. [2018-07-25 13:21:57,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 157 transitions. [2018-07-25 13:21:57,811 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 157 transitions. Word has length 154 [2018-07-25 13:21:57,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:57,812 INFO L472 AbstractCegarLoop]: Abstraction has 157 states and 157 transitions. [2018-07-25 13:21:57,812 INFO L473 AbstractCegarLoop]: Interpolant automaton has 78 states. [2018-07-25 13:21:57,812 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 157 transitions. [2018-07-25 13:21:57,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2018-07-25 13:21:57,813 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:57,813 INFO L354 BasicCegarLoop]: trace histogram [77, 76, 1, 1, 1] [2018-07-25 13:21:57,813 INFO L415 AbstractCegarLoop]: === Iteration 77 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:57,813 INFO L82 PathProgramCache]: Analyzing trace with hash 1289845973, now seen corresponding path program 76 times [2018-07-25 13:21:57,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:57,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:21:58,437 INFO L134 CoverageAnalysis]: Checked inductivity of 5852 backedges. 0 proven. 5852 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:21:58,438 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:21:58,438 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [78] total 78 [2018-07-25 13:21:58,438 INFO L451 AbstractCegarLoop]: Interpolant automaton has 79 states [2018-07-25 13:21:58,439 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 79 interpolants. [2018-07-25 13:21:58,439 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:21:58,439 INFO L87 Difference]: Start difference. First operand 157 states and 157 transitions. Second operand 79 states. [2018-07-25 13:21:59,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:21:59,486 INFO L93 Difference]: Finished difference Result 161 states and 161 transitions. [2018-07-25 13:21:59,486 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 79 states. [2018-07-25 13:21:59,487 INFO L78 Accepts]: Start accepts. Automaton has 79 states. Word has length 156 [2018-07-25 13:21:59,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:21:59,487 INFO L225 Difference]: With dead ends: 161 [2018-07-25 13:21:59,487 INFO L226 Difference]: Without dead ends: 159 [2018-07-25 13:21:59,488 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=155, Invalid=6007, Unknown=0, NotChecked=0, Total=6162 [2018-07-25 13:21:59,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2018-07-25 13:21:59,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2018-07-25 13:21:59,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-07-25 13:21:59,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 159 transitions. [2018-07-25 13:21:59,531 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 159 transitions. Word has length 156 [2018-07-25 13:21:59,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:21:59,531 INFO L472 AbstractCegarLoop]: Abstraction has 159 states and 159 transitions. [2018-07-25 13:21:59,532 INFO L473 AbstractCegarLoop]: Interpolant automaton has 79 states. [2018-07-25 13:21:59,532 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 159 transitions. [2018-07-25 13:21:59,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2018-07-25 13:21:59,532 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:21:59,532 INFO L354 BasicCegarLoop]: trace histogram [78, 77, 1, 1, 1] [2018-07-25 13:21:59,532 INFO L415 AbstractCegarLoop]: === Iteration 78 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:21:59,533 INFO L82 PathProgramCache]: Analyzing trace with hash -1703635503, now seen corresponding path program 77 times [2018-07-25 13:21:59,533 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:21:59,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:00,095 INFO L134 CoverageAnalysis]: Checked inductivity of 6006 backedges. 0 proven. 6006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:00,095 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:00,095 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [79] total 79 [2018-07-25 13:22:00,096 INFO L451 AbstractCegarLoop]: Interpolant automaton has 80 states [2018-07-25 13:22:00,096 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 80 interpolants. [2018-07-25 13:22:00,096 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:22:00,096 INFO L87 Difference]: Start difference. First operand 159 states and 159 transitions. Second operand 80 states. [2018-07-25 13:22:01,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:01,110 INFO L93 Difference]: Finished difference Result 163 states and 163 transitions. [2018-07-25 13:22:01,110 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 80 states. [2018-07-25 13:22:01,110 INFO L78 Accepts]: Start accepts. Automaton has 80 states. Word has length 158 [2018-07-25 13:22:01,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:01,111 INFO L225 Difference]: With dead ends: 163 [2018-07-25 13:22:01,111 INFO L226 Difference]: Without dead ends: 161 [2018-07-25 13:22:01,112 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 78 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=6163, Unknown=0, NotChecked=0, Total=6320 [2018-07-25 13:22:01,112 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2018-07-25 13:22:01,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2018-07-25 13:22:01,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161 states. [2018-07-25 13:22:01,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 161 transitions. [2018-07-25 13:22:01,166 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 161 transitions. Word has length 158 [2018-07-25 13:22:01,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:01,167 INFO L472 AbstractCegarLoop]: Abstraction has 161 states and 161 transitions. [2018-07-25 13:22:01,167 INFO L473 AbstractCegarLoop]: Interpolant automaton has 80 states. [2018-07-25 13:22:01,167 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 161 transitions. [2018-07-25 13:22:01,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2018-07-25 13:22:01,168 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:01,168 INFO L354 BasicCegarLoop]: trace histogram [79, 78, 1, 1, 1] [2018-07-25 13:22:01,168 INFO L415 AbstractCegarLoop]: === Iteration 79 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:01,168 INFO L82 PathProgramCache]: Analyzing trace with hash -811245619, now seen corresponding path program 78 times [2018-07-25 13:22:01,169 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:01,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:01,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6162 backedges. 0 proven. 6162 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:01,811 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:01,811 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [80] total 80 [2018-07-25 13:22:01,812 INFO L451 AbstractCegarLoop]: Interpolant automaton has 81 states [2018-07-25 13:22:01,812 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 81 interpolants. [2018-07-25 13:22:01,812 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:22:01,812 INFO L87 Difference]: Start difference. First operand 161 states and 161 transitions. Second operand 81 states. [2018-07-25 13:22:02,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:02,874 INFO L93 Difference]: Finished difference Result 165 states and 165 transitions. [2018-07-25 13:22:02,874 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 81 states. [2018-07-25 13:22:02,874 INFO L78 Accepts]: Start accepts. Automaton has 81 states. Word has length 160 [2018-07-25 13:22:02,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:02,875 INFO L225 Difference]: With dead ends: 165 [2018-07-25 13:22:02,875 INFO L226 Difference]: Without dead ends: 163 [2018-07-25 13:22:02,875 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=6321, Unknown=0, NotChecked=0, Total=6480 [2018-07-25 13:22:02,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2018-07-25 13:22:02,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2018-07-25 13:22:02,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 163 states. [2018-07-25 13:22:02,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 163 transitions. [2018-07-25 13:22:02,921 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 163 transitions. Word has length 160 [2018-07-25 13:22:02,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:02,921 INFO L472 AbstractCegarLoop]: Abstraction has 163 states and 163 transitions. [2018-07-25 13:22:02,921 INFO L473 AbstractCegarLoop]: Interpolant automaton has 81 states. [2018-07-25 13:22:02,921 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 163 transitions. [2018-07-25 13:22:02,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2018-07-25 13:22:02,922 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:02,922 INFO L354 BasicCegarLoop]: trace histogram [80, 79, 1, 1, 1] [2018-07-25 13:22:02,922 INFO L415 AbstractCegarLoop]: === Iteration 80 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:02,922 INFO L82 PathProgramCache]: Analyzing trace with hash 2076941001, now seen corresponding path program 79 times [2018-07-25 13:22:02,922 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:03,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:03,539 INFO L134 CoverageAnalysis]: Checked inductivity of 6320 backedges. 0 proven. 6320 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:03,540 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:03,540 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [81] total 81 [2018-07-25 13:22:03,540 INFO L451 AbstractCegarLoop]: Interpolant automaton has 82 states [2018-07-25 13:22:03,540 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 82 interpolants. [2018-07-25 13:22:03,541 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:22:03,541 INFO L87 Difference]: Start difference. First operand 163 states and 163 transitions. Second operand 82 states. [2018-07-25 13:22:04,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:04,602 INFO L93 Difference]: Finished difference Result 167 states and 167 transitions. [2018-07-25 13:22:04,602 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 82 states. [2018-07-25 13:22:04,602 INFO L78 Accepts]: Start accepts. Automaton has 82 states. Word has length 162 [2018-07-25 13:22:04,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:04,603 INFO L225 Difference]: With dead ends: 167 [2018-07-25 13:22:04,603 INFO L226 Difference]: Without dead ends: 165 [2018-07-25 13:22:04,604 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=161, Invalid=6481, Unknown=0, NotChecked=0, Total=6642 [2018-07-25 13:22:04,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2018-07-25 13:22:04,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2018-07-25 13:22:04,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 165 states. [2018-07-25 13:22:04,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 165 transitions. [2018-07-25 13:22:04,648 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 165 transitions. Word has length 162 [2018-07-25 13:22:04,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:04,649 INFO L472 AbstractCegarLoop]: Abstraction has 165 states and 165 transitions. [2018-07-25 13:22:04,649 INFO L473 AbstractCegarLoop]: Interpolant automaton has 82 states. [2018-07-25 13:22:04,649 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 165 transitions. [2018-07-25 13:22:04,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2018-07-25 13:22:04,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:04,649 INFO L354 BasicCegarLoop]: trace histogram [81, 80, 1, 1, 1] [2018-07-25 13:22:04,650 INFO L415 AbstractCegarLoop]: === Iteration 81 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:04,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1219557691, now seen corresponding path program 80 times [2018-07-25 13:22:04,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6480 backedges. 0 proven. 6480 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:05,294 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:05,294 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2018-07-25 13:22:05,294 INFO L451 AbstractCegarLoop]: Interpolant automaton has 83 states [2018-07-25 13:22:05,294 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2018-07-25 13:22:05,295 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:22:05,295 INFO L87 Difference]: Start difference. First operand 165 states and 165 transitions. Second operand 83 states. [2018-07-25 13:22:06,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:06,477 INFO L93 Difference]: Finished difference Result 169 states and 169 transitions. [2018-07-25 13:22:06,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2018-07-25 13:22:06,477 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 164 [2018-07-25 13:22:06,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:06,478 INFO L225 Difference]: With dead ends: 169 [2018-07-25 13:22:06,479 INFO L226 Difference]: Without dead ends: 167 [2018-07-25 13:22:06,479 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=163, Invalid=6643, Unknown=0, NotChecked=0, Total=6806 [2018-07-25 13:22:06,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2018-07-25 13:22:06,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-07-25 13:22:06,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-07-25 13:22:06,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 167 transitions. [2018-07-25 13:22:06,557 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 167 transitions. Word has length 164 [2018-07-25 13:22:06,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:06,558 INFO L472 AbstractCegarLoop]: Abstraction has 167 states and 167 transitions. [2018-07-25 13:22:06,558 INFO L473 AbstractCegarLoop]: Interpolant automaton has 83 states. [2018-07-25 13:22:06,558 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 167 transitions. [2018-07-25 13:22:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2018-07-25 13:22:06,558 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:06,558 INFO L354 BasicCegarLoop]: trace histogram [82, 81, 1, 1, 1] [2018-07-25 13:22:06,559 INFO L415 AbstractCegarLoop]: === Iteration 82 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:06,559 INFO L82 PathProgramCache]: Analyzing trace with hash 531063745, now seen corresponding path program 81 times [2018-07-25 13:22:06,559 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:07,211 INFO L134 CoverageAnalysis]: Checked inductivity of 6642 backedges. 0 proven. 6642 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:07,211 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:07,211 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [83] total 83 [2018-07-25 13:22:07,212 INFO L451 AbstractCegarLoop]: Interpolant automaton has 84 states [2018-07-25 13:22:07,212 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 84 interpolants. [2018-07-25 13:22:07,212 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:22:07,212 INFO L87 Difference]: Start difference. First operand 167 states and 167 transitions. Second operand 84 states. [2018-07-25 13:22:08,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:08,344 INFO L93 Difference]: Finished difference Result 171 states and 171 transitions. [2018-07-25 13:22:08,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 84 states. [2018-07-25 13:22:08,345 INFO L78 Accepts]: Start accepts. Automaton has 84 states. Word has length 166 [2018-07-25 13:22:08,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:08,346 INFO L225 Difference]: With dead ends: 171 [2018-07-25 13:22:08,346 INFO L226 Difference]: Without dead ends: 169 [2018-07-25 13:22:08,346 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 82 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=6807, Unknown=0, NotChecked=0, Total=6972 [2018-07-25 13:22:08,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2018-07-25 13:22:08,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 169. [2018-07-25 13:22:08,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2018-07-25 13:22:08,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 169 transitions. [2018-07-25 13:22:08,390 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 169 transitions. Word has length 166 [2018-07-25 13:22:08,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:08,390 INFO L472 AbstractCegarLoop]: Abstraction has 169 states and 169 transitions. [2018-07-25 13:22:08,390 INFO L473 AbstractCegarLoop]: Interpolant automaton has 84 states. [2018-07-25 13:22:08,390 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 169 transitions. [2018-07-25 13:22:08,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2018-07-25 13:22:08,391 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:08,391 INFO L354 BasicCegarLoop]: trace histogram [83, 82, 1, 1, 1] [2018-07-25 13:22:08,391 INFO L415 AbstractCegarLoop]: === Iteration 83 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:08,391 INFO L82 PathProgramCache]: Analyzing trace with hash -748916291, now seen corresponding path program 82 times [2018-07-25 13:22:08,391 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:08,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:09,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6806 backedges. 0 proven. 6806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:09,066 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:09,066 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [84] total 84 [2018-07-25 13:22:09,066 INFO L451 AbstractCegarLoop]: Interpolant automaton has 85 states [2018-07-25 13:22:09,066 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 85 interpolants. [2018-07-25 13:22:09,067 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:22:09,067 INFO L87 Difference]: Start difference. First operand 169 states and 169 transitions. Second operand 85 states. [2018-07-25 13:22:10,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:10,237 INFO L93 Difference]: Finished difference Result 173 states and 173 transitions. [2018-07-25 13:22:10,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 85 states. [2018-07-25 13:22:10,237 INFO L78 Accepts]: Start accepts. Automaton has 85 states. Word has length 168 [2018-07-25 13:22:10,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:10,238 INFO L225 Difference]: With dead ends: 173 [2018-07-25 13:22:10,238 INFO L226 Difference]: Without dead ends: 171 [2018-07-25 13:22:10,239 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=167, Invalid=6973, Unknown=0, NotChecked=0, Total=7140 [2018-07-25 13:22:10,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2018-07-25 13:22:10,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 171. [2018-07-25 13:22:10,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 171 states. [2018-07-25 13:22:10,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 171 transitions. [2018-07-25 13:22:10,288 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 171 transitions. Word has length 168 [2018-07-25 13:22:10,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:10,289 INFO L472 AbstractCegarLoop]: Abstraction has 171 states and 171 transitions. [2018-07-25 13:22:10,289 INFO L473 AbstractCegarLoop]: Interpolant automaton has 85 states. [2018-07-25 13:22:10,289 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 171 transitions. [2018-07-25 13:22:10,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2018-07-25 13:22:10,290 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:10,290 INFO L354 BasicCegarLoop]: trace histogram [84, 83, 1, 1, 1] [2018-07-25 13:22:10,290 INFO L415 AbstractCegarLoop]: === Iteration 84 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:10,290 INFO L82 PathProgramCache]: Analyzing trace with hash 1845883065, now seen corresponding path program 83 times [2018-07-25 13:22:10,291 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:10,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:11,024 INFO L134 CoverageAnalysis]: Checked inductivity of 6972 backedges. 0 proven. 6972 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:11,025 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:11,025 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [85] total 85 [2018-07-25 13:22:11,025 INFO L451 AbstractCegarLoop]: Interpolant automaton has 86 states [2018-07-25 13:22:11,025 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 86 interpolants. [2018-07-25 13:22:11,026 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:22:11,026 INFO L87 Difference]: Start difference. First operand 171 states and 171 transitions. Second operand 86 states. [2018-07-25 13:22:12,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:12,224 INFO L93 Difference]: Finished difference Result 175 states and 175 transitions. [2018-07-25 13:22:12,224 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 86 states. [2018-07-25 13:22:12,224 INFO L78 Accepts]: Start accepts. Automaton has 86 states. Word has length 170 [2018-07-25 13:22:12,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:12,225 INFO L225 Difference]: With dead ends: 175 [2018-07-25 13:22:12,225 INFO L226 Difference]: Without dead ends: 173 [2018-07-25 13:22:12,226 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=169, Invalid=7141, Unknown=0, NotChecked=0, Total=7310 [2018-07-25 13:22:12,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2018-07-25 13:22:12,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2018-07-25 13:22:12,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 173 states. [2018-07-25 13:22:12,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 173 transitions. [2018-07-25 13:22:12,277 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 173 transitions. Word has length 170 [2018-07-25 13:22:12,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:12,277 INFO L472 AbstractCegarLoop]: Abstraction has 173 states and 173 transitions. [2018-07-25 13:22:12,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 86 states. [2018-07-25 13:22:12,277 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 173 transitions. [2018-07-25 13:22:12,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2018-07-25 13:22:12,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:12,278 INFO L354 BasicCegarLoop]: trace histogram [85, 84, 1, 1, 1] [2018-07-25 13:22:12,278 INFO L415 AbstractCegarLoop]: === Iteration 85 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:12,279 INFO L82 PathProgramCache]: Analyzing trace with hash 72065205, now seen corresponding path program 84 times [2018-07-25 13:22:12,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:12,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:12,995 INFO L134 CoverageAnalysis]: Checked inductivity of 7140 backedges. 0 proven. 7140 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:12,995 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:12,995 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [86] total 86 [2018-07-25 13:22:12,996 INFO L451 AbstractCegarLoop]: Interpolant automaton has 87 states [2018-07-25 13:22:12,996 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 87 interpolants. [2018-07-25 13:22:12,996 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:22:12,997 INFO L87 Difference]: Start difference. First operand 173 states and 173 transitions. Second operand 87 states. [2018-07-25 13:22:14,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:14,208 INFO L93 Difference]: Finished difference Result 177 states and 177 transitions. [2018-07-25 13:22:14,208 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 87 states. [2018-07-25 13:22:14,208 INFO L78 Accepts]: Start accepts. Automaton has 87 states. Word has length 172 [2018-07-25 13:22:14,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:14,209 INFO L225 Difference]: With dead ends: 177 [2018-07-25 13:22:14,209 INFO L226 Difference]: Without dead ends: 175 [2018-07-25 13:22:14,210 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=171, Invalid=7311, Unknown=0, NotChecked=0, Total=7482 [2018-07-25 13:22:14,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2018-07-25 13:22:14,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2018-07-25 13:22:14,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 175 states. [2018-07-25 13:22:14,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 175 transitions. [2018-07-25 13:22:14,276 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 175 transitions. Word has length 172 [2018-07-25 13:22:14,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:14,277 INFO L472 AbstractCegarLoop]: Abstraction has 175 states and 175 transitions. [2018-07-25 13:22:14,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 87 states. [2018-07-25 13:22:14,277 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 175 transitions. [2018-07-25 13:22:14,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2018-07-25 13:22:14,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:14,279 INFO L354 BasicCegarLoop]: trace histogram [86, 85, 1, 1, 1] [2018-07-25 13:22:14,279 INFO L415 AbstractCegarLoop]: === Iteration 86 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:14,280 INFO L82 PathProgramCache]: Analyzing trace with hash 535118257, now seen corresponding path program 85 times [2018-07-25 13:22:14,280 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:14,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:15,113 INFO L134 CoverageAnalysis]: Checked inductivity of 7310 backedges. 0 proven. 7310 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:15,113 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:15,114 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [87] total 87 [2018-07-25 13:22:15,114 INFO L451 AbstractCegarLoop]: Interpolant automaton has 88 states [2018-07-25 13:22:15,114 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 88 interpolants. [2018-07-25 13:22:15,115 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:22:15,115 INFO L87 Difference]: Start difference. First operand 175 states and 175 transitions. Second operand 88 states. [2018-07-25 13:22:16,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:16,310 INFO L93 Difference]: Finished difference Result 179 states and 179 transitions. [2018-07-25 13:22:16,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2018-07-25 13:22:16,310 INFO L78 Accepts]: Start accepts. Automaton has 88 states. Word has length 174 [2018-07-25 13:22:16,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:16,312 INFO L225 Difference]: With dead ends: 179 [2018-07-25 13:22:16,312 INFO L226 Difference]: Without dead ends: 177 [2018-07-25 13:22:16,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=173, Invalid=7483, Unknown=0, NotChecked=0, Total=7656 [2018-07-25 13:22:16,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2018-07-25 13:22:16,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2018-07-25 13:22:16,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 177 states. [2018-07-25 13:22:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 177 transitions. [2018-07-25 13:22:16,365 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 177 transitions. Word has length 174 [2018-07-25 13:22:16,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:16,365 INFO L472 AbstractCegarLoop]: Abstraction has 177 states and 177 transitions. [2018-07-25 13:22:16,365 INFO L473 AbstractCegarLoop]: Interpolant automaton has 88 states. [2018-07-25 13:22:16,365 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 177 transitions. [2018-07-25 13:22:16,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2018-07-25 13:22:16,366 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:16,366 INFO L354 BasicCegarLoop]: trace histogram [87, 86, 1, 1, 1] [2018-07-25 13:22:16,367 INFO L415 AbstractCegarLoop]: === Iteration 87 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:16,367 INFO L82 PathProgramCache]: Analyzing trace with hash -1147497555, now seen corresponding path program 86 times [2018-07-25 13:22:16,367 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:17,203 INFO L134 CoverageAnalysis]: Checked inductivity of 7482 backedges. 0 proven. 7482 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:17,204 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:17,204 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [88] total 88 [2018-07-25 13:22:17,204 INFO L451 AbstractCegarLoop]: Interpolant automaton has 89 states [2018-07-25 13:22:17,205 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 89 interpolants. [2018-07-25 13:22:17,205 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:22:17,205 INFO L87 Difference]: Start difference. First operand 177 states and 177 transitions. Second operand 89 states. [2018-07-25 13:22:18,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:18,376 INFO L93 Difference]: Finished difference Result 181 states and 181 transitions. [2018-07-25 13:22:18,376 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 89 states. [2018-07-25 13:22:18,376 INFO L78 Accepts]: Start accepts. Automaton has 89 states. Word has length 176 [2018-07-25 13:22:18,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:18,377 INFO L225 Difference]: With dead ends: 181 [2018-07-25 13:22:18,377 INFO L226 Difference]: Without dead ends: 179 [2018-07-25 13:22:18,378 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 87 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=175, Invalid=7657, Unknown=0, NotChecked=0, Total=7832 [2018-07-25 13:22:18,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-07-25 13:22:18,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 179. [2018-07-25 13:22:18,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2018-07-25 13:22:18,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 179 transitions. [2018-07-25 13:22:18,432 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 179 transitions. Word has length 176 [2018-07-25 13:22:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:18,432 INFO L472 AbstractCegarLoop]: Abstraction has 179 states and 179 transitions. [2018-07-25 13:22:18,432 INFO L473 AbstractCegarLoop]: Interpolant automaton has 89 states. [2018-07-25 13:22:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 179 transitions. [2018-07-25 13:22:18,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2018-07-25 13:22:18,433 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:18,433 INFO L354 BasicCegarLoop]: trace histogram [88, 87, 1, 1, 1] [2018-07-25 13:22:18,433 INFO L415 AbstractCegarLoop]: === Iteration 88 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:18,434 INFO L82 PathProgramCache]: Analyzing trace with hash 1061377705, now seen corresponding path program 87 times [2018-07-25 13:22:18,434 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:18,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:19,230 INFO L134 CoverageAnalysis]: Checked inductivity of 7656 backedges. 0 proven. 7656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:19,231 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:19,231 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [89] total 89 [2018-07-25 13:22:19,231 INFO L451 AbstractCegarLoop]: Interpolant automaton has 90 states [2018-07-25 13:22:19,232 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 90 interpolants. [2018-07-25 13:22:19,232 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:22:19,232 INFO L87 Difference]: Start difference. First operand 179 states and 179 transitions. Second operand 90 states. [2018-07-25 13:22:20,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:20,565 INFO L93 Difference]: Finished difference Result 183 states and 183 transitions. [2018-07-25 13:22:20,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 90 states. [2018-07-25 13:22:20,565 INFO L78 Accepts]: Start accepts. Automaton has 90 states. Word has length 178 [2018-07-25 13:22:20,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:20,566 INFO L225 Difference]: With dead ends: 183 [2018-07-25 13:22:20,566 INFO L226 Difference]: Without dead ends: 181 [2018-07-25 13:22:20,567 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=177, Invalid=7833, Unknown=0, NotChecked=0, Total=8010 [2018-07-25 13:22:20,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2018-07-25 13:22:20,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2018-07-25 13:22:20,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 181 states. [2018-07-25 13:22:20,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 181 transitions. [2018-07-25 13:22:20,621 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 181 transitions. Word has length 178 [2018-07-25 13:22:20,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:20,622 INFO L472 AbstractCegarLoop]: Abstraction has 181 states and 181 transitions. [2018-07-25 13:22:20,622 INFO L473 AbstractCegarLoop]: Interpolant automaton has 90 states. [2018-07-25 13:22:20,622 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 181 transitions. [2018-07-25 13:22:20,622 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2018-07-25 13:22:20,622 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:20,622 INFO L354 BasicCegarLoop]: trace histogram [89, 88, 1, 1, 1] [2018-07-25 13:22:20,623 INFO L415 AbstractCegarLoop]: === Iteration 89 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:20,623 INFO L82 PathProgramCache]: Analyzing trace with hash 2076658341, now seen corresponding path program 88 times [2018-07-25 13:22:20,623 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:20,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:21,418 INFO L134 CoverageAnalysis]: Checked inductivity of 7832 backedges. 0 proven. 7832 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:21,419 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:21,419 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2018-07-25 13:22:21,419 INFO L451 AbstractCegarLoop]: Interpolant automaton has 91 states [2018-07-25 13:22:21,420 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2018-07-25 13:22:21,420 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:22:21,420 INFO L87 Difference]: Start difference. First operand 181 states and 181 transitions. Second operand 91 states. [2018-07-25 13:22:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:22,699 INFO L93 Difference]: Finished difference Result 185 states and 185 transitions. [2018-07-25 13:22:22,699 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2018-07-25 13:22:22,699 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 180 [2018-07-25 13:22:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:22,700 INFO L225 Difference]: With dead ends: 185 [2018-07-25 13:22:22,700 INFO L226 Difference]: Without dead ends: 183 [2018-07-25 13:22:22,701 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=179, Invalid=8011, Unknown=0, NotChecked=0, Total=8190 [2018-07-25 13:22:22,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-07-25 13:22:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 183. [2018-07-25 13:22:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183 states. [2018-07-25 13:22:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 183 transitions. [2018-07-25 13:22:22,759 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 183 transitions. Word has length 180 [2018-07-25 13:22:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:22,759 INFO L472 AbstractCegarLoop]: Abstraction has 183 states and 183 transitions. [2018-07-25 13:22:22,759 INFO L473 AbstractCegarLoop]: Interpolant automaton has 91 states. [2018-07-25 13:22:22,759 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 183 transitions. [2018-07-25 13:22:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2018-07-25 13:22:22,760 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:22,760 INFO L354 BasicCegarLoop]: trace histogram [90, 89, 1, 1, 1] [2018-07-25 13:22:22,760 INFO L415 AbstractCegarLoop]: === Iteration 90 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:22,760 INFO L82 PathProgramCache]: Analyzing trace with hash -1491193951, now seen corresponding path program 89 times [2018-07-25 13:22:22,761 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:22,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:23,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8010 backedges. 0 proven. 8010 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:23,637 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:23,637 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [91] total 91 [2018-07-25 13:22:23,638 INFO L451 AbstractCegarLoop]: Interpolant automaton has 92 states [2018-07-25 13:22:23,638 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 92 interpolants. [2018-07-25 13:22:23,638 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:22:23,639 INFO L87 Difference]: Start difference. First operand 183 states and 183 transitions. Second operand 92 states. [2018-07-25 13:22:24,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:24,916 INFO L93 Difference]: Finished difference Result 187 states and 187 transitions. [2018-07-25 13:22:24,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 92 states. [2018-07-25 13:22:24,916 INFO L78 Accepts]: Start accepts. Automaton has 92 states. Word has length 182 [2018-07-25 13:22:24,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:24,917 INFO L225 Difference]: With dead ends: 187 [2018-07-25 13:22:24,917 INFO L226 Difference]: Without dead ends: 185 [2018-07-25 13:22:24,918 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 90 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=181, Invalid=8191, Unknown=0, NotChecked=0, Total=8372 [2018-07-25 13:22:24,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2018-07-25 13:22:24,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2018-07-25 13:22:24,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 185 states. [2018-07-25 13:22:24,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 185 transitions. [2018-07-25 13:22:24,974 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 185 transitions. Word has length 182 [2018-07-25 13:22:24,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:24,974 INFO L472 AbstractCegarLoop]: Abstraction has 185 states and 185 transitions. [2018-07-25 13:22:24,974 INFO L473 AbstractCegarLoop]: Interpolant automaton has 92 states. [2018-07-25 13:22:24,974 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 185 transitions. [2018-07-25 13:22:24,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2018-07-25 13:22:24,975 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:24,975 INFO L354 BasicCegarLoop]: trace histogram [91, 90, 1, 1, 1] [2018-07-25 13:22:24,975 INFO L415 AbstractCegarLoop]: === Iteration 91 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:24,975 INFO L82 PathProgramCache]: Analyzing trace with hash 1481622941, now seen corresponding path program 90 times [2018-07-25 13:22:24,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:25,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:25,925 INFO L134 CoverageAnalysis]: Checked inductivity of 8190 backedges. 0 proven. 8190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:25,925 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:25,925 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [92] total 92 [2018-07-25 13:22:25,926 INFO L451 AbstractCegarLoop]: Interpolant automaton has 93 states [2018-07-25 13:22:25,926 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 93 interpolants. [2018-07-25 13:22:25,926 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:22:25,927 INFO L87 Difference]: Start difference. First operand 185 states and 185 transitions. Second operand 93 states. [2018-07-25 13:22:27,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:27,310 INFO L93 Difference]: Finished difference Result 189 states and 189 transitions. [2018-07-25 13:22:27,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 93 states. [2018-07-25 13:22:27,310 INFO L78 Accepts]: Start accepts. Automaton has 93 states. Word has length 184 [2018-07-25 13:22:27,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:27,311 INFO L225 Difference]: With dead ends: 189 [2018-07-25 13:22:27,311 INFO L226 Difference]: Without dead ends: 187 [2018-07-25 13:22:27,312 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=183, Invalid=8373, Unknown=0, NotChecked=0, Total=8556 [2018-07-25 13:22:27,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2018-07-25 13:22:27,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 187. [2018-07-25 13:22:27,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 187 states. [2018-07-25 13:22:27,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 187 transitions. [2018-07-25 13:22:27,373 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 187 transitions. Word has length 184 [2018-07-25 13:22:27,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:27,373 INFO L472 AbstractCegarLoop]: Abstraction has 187 states and 187 transitions. [2018-07-25 13:22:27,374 INFO L473 AbstractCegarLoop]: Interpolant automaton has 93 states. [2018-07-25 13:22:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 187 transitions. [2018-07-25 13:22:27,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2018-07-25 13:22:27,374 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:27,375 INFO L354 BasicCegarLoop]: trace histogram [92, 91, 1, 1, 1] [2018-07-25 13:22:27,375 INFO L415 AbstractCegarLoop]: === Iteration 92 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:27,375 INFO L82 PathProgramCache]: Analyzing trace with hash -2089562983, now seen corresponding path program 91 times [2018-07-25 13:22:27,375 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:27,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 8372 backedges. 0 proven. 8372 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:28,225 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:28,225 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [93] total 93 [2018-07-25 13:22:28,225 INFO L451 AbstractCegarLoop]: Interpolant automaton has 94 states [2018-07-25 13:22:28,225 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 94 interpolants. [2018-07-25 13:22:28,226 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:22:28,226 INFO L87 Difference]: Start difference. First operand 187 states and 187 transitions. Second operand 94 states. [2018-07-25 13:22:29,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:29,622 INFO L93 Difference]: Finished difference Result 191 states and 191 transitions. [2018-07-25 13:22:29,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2018-07-25 13:22:29,623 INFO L78 Accepts]: Start accepts. Automaton has 94 states. Word has length 186 [2018-07-25 13:22:29,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:29,624 INFO L225 Difference]: With dead ends: 191 [2018-07-25 13:22:29,624 INFO L226 Difference]: Without dead ends: 189 [2018-07-25 13:22:29,625 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 92 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=185, Invalid=8557, Unknown=0, NotChecked=0, Total=8742 [2018-07-25 13:22:29,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2018-07-25 13:22:29,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2018-07-25 13:22:29,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2018-07-25 13:22:29,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 189 transitions. [2018-07-25 13:22:29,685 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 189 transitions. Word has length 186 [2018-07-25 13:22:29,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:29,686 INFO L472 AbstractCegarLoop]: Abstraction has 189 states and 189 transitions. [2018-07-25 13:22:29,686 INFO L473 AbstractCegarLoop]: Interpolant automaton has 94 states. [2018-07-25 13:22:29,686 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 189 transitions. [2018-07-25 13:22:29,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2018-07-25 13:22:29,687 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:29,687 INFO L354 BasicCegarLoop]: trace histogram [93, 92, 1, 1, 1] [2018-07-25 13:22:29,687 INFO L415 AbstractCegarLoop]: === Iteration 93 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:29,687 INFO L82 PathProgramCache]: Analyzing trace with hash 1974600853, now seen corresponding path program 92 times [2018-07-25 13:22:29,687 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:29,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:30,600 INFO L134 CoverageAnalysis]: Checked inductivity of 8556 backedges. 0 proven. 8556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:30,600 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:30,600 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [94] total 94 [2018-07-25 13:22:30,601 INFO L451 AbstractCegarLoop]: Interpolant automaton has 95 states [2018-07-25 13:22:30,601 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 95 interpolants. [2018-07-25 13:22:30,602 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:22:30,602 INFO L87 Difference]: Start difference. First operand 189 states and 189 transitions. Second operand 95 states. [2018-07-25 13:22:31,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:31,931 INFO L93 Difference]: Finished difference Result 193 states and 193 transitions. [2018-07-25 13:22:31,931 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 95 states. [2018-07-25 13:22:31,931 INFO L78 Accepts]: Start accepts. Automaton has 95 states. Word has length 188 [2018-07-25 13:22:31,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:31,932 INFO L225 Difference]: With dead ends: 193 [2018-07-25 13:22:31,932 INFO L226 Difference]: Without dead ends: 191 [2018-07-25 13:22:31,932 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=187, Invalid=8743, Unknown=0, NotChecked=0, Total=8930 [2018-07-25 13:22:31,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2018-07-25 13:22:31,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2018-07-25 13:22:31,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 191 states. [2018-07-25 13:22:31,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 191 transitions. [2018-07-25 13:22:31,992 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 191 transitions. Word has length 188 [2018-07-25 13:22:31,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:31,992 INFO L472 AbstractCegarLoop]: Abstraction has 191 states and 191 transitions. [2018-07-25 13:22:31,992 INFO L473 AbstractCegarLoop]: Interpolant automaton has 95 states. [2018-07-25 13:22:31,992 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 191 transitions. [2018-07-25 13:22:31,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2018-07-25 13:22:31,993 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:31,993 INFO L354 BasicCegarLoop]: trace histogram [94, 93, 1, 1, 1] [2018-07-25 13:22:31,993 INFO L415 AbstractCegarLoop]: === Iteration 94 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:31,994 INFO L82 PathProgramCache]: Analyzing trace with hash -784192111, now seen corresponding path program 93 times [2018-07-25 13:22:31,994 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:32,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:32,896 INFO L134 CoverageAnalysis]: Checked inductivity of 8742 backedges. 0 proven. 8742 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:32,896 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:32,896 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [95] total 95 [2018-07-25 13:22:32,897 INFO L451 AbstractCegarLoop]: Interpolant automaton has 96 states [2018-07-25 13:22:32,897 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 96 interpolants. [2018-07-25 13:22:32,898 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:22:32,898 INFO L87 Difference]: Start difference. First operand 191 states and 191 transitions. Second operand 96 states. [2018-07-25 13:22:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:34,326 INFO L93 Difference]: Finished difference Result 195 states and 195 transitions. [2018-07-25 13:22:34,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 96 states. [2018-07-25 13:22:34,326 INFO L78 Accepts]: Start accepts. Automaton has 96 states. Word has length 190 [2018-07-25 13:22:34,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:34,327 INFO L225 Difference]: With dead ends: 195 [2018-07-25 13:22:34,327 INFO L226 Difference]: Without dead ends: 193 [2018-07-25 13:22:34,328 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=189, Invalid=8931, Unknown=0, NotChecked=0, Total=9120 [2018-07-25 13:22:34,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2018-07-25 13:22:34,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2018-07-25 13:22:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 193 states. [2018-07-25 13:22:34,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 193 transitions. [2018-07-25 13:22:34,414 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 193 transitions. Word has length 190 [2018-07-25 13:22:34,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:34,414 INFO L472 AbstractCegarLoop]: Abstraction has 193 states and 193 transitions. [2018-07-25 13:22:34,414 INFO L473 AbstractCegarLoop]: Interpolant automaton has 96 states. [2018-07-25 13:22:34,415 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 193 transitions. [2018-07-25 13:22:34,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2018-07-25 13:22:34,416 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:34,416 INFO L354 BasicCegarLoop]: trace histogram [95, 94, 1, 1, 1] [2018-07-25 13:22:34,416 INFO L415 AbstractCegarLoop]: === Iteration 95 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:34,416 INFO L82 PathProgramCache]: Analyzing trace with hash -1989408883, now seen corresponding path program 94 times [2018-07-25 13:22:34,417 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:34,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:35,447 INFO L134 CoverageAnalysis]: Checked inductivity of 8930 backedges. 0 proven. 8930 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:35,448 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:35,448 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [96] total 96 [2018-07-25 13:22:35,448 INFO L451 AbstractCegarLoop]: Interpolant automaton has 97 states [2018-07-25 13:22:35,448 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 97 interpolants. [2018-07-25 13:22:35,448 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:22:35,449 INFO L87 Difference]: Start difference. First operand 193 states and 193 transitions. Second operand 97 states. [2018-07-25 13:22:36,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:36,931 INFO L93 Difference]: Finished difference Result 197 states and 197 transitions. [2018-07-25 13:22:36,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2018-07-25 13:22:36,932 INFO L78 Accepts]: Start accepts. Automaton has 97 states. Word has length 192 [2018-07-25 13:22:36,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:36,933 INFO L225 Difference]: With dead ends: 197 [2018-07-25 13:22:36,933 INFO L226 Difference]: Without dead ends: 195 [2018-07-25 13:22:36,934 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=191, Invalid=9121, Unknown=0, NotChecked=0, Total=9312 [2018-07-25 13:22:36,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2018-07-25 13:22:37,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2018-07-25 13:22:37,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2018-07-25 13:22:37,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 195 transitions. [2018-07-25 13:22:37,012 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 195 transitions. Word has length 192 [2018-07-25 13:22:37,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:37,013 INFO L472 AbstractCegarLoop]: Abstraction has 195 states and 195 transitions. [2018-07-25 13:22:37,013 INFO L473 AbstractCegarLoop]: Interpolant automaton has 97 states. [2018-07-25 13:22:37,013 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 195 transitions. [2018-07-25 13:22:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2018-07-25 13:22:37,014 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:37,014 INFO L354 BasicCegarLoop]: trace histogram [96, 95, 1, 1, 1] [2018-07-25 13:22:37,014 INFO L415 AbstractCegarLoop]: === Iteration 96 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:37,014 INFO L82 PathProgramCache]: Analyzing trace with hash -561556855, now seen corresponding path program 95 times [2018-07-25 13:22:37,014 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:37,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:38,023 INFO L134 CoverageAnalysis]: Checked inductivity of 9120 backedges. 0 proven. 9120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:38,023 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:38,024 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [97] total 97 [2018-07-25 13:22:38,024 INFO L451 AbstractCegarLoop]: Interpolant automaton has 98 states [2018-07-25 13:22:38,024 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 98 interpolants. [2018-07-25 13:22:38,025 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:22:38,025 INFO L87 Difference]: Start difference. First operand 195 states and 195 transitions. Second operand 98 states. [2018-07-25 13:22:39,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:39,572 INFO L93 Difference]: Finished difference Result 199 states and 199 transitions. [2018-07-25 13:22:39,572 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 98 states. [2018-07-25 13:22:39,572 INFO L78 Accepts]: Start accepts. Automaton has 98 states. Word has length 194 [2018-07-25 13:22:39,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:39,573 INFO L225 Difference]: With dead ends: 199 [2018-07-25 13:22:39,573 INFO L226 Difference]: Without dead ends: 197 [2018-07-25 13:22:39,574 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 96 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=193, Invalid=9313, Unknown=0, NotChecked=0, Total=9506 [2018-07-25 13:22:39,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2018-07-25 13:22:39,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2018-07-25 13:22:39,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 197 states. [2018-07-25 13:22:39,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 197 transitions. [2018-07-25 13:22:39,666 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 197 transitions. Word has length 194 [2018-07-25 13:22:39,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:39,666 INFO L472 AbstractCegarLoop]: Abstraction has 197 states and 197 transitions. [2018-07-25 13:22:39,666 INFO L473 AbstractCegarLoop]: Interpolant automaton has 98 states. [2018-07-25 13:22:39,666 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 197 transitions. [2018-07-25 13:22:39,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2018-07-25 13:22:39,667 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:39,667 INFO L354 BasicCegarLoop]: trace histogram [97, 96, 1, 1, 1] [2018-07-25 13:22:39,667 INFO L415 AbstractCegarLoop]: === Iteration 97 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:39,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1509674629, now seen corresponding path program 96 times [2018-07-25 13:22:39,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:40,663 INFO L134 CoverageAnalysis]: Checked inductivity of 9312 backedges. 0 proven. 9312 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:40,664 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:40,664 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2018-07-25 13:22:40,664 INFO L451 AbstractCegarLoop]: Interpolant automaton has 99 states [2018-07-25 13:22:40,664 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2018-07-25 13:22:40,665 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:22:40,665 INFO L87 Difference]: Start difference. First operand 197 states and 197 transitions. Second operand 99 states. [2018-07-25 13:22:42,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:42,261 INFO L93 Difference]: Finished difference Result 201 states and 201 transitions. [2018-07-25 13:22:42,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2018-07-25 13:22:42,261 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 196 [2018-07-25 13:22:42,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:42,262 INFO L225 Difference]: With dead ends: 201 [2018-07-25 13:22:42,262 INFO L226 Difference]: Without dead ends: 199 [2018-07-25 13:22:42,263 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=9507, Unknown=0, NotChecked=0, Total=9702 [2018-07-25 13:22:42,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2018-07-25 13:22:42,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 199. [2018-07-25 13:22:42,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 199 states. [2018-07-25 13:22:42,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 199 states to 199 states and 199 transitions. [2018-07-25 13:22:42,332 INFO L78 Accepts]: Start accepts. Automaton has 199 states and 199 transitions. Word has length 196 [2018-07-25 13:22:42,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:42,333 INFO L472 AbstractCegarLoop]: Abstraction has 199 states and 199 transitions. [2018-07-25 13:22:42,333 INFO L473 AbstractCegarLoop]: Interpolant automaton has 99 states. [2018-07-25 13:22:42,333 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 199 transitions. [2018-07-25 13:22:42,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2018-07-25 13:22:42,334 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:42,334 INFO L354 BasicCegarLoop]: trace histogram [98, 97, 1, 1, 1] [2018-07-25 13:22:42,334 INFO L415 AbstractCegarLoop]: === Iteration 98 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:42,335 INFO L82 PathProgramCache]: Analyzing trace with hash -901694591, now seen corresponding path program 97 times [2018-07-25 13:22:42,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:42,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:43,345 INFO L134 CoverageAnalysis]: Checked inductivity of 9506 backedges. 0 proven. 9506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:43,345 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:43,345 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [99] total 99 [2018-07-25 13:22:43,346 INFO L451 AbstractCegarLoop]: Interpolant automaton has 100 states [2018-07-25 13:22:43,346 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 100 interpolants. [2018-07-25 13:22:43,347 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:22:43,347 INFO L87 Difference]: Start difference. First operand 199 states and 199 transitions. Second operand 100 states. [2018-07-25 13:22:44,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:44,936 INFO L93 Difference]: Finished difference Result 203 states and 203 transitions. [2018-07-25 13:22:44,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 100 states. [2018-07-25 13:22:44,937 INFO L78 Accepts]: Start accepts. Automaton has 100 states. Word has length 198 [2018-07-25 13:22:44,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:44,938 INFO L225 Difference]: With dead ends: 203 [2018-07-25 13:22:44,938 INFO L226 Difference]: Without dead ends: 201 [2018-07-25 13:22:44,938 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=9703, Unknown=0, NotChecked=0, Total=9900 [2018-07-25 13:22:44,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 201 states. [2018-07-25 13:22:45,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 201 to 201. [2018-07-25 13:22:45,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 201 states. [2018-07-25 13:22:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 201 transitions. [2018-07-25 13:22:45,005 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 201 transitions. Word has length 198 [2018-07-25 13:22:45,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:45,005 INFO L472 AbstractCegarLoop]: Abstraction has 201 states and 201 transitions. [2018-07-25 13:22:45,005 INFO L473 AbstractCegarLoop]: Interpolant automaton has 100 states. [2018-07-25 13:22:45,005 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 201 transitions. [2018-07-25 13:22:45,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2018-07-25 13:22:45,006 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:45,006 INFO L354 BasicCegarLoop]: trace histogram [99, 98, 1, 1, 1] [2018-07-25 13:22:45,006 INFO L415 AbstractCegarLoop]: === Iteration 99 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:45,007 INFO L82 PathProgramCache]: Analyzing trace with hash 1054824829, now seen corresponding path program 98 times [2018-07-25 13:22:45,007 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:45,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:46,042 INFO L134 CoverageAnalysis]: Checked inductivity of 9702 backedges. 0 proven. 9702 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:46,042 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:46,042 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [100] total 100 [2018-07-25 13:22:46,043 INFO L451 AbstractCegarLoop]: Interpolant automaton has 101 states [2018-07-25 13:22:46,043 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 101 interpolants. [2018-07-25 13:22:46,043 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:22:46,044 INFO L87 Difference]: Start difference. First operand 201 states and 201 transitions. Second operand 101 states. [2018-07-25 13:22:47,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:47,678 INFO L93 Difference]: Finished difference Result 205 states and 205 transitions. [2018-07-25 13:22:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2018-07-25 13:22:47,678 INFO L78 Accepts]: Start accepts. Automaton has 101 states. Word has length 200 [2018-07-25 13:22:47,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:47,680 INFO L225 Difference]: With dead ends: 205 [2018-07-25 13:22:47,680 INFO L226 Difference]: Without dead ends: 203 [2018-07-25 13:22:47,681 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=9901, Unknown=0, NotChecked=0, Total=10100 [2018-07-25 13:22:47,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2018-07-25 13:22:47,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 203. [2018-07-25 13:22:47,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 203 states. [2018-07-25 13:22:47,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 203 states to 203 states and 203 transitions. [2018-07-25 13:22:47,766 INFO L78 Accepts]: Start accepts. Automaton has 203 states and 203 transitions. Word has length 200 [2018-07-25 13:22:47,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:47,767 INFO L472 AbstractCegarLoop]: Abstraction has 203 states and 203 transitions. [2018-07-25 13:22:47,767 INFO L473 AbstractCegarLoop]: Interpolant automaton has 101 states. [2018-07-25 13:22:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 203 states and 203 transitions. [2018-07-25 13:22:47,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2018-07-25 13:22:47,768 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:47,768 INFO L354 BasicCegarLoop]: trace histogram [100, 99, 1, 1, 1] [2018-07-25 13:22:47,769 INFO L415 AbstractCegarLoop]: === Iteration 100 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:47,769 INFO L82 PathProgramCache]: Analyzing trace with hash 74311801, now seen corresponding path program 99 times [2018-07-25 13:22:47,769 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:47,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:48,827 INFO L134 CoverageAnalysis]: Checked inductivity of 9900 backedges. 0 proven. 9900 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:48,827 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:48,827 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [101] total 101 [2018-07-25 13:22:48,827 INFO L451 AbstractCegarLoop]: Interpolant automaton has 102 states [2018-07-25 13:22:48,828 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 102 interpolants. [2018-07-25 13:22:48,828 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:22:48,828 INFO L87 Difference]: Start difference. First operand 203 states and 203 transitions. Second operand 102 states. [2018-07-25 13:22:50,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:50,495 INFO L93 Difference]: Finished difference Result 207 states and 207 transitions. [2018-07-25 13:22:50,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2018-07-25 13:22:50,495 INFO L78 Accepts]: Start accepts. Automaton has 102 states. Word has length 202 [2018-07-25 13:22:50,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:50,496 INFO L225 Difference]: With dead ends: 207 [2018-07-25 13:22:50,496 INFO L226 Difference]: Without dead ends: 205 [2018-07-25 13:22:50,497 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 100 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=201, Invalid=10101, Unknown=0, NotChecked=0, Total=10302 [2018-07-25 13:22:50,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2018-07-25 13:22:50,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 205. [2018-07-25 13:22:50,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 205 states. [2018-07-25 13:22:50,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 205 transitions. [2018-07-25 13:22:50,566 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 205 transitions. Word has length 202 [2018-07-25 13:22:50,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:50,567 INFO L472 AbstractCegarLoop]: Abstraction has 205 states and 205 transitions. [2018-07-25 13:22:50,567 INFO L473 AbstractCegarLoop]: Interpolant automaton has 102 states. [2018-07-25 13:22:50,567 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 205 transitions. [2018-07-25 13:22:50,568 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2018-07-25 13:22:50,568 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:50,568 INFO L354 BasicCegarLoop]: trace histogram [101, 100, 1, 1, 1] [2018-07-25 13:22:50,568 INFO L415 AbstractCegarLoop]: === Iteration 101 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:50,569 INFO L82 PathProgramCache]: Analyzing trace with hash -1600870283, now seen corresponding path program 100 times [2018-07-25 13:22:50,569 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:51,858 INFO L134 CoverageAnalysis]: Checked inductivity of 10100 backedges. 0 proven. 10100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:51,859 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:51,859 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [102] total 102 [2018-07-25 13:22:51,859 INFO L451 AbstractCegarLoop]: Interpolant automaton has 103 states [2018-07-25 13:22:51,859 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 103 interpolants. [2018-07-25 13:22:51,860 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:22:51,860 INFO L87 Difference]: Start difference. First operand 205 states and 205 transitions. Second operand 103 states. [2018-07-25 13:22:53,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:53,384 INFO L93 Difference]: Finished difference Result 209 states and 209 transitions. [2018-07-25 13:22:53,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 103 states. [2018-07-25 13:22:53,385 INFO L78 Accepts]: Start accepts. Automaton has 103 states. Word has length 204 [2018-07-25 13:22:53,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:53,386 INFO L225 Difference]: With dead ends: 209 [2018-07-25 13:22:53,386 INFO L226 Difference]: Without dead ends: 207 [2018-07-25 13:22:53,387 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=203, Invalid=10303, Unknown=0, NotChecked=0, Total=10506 [2018-07-25 13:22:53,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2018-07-25 13:22:53,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 207. [2018-07-25 13:22:53,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 207 states. [2018-07-25 13:22:53,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 207 transitions. [2018-07-25 13:22:53,467 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 207 transitions. Word has length 204 [2018-07-25 13:22:53,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:53,468 INFO L472 AbstractCegarLoop]: Abstraction has 207 states and 207 transitions. [2018-07-25 13:22:53,468 INFO L473 AbstractCegarLoop]: Interpolant automaton has 103 states. [2018-07-25 13:22:53,468 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 207 transitions. [2018-07-25 13:22:53,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2018-07-25 13:22:53,469 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:53,469 INFO L354 BasicCegarLoop]: trace histogram [102, 101, 1, 1, 1] [2018-07-25 13:22:53,469 INFO L415 AbstractCegarLoop]: === Iteration 102 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:53,469 INFO L82 PathProgramCache]: Analyzing trace with hash -838117007, now seen corresponding path program 101 times [2018-07-25 13:22:53,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:53,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:54,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10302 backedges. 0 proven. 10302 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:54,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:54,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [103] total 103 [2018-07-25 13:22:54,598 INFO L451 AbstractCegarLoop]: Interpolant automaton has 104 states [2018-07-25 13:22:54,599 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 104 interpolants. [2018-07-25 13:22:54,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:22:54,599 INFO L87 Difference]: Start difference. First operand 207 states and 207 transitions. Second operand 104 states. [2018-07-25 13:22:56,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:56,383 INFO L93 Difference]: Finished difference Result 211 states and 211 transitions. [2018-07-25 13:22:56,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 104 states. [2018-07-25 13:22:56,383 INFO L78 Accepts]: Start accepts. Automaton has 104 states. Word has length 206 [2018-07-25 13:22:56,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:56,384 INFO L225 Difference]: With dead ends: 211 [2018-07-25 13:22:56,384 INFO L226 Difference]: Without dead ends: 209 [2018-07-25 13:22:56,385 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 102 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=205, Invalid=10507, Unknown=0, NotChecked=0, Total=10712 [2018-07-25 13:22:56,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2018-07-25 13:22:56,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2018-07-25 13:22:56,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2018-07-25 13:22:56,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 209 transitions. [2018-07-25 13:22:56,455 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 209 transitions. Word has length 206 [2018-07-25 13:22:56,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:56,455 INFO L472 AbstractCegarLoop]: Abstraction has 209 states and 209 transitions. [2018-07-25 13:22:56,455 INFO L473 AbstractCegarLoop]: Interpolant automaton has 104 states. [2018-07-25 13:22:56,455 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 209 transitions. [2018-07-25 13:22:56,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2018-07-25 13:22:56,456 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:56,456 INFO L354 BasicCegarLoop]: trace histogram [103, 102, 1, 1, 1] [2018-07-25 13:22:56,456 INFO L415 AbstractCegarLoop]: === Iteration 103 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:56,457 INFO L82 PathProgramCache]: Analyzing trace with hash 2023340909, now seen corresponding path program 102 times [2018-07-25 13:22:56,457 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:22:57,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10506 backedges. 0 proven. 10506 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:22:57,598 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:22:57,598 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [104] total 104 [2018-07-25 13:22:57,598 INFO L451 AbstractCegarLoop]: Interpolant automaton has 105 states [2018-07-25 13:22:57,598 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 105 interpolants. [2018-07-25 13:22:57,599 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:22:57,599 INFO L87 Difference]: Start difference. First operand 209 states and 209 transitions. Second operand 105 states. [2018-07-25 13:22:59,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:22:59,366 INFO L93 Difference]: Finished difference Result 213 states and 213 transitions. [2018-07-25 13:22:59,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 105 states. [2018-07-25 13:22:59,367 INFO L78 Accepts]: Start accepts. Automaton has 105 states. Word has length 208 [2018-07-25 13:22:59,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:22:59,367 INFO L225 Difference]: With dead ends: 213 [2018-07-25 13:22:59,368 INFO L226 Difference]: Without dead ends: 211 [2018-07-25 13:22:59,368 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 103 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=207, Invalid=10713, Unknown=0, NotChecked=0, Total=10920 [2018-07-25 13:22:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2018-07-25 13:22:59,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 211. [2018-07-25 13:22:59,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 211 states. [2018-07-25 13:22:59,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 211 states to 211 states and 211 transitions. [2018-07-25 13:22:59,443 INFO L78 Accepts]: Start accepts. Automaton has 211 states and 211 transitions. Word has length 208 [2018-07-25 13:22:59,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:22:59,443 INFO L472 AbstractCegarLoop]: Abstraction has 211 states and 211 transitions. [2018-07-25 13:22:59,443 INFO L473 AbstractCegarLoop]: Interpolant automaton has 105 states. [2018-07-25 13:22:59,444 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 211 transitions. [2018-07-25 13:22:59,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2018-07-25 13:22:59,444 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:22:59,445 INFO L354 BasicCegarLoop]: trace histogram [104, 103, 1, 1, 1] [2018-07-25 13:22:59,445 INFO L415 AbstractCegarLoop]: === Iteration 104 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:22:59,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1189638551, now seen corresponding path program 103 times [2018-07-25 13:22:59,445 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:22:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 10712 backedges. 0 proven. 10712 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:00,602 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:00,602 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [105] total 105 [2018-07-25 13:23:00,602 INFO L451 AbstractCegarLoop]: Interpolant automaton has 106 states [2018-07-25 13:23:00,603 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2018-07-25 13:23:00,603 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:23:00,604 INFO L87 Difference]: Start difference. First operand 211 states and 211 transitions. Second operand 106 states. [2018-07-25 13:23:02,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:02,255 INFO L93 Difference]: Finished difference Result 215 states and 215 transitions. [2018-07-25 13:23:02,255 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 106 states. [2018-07-25 13:23:02,255 INFO L78 Accepts]: Start accepts. Automaton has 106 states. Word has length 210 [2018-07-25 13:23:02,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:02,256 INFO L225 Difference]: With dead ends: 215 [2018-07-25 13:23:02,256 INFO L226 Difference]: Without dead ends: 213 [2018-07-25 13:23:02,257 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 104 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=209, Invalid=10921, Unknown=0, NotChecked=0, Total=11130 [2018-07-25 13:23:02,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2018-07-25 13:23:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 213. [2018-07-25 13:23:02,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 213 states. [2018-07-25 13:23:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 213 transitions. [2018-07-25 13:23:02,349 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 213 transitions. Word has length 210 [2018-07-25 13:23:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:02,349 INFO L472 AbstractCegarLoop]: Abstraction has 213 states and 213 transitions. [2018-07-25 13:23:02,349 INFO L473 AbstractCegarLoop]: Interpolant automaton has 106 states. [2018-07-25 13:23:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 213 transitions. [2018-07-25 13:23:02,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2018-07-25 13:23:02,351 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:02,351 INFO L354 BasicCegarLoop]: trace histogram [105, 104, 1, 1, 1] [2018-07-25 13:23:02,351 INFO L415 AbstractCegarLoop]: === Iteration 105 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:02,351 INFO L82 PathProgramCache]: Analyzing trace with hash -781413787, now seen corresponding path program 104 times [2018-07-25 13:23:02,351 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:02,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:03,545 INFO L134 CoverageAnalysis]: Checked inductivity of 10920 backedges. 0 proven. 10920 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:03,545 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:03,546 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2018-07-25 13:23:03,546 INFO L451 AbstractCegarLoop]: Interpolant automaton has 107 states [2018-07-25 13:23:03,546 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2018-07-25 13:23:03,547 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:23:03,547 INFO L87 Difference]: Start difference. First operand 213 states and 213 transitions. Second operand 107 states. [2018-07-25 13:23:05,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:05,377 INFO L93 Difference]: Finished difference Result 217 states and 217 transitions. [2018-07-25 13:23:05,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2018-07-25 13:23:05,377 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 212 [2018-07-25 13:23:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:05,378 INFO L225 Difference]: With dead ends: 217 [2018-07-25 13:23:05,378 INFO L226 Difference]: Without dead ends: 215 [2018-07-25 13:23:05,379 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=211, Invalid=11131, Unknown=0, NotChecked=0, Total=11342 [2018-07-25 13:23:05,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2018-07-25 13:23:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 215. [2018-07-25 13:23:05,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 215 states. [2018-07-25 13:23:05,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 215 states to 215 states and 215 transitions. [2018-07-25 13:23:05,453 INFO L78 Accepts]: Start accepts. Automaton has 215 states and 215 transitions. Word has length 212 [2018-07-25 13:23:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:05,453 INFO L472 AbstractCegarLoop]: Abstraction has 215 states and 215 transitions. [2018-07-25 13:23:05,453 INFO L473 AbstractCegarLoop]: Interpolant automaton has 107 states. [2018-07-25 13:23:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 215 states and 215 transitions. [2018-07-25 13:23:05,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2018-07-25 13:23:05,454 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:05,454 INFO L354 BasicCegarLoop]: trace histogram [106, 105, 1, 1, 1] [2018-07-25 13:23:05,454 INFO L415 AbstractCegarLoop]: === Iteration 106 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:05,455 INFO L82 PathProgramCache]: Analyzing trace with hash 680560481, now seen corresponding path program 105 times [2018-07-25 13:23:05,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:06,625 INFO L134 CoverageAnalysis]: Checked inductivity of 11130 backedges. 0 proven. 11130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:06,625 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:06,625 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [107] total 107 [2018-07-25 13:23:06,626 INFO L451 AbstractCegarLoop]: Interpolant automaton has 108 states [2018-07-25 13:23:06,626 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 108 interpolants. [2018-07-25 13:23:06,627 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:23:06,627 INFO L87 Difference]: Start difference. First operand 215 states and 215 transitions. Second operand 108 states. [2018-07-25 13:23:08,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:08,507 INFO L93 Difference]: Finished difference Result 219 states and 219 transitions. [2018-07-25 13:23:08,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 108 states. [2018-07-25 13:23:08,508 INFO L78 Accepts]: Start accepts. Automaton has 108 states. Word has length 214 [2018-07-25 13:23:08,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:08,509 INFO L225 Difference]: With dead ends: 219 [2018-07-25 13:23:08,509 INFO L226 Difference]: Without dead ends: 217 [2018-07-25 13:23:08,510 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 106 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=213, Invalid=11343, Unknown=0, NotChecked=0, Total=11556 [2018-07-25 13:23:08,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217 states. [2018-07-25 13:23:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217 to 217. [2018-07-25 13:23:08,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 217 states. [2018-07-25 13:23:08,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 217 transitions. [2018-07-25 13:23:08,610 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 217 transitions. Word has length 214 [2018-07-25 13:23:08,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:08,610 INFO L472 AbstractCegarLoop]: Abstraction has 217 states and 217 transitions. [2018-07-25 13:23:08,610 INFO L473 AbstractCegarLoop]: Interpolant automaton has 108 states. [2018-07-25 13:23:08,610 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 217 transitions. [2018-07-25 13:23:08,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2018-07-25 13:23:08,611 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:08,611 INFO L354 BasicCegarLoop]: trace histogram [107, 106, 1, 1, 1] [2018-07-25 13:23:08,611 INFO L415 AbstractCegarLoop]: === Iteration 107 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:08,611 INFO L82 PathProgramCache]: Analyzing trace with hash 1183526237, now seen corresponding path program 106 times [2018-07-25 13:23:08,611 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:08,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:09,813 INFO L134 CoverageAnalysis]: Checked inductivity of 11342 backedges. 0 proven. 11342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:09,814 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:09,814 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [108] total 108 [2018-07-25 13:23:09,814 INFO L451 AbstractCegarLoop]: Interpolant automaton has 109 states [2018-07-25 13:23:09,814 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 109 interpolants. [2018-07-25 13:23:09,815 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:23:09,815 INFO L87 Difference]: Start difference. First operand 217 states and 217 transitions. Second operand 109 states. [2018-07-25 13:23:11,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:11,753 INFO L93 Difference]: Finished difference Result 221 states and 221 transitions. [2018-07-25 13:23:11,753 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 109 states. [2018-07-25 13:23:11,753 INFO L78 Accepts]: Start accepts. Automaton has 109 states. Word has length 216 [2018-07-25 13:23:11,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:11,754 INFO L225 Difference]: With dead ends: 221 [2018-07-25 13:23:11,754 INFO L226 Difference]: Without dead ends: 219 [2018-07-25 13:23:11,755 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 107 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=215, Invalid=11557, Unknown=0, NotChecked=0, Total=11772 [2018-07-25 13:23:11,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2018-07-25 13:23:11,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2018-07-25 13:23:11,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 219 states. [2018-07-25 13:23:11,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 219 transitions. [2018-07-25 13:23:11,833 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 219 transitions. Word has length 216 [2018-07-25 13:23:11,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:11,834 INFO L472 AbstractCegarLoop]: Abstraction has 219 states and 219 transitions. [2018-07-25 13:23:11,834 INFO L473 AbstractCegarLoop]: Interpolant automaton has 109 states. [2018-07-25 13:23:11,834 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 219 transitions. [2018-07-25 13:23:11,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2018-07-25 13:23:11,834 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:11,834 INFO L354 BasicCegarLoop]: trace histogram [108, 107, 1, 1, 1] [2018-07-25 13:23:11,835 INFO L415 AbstractCegarLoop]: === Iteration 108 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:11,835 INFO L82 PathProgramCache]: Analyzing trace with hash -797686695, now seen corresponding path program 107 times [2018-07-25 13:23:11,835 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:12,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:13,106 INFO L134 CoverageAnalysis]: Checked inductivity of 11556 backedges. 0 proven. 11556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:13,106 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:13,107 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [109] total 109 [2018-07-25 13:23:13,107 INFO L451 AbstractCegarLoop]: Interpolant automaton has 110 states [2018-07-25 13:23:13,107 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 110 interpolants. [2018-07-25 13:23:13,108 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:23:13,108 INFO L87 Difference]: Start difference. First operand 219 states and 219 transitions. Second operand 110 states. [2018-07-25 13:23:15,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:15,043 INFO L93 Difference]: Finished difference Result 223 states and 223 transitions. [2018-07-25 13:23:15,043 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 110 states. [2018-07-25 13:23:15,043 INFO L78 Accepts]: Start accepts. Automaton has 110 states. Word has length 218 [2018-07-25 13:23:15,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:15,044 INFO L225 Difference]: With dead ends: 223 [2018-07-25 13:23:15,044 INFO L226 Difference]: Without dead ends: 221 [2018-07-25 13:23:15,045 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 108 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=217, Invalid=11773, Unknown=0, NotChecked=0, Total=11990 [2018-07-25 13:23:15,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2018-07-25 13:23:15,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 221. [2018-07-25 13:23:15,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 221 states. [2018-07-25 13:23:15,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 221 transitions. [2018-07-25 13:23:15,127 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 221 transitions. Word has length 218 [2018-07-25 13:23:15,128 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:15,128 INFO L472 AbstractCegarLoop]: Abstraction has 221 states and 221 transitions. [2018-07-25 13:23:15,128 INFO L473 AbstractCegarLoop]: Interpolant automaton has 110 states. [2018-07-25 13:23:15,128 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 221 transitions. [2018-07-25 13:23:15,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2018-07-25 13:23:15,129 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:15,129 INFO L354 BasicCegarLoop]: trace histogram [109, 108, 1, 1, 1] [2018-07-25 13:23:15,129 INFO L415 AbstractCegarLoop]: === Iteration 109 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:15,129 INFO L82 PathProgramCache]: Analyzing trace with hash -2072802219, now seen corresponding path program 108 times [2018-07-25 13:23:15,129 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:15,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:16,437 INFO L134 CoverageAnalysis]: Checked inductivity of 11772 backedges. 0 proven. 11772 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:16,437 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:16,437 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [110] total 110 [2018-07-25 13:23:16,437 INFO L451 AbstractCegarLoop]: Interpolant automaton has 111 states [2018-07-25 13:23:16,438 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 111 interpolants. [2018-07-25 13:23:16,438 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:23:16,438 INFO L87 Difference]: Start difference. First operand 221 states and 221 transitions. Second operand 111 states. [2018-07-25 13:23:18,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:18,363 INFO L93 Difference]: Finished difference Result 225 states and 225 transitions. [2018-07-25 13:23:18,363 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 111 states. [2018-07-25 13:23:18,363 INFO L78 Accepts]: Start accepts. Automaton has 111 states. Word has length 220 [2018-07-25 13:23:18,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:18,364 INFO L225 Difference]: With dead ends: 225 [2018-07-25 13:23:18,364 INFO L226 Difference]: Without dead ends: 223 [2018-07-25 13:23:18,364 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 109 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=219, Invalid=11991, Unknown=0, NotChecked=0, Total=12210 [2018-07-25 13:23:18,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2018-07-25 13:23:18,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 223. [2018-07-25 13:23:18,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 223 states. [2018-07-25 13:23:18,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 223 states to 223 states and 223 transitions. [2018-07-25 13:23:18,460 INFO L78 Accepts]: Start accepts. Automaton has 223 states and 223 transitions. Word has length 220 [2018-07-25 13:23:18,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:18,461 INFO L472 AbstractCegarLoop]: Abstraction has 223 states and 223 transitions. [2018-07-25 13:23:18,461 INFO L473 AbstractCegarLoop]: Interpolant automaton has 111 states. [2018-07-25 13:23:18,461 INFO L276 IsEmpty]: Start isEmpty. Operand 223 states and 223 transitions. [2018-07-25 13:23:18,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2018-07-25 13:23:18,462 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:18,462 INFO L354 BasicCegarLoop]: trace histogram [110, 109, 1, 1, 1] [2018-07-25 13:23:18,462 INFO L415 AbstractCegarLoop]: === Iteration 110 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:18,462 INFO L82 PathProgramCache]: Analyzing trace with hash 901825873, now seen corresponding path program 109 times [2018-07-25 13:23:18,462 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:18,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:19,761 INFO L134 CoverageAnalysis]: Checked inductivity of 11990 backedges. 0 proven. 11990 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:19,761 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:19,761 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [111] total 111 [2018-07-25 13:23:19,761 INFO L451 AbstractCegarLoop]: Interpolant automaton has 112 states [2018-07-25 13:23:19,762 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 112 interpolants. [2018-07-25 13:23:19,762 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:23:19,763 INFO L87 Difference]: Start difference. First operand 223 states and 223 transitions. Second operand 112 states. [2018-07-25 13:23:21,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:21,700 INFO L93 Difference]: Finished difference Result 227 states and 227 transitions. [2018-07-25 13:23:21,700 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 112 states. [2018-07-25 13:23:21,700 INFO L78 Accepts]: Start accepts. Automaton has 112 states. Word has length 222 [2018-07-25 13:23:21,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:21,701 INFO L225 Difference]: With dead ends: 227 [2018-07-25 13:23:21,701 INFO L226 Difference]: Without dead ends: 225 [2018-07-25 13:23:21,702 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=221, Invalid=12211, Unknown=0, NotChecked=0, Total=12432 [2018-07-25 13:23:21,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2018-07-25 13:23:21,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 225. [2018-07-25 13:23:21,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 225 states. [2018-07-25 13:23:21,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 225 transitions. [2018-07-25 13:23:21,785 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 225 transitions. Word has length 222 [2018-07-25 13:23:21,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:21,785 INFO L472 AbstractCegarLoop]: Abstraction has 225 states and 225 transitions. [2018-07-25 13:23:21,785 INFO L473 AbstractCegarLoop]: Interpolant automaton has 112 states. [2018-07-25 13:23:21,786 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 225 transitions. [2018-07-25 13:23:21,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2018-07-25 13:23:21,786 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:21,786 INFO L354 BasicCegarLoop]: trace histogram [111, 110, 1, 1, 1] [2018-07-25 13:23:21,787 INFO L415 AbstractCegarLoop]: === Iteration 111 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:21,787 INFO L82 PathProgramCache]: Analyzing trace with hash -928796851, now seen corresponding path program 110 times [2018-07-25 13:23:21,787 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:22,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:23,100 INFO L134 CoverageAnalysis]: Checked inductivity of 12210 backedges. 0 proven. 12210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:23,100 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:23,101 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [112] total 112 [2018-07-25 13:23:23,101 INFO L451 AbstractCegarLoop]: Interpolant automaton has 113 states [2018-07-25 13:23:23,101 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 113 interpolants. [2018-07-25 13:23:23,102 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:23:23,102 INFO L87 Difference]: Start difference. First operand 225 states and 225 transitions. Second operand 113 states. [2018-07-25 13:23:25,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:25,093 INFO L93 Difference]: Finished difference Result 229 states and 229 transitions. [2018-07-25 13:23:25,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:23:25,094 INFO L78 Accepts]: Start accepts. Automaton has 113 states. Word has length 224 [2018-07-25 13:23:25,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:25,094 INFO L225 Difference]: With dead ends: 229 [2018-07-25 13:23:25,094 INFO L226 Difference]: Without dead ends: 227 [2018-07-25 13:23:25,095 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=223, Invalid=12433, Unknown=0, NotChecked=0, Total=12656 [2018-07-25 13:23:25,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2018-07-25 13:23:25,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 227. [2018-07-25 13:23:25,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 227 states. [2018-07-25 13:23:25,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 227 transitions. [2018-07-25 13:23:25,179 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 227 transitions. Word has length 224 [2018-07-25 13:23:25,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:25,180 INFO L472 AbstractCegarLoop]: Abstraction has 227 states and 227 transitions. [2018-07-25 13:23:25,180 INFO L473 AbstractCegarLoop]: Interpolant automaton has 113 states. [2018-07-25 13:23:25,180 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 227 transitions. [2018-07-25 13:23:25,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2018-07-25 13:23:25,180 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:25,180 INFO L354 BasicCegarLoop]: trace histogram [112, 111, 1, 1, 1] [2018-07-25 13:23:25,181 INFO L415 AbstractCegarLoop]: === Iteration 112 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:25,181 INFO L82 PathProgramCache]: Analyzing trace with hash 779356745, now seen corresponding path program 111 times [2018-07-25 13:23:25,181 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:25,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 12432 backedges. 0 proven. 12432 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:26,488 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:26,488 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [113] total 113 [2018-07-25 13:23:26,488 INFO L451 AbstractCegarLoop]: Interpolant automaton has 114 states [2018-07-25 13:23:26,488 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 114 interpolants. [2018-07-25 13:23:26,489 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:23:26,489 INFO L87 Difference]: Start difference. First operand 227 states and 227 transitions. Second operand 114 states. [2018-07-25 13:23:28,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:28,497 INFO L93 Difference]: Finished difference Result 231 states and 231 transitions. [2018-07-25 13:23:28,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 114 states. [2018-07-25 13:23:28,497 INFO L78 Accepts]: Start accepts. Automaton has 114 states. Word has length 226 [2018-07-25 13:23:28,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:28,498 INFO L225 Difference]: With dead ends: 231 [2018-07-25 13:23:28,498 INFO L226 Difference]: Without dead ends: 229 [2018-07-25 13:23:28,499 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 112 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=225, Invalid=12657, Unknown=0, NotChecked=0, Total=12882 [2018-07-25 13:23:28,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2018-07-25 13:23:28,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 229. [2018-07-25 13:23:28,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 229 states. [2018-07-25 13:23:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 229 transitions. [2018-07-25 13:23:28,585 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 229 transitions. Word has length 226 [2018-07-25 13:23:28,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:28,585 INFO L472 AbstractCegarLoop]: Abstraction has 229 states and 229 transitions. [2018-07-25 13:23:28,585 INFO L473 AbstractCegarLoop]: Interpolant automaton has 114 states. [2018-07-25 13:23:28,585 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 229 transitions. [2018-07-25 13:23:28,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2018-07-25 13:23:28,586 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:28,586 INFO L354 BasicCegarLoop]: trace histogram [113, 112, 1, 1, 1] [2018-07-25 13:23:28,586 INFO L415 AbstractCegarLoop]: === Iteration 113 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:28,587 INFO L82 PathProgramCache]: Analyzing trace with hash 1637455429, now seen corresponding path program 112 times [2018-07-25 13:23:28,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:28,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:29,922 INFO L134 CoverageAnalysis]: Checked inductivity of 12656 backedges. 0 proven. 12656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:29,922 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:29,922 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2018-07-25 13:23:29,922 INFO L451 AbstractCegarLoop]: Interpolant automaton has 115 states [2018-07-25 13:23:29,923 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2018-07-25 13:23:29,923 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:23:29,924 INFO L87 Difference]: Start difference. First operand 229 states and 229 transitions. Second operand 115 states. [2018-07-25 13:23:31,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:31,986 INFO L93 Difference]: Finished difference Result 233 states and 233 transitions. [2018-07-25 13:23:31,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2018-07-25 13:23:31,986 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 228 [2018-07-25 13:23:31,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:31,987 INFO L225 Difference]: With dead ends: 233 [2018-07-25 13:23:31,987 INFO L226 Difference]: Without dead ends: 231 [2018-07-25 13:23:31,988 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=227, Invalid=12883, Unknown=0, NotChecked=0, Total=13110 [2018-07-25 13:23:31,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2018-07-25 13:23:32,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 231. [2018-07-25 13:23:32,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 231 states. [2018-07-25 13:23:32,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 231 states to 231 states and 231 transitions. [2018-07-25 13:23:32,093 INFO L78 Accepts]: Start accepts. Automaton has 231 states and 231 transitions. Word has length 228 [2018-07-25 13:23:32,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:32,094 INFO L472 AbstractCegarLoop]: Abstraction has 231 states and 231 transitions. [2018-07-25 13:23:32,094 INFO L473 AbstractCegarLoop]: Interpolant automaton has 115 states. [2018-07-25 13:23:32,094 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 231 transitions. [2018-07-25 13:23:32,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2018-07-25 13:23:32,095 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:32,095 INFO L354 BasicCegarLoop]: trace histogram [114, 113, 1, 1, 1] [2018-07-25 13:23:32,095 INFO L415 AbstractCegarLoop]: === Iteration 114 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:32,095 INFO L82 PathProgramCache]: Analyzing trace with hash 1636569921, now seen corresponding path program 113 times [2018-07-25 13:23:32,095 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:32,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:33,543 INFO L134 CoverageAnalysis]: Checked inductivity of 12882 backedges. 0 proven. 12882 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:33,544 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:33,544 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [115] total 115 [2018-07-25 13:23:33,544 INFO L451 AbstractCegarLoop]: Interpolant automaton has 116 states [2018-07-25 13:23:33,544 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 116 interpolants. [2018-07-25 13:23:33,545 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:23:33,545 INFO L87 Difference]: Start difference. First operand 231 states and 231 transitions. Second operand 116 states. [2018-07-25 13:23:35,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:35,681 INFO L93 Difference]: Finished difference Result 235 states and 235 transitions. [2018-07-25 13:23:35,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 116 states. [2018-07-25 13:23:35,681 INFO L78 Accepts]: Start accepts. Automaton has 116 states. Word has length 230 [2018-07-25 13:23:35,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:35,682 INFO L225 Difference]: With dead ends: 235 [2018-07-25 13:23:35,682 INFO L226 Difference]: Without dead ends: 233 [2018-07-25 13:23:35,683 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 114 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=229, Invalid=13111, Unknown=0, NotChecked=0, Total=13340 [2018-07-25 13:23:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2018-07-25 13:23:35,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 233. [2018-07-25 13:23:35,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 233 states. [2018-07-25 13:23:35,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 233 states to 233 states and 233 transitions. [2018-07-25 13:23:35,772 INFO L78 Accepts]: Start accepts. Automaton has 233 states and 233 transitions. Word has length 230 [2018-07-25 13:23:35,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:35,773 INFO L472 AbstractCegarLoop]: Abstraction has 233 states and 233 transitions. [2018-07-25 13:23:35,773 INFO L473 AbstractCegarLoop]: Interpolant automaton has 116 states. [2018-07-25 13:23:35,773 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 233 transitions. [2018-07-25 13:23:35,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2018-07-25 13:23:35,773 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:35,773 INFO L354 BasicCegarLoop]: trace histogram [115, 114, 1, 1, 1] [2018-07-25 13:23:35,774 INFO L415 AbstractCegarLoop]: === Iteration 115 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:35,774 INFO L82 PathProgramCache]: Analyzing trace with hash 785596733, now seen corresponding path program 114 times [2018-07-25 13:23:35,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:36,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:37,270 INFO L134 CoverageAnalysis]: Checked inductivity of 13110 backedges. 0 proven. 13110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:37,270 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:37,270 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [116] total 116 [2018-07-25 13:23:37,270 INFO L451 AbstractCegarLoop]: Interpolant automaton has 117 states [2018-07-25 13:23:37,271 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 117 interpolants. [2018-07-25 13:23:37,271 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:23:37,272 INFO L87 Difference]: Start difference. First operand 233 states and 233 transitions. Second operand 117 states. [2018-07-25 13:23:39,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:39,494 INFO L93 Difference]: Finished difference Result 237 states and 237 transitions. [2018-07-25 13:23:39,494 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 117 states. [2018-07-25 13:23:39,494 INFO L78 Accepts]: Start accepts. Automaton has 117 states. Word has length 232 [2018-07-25 13:23:39,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:39,495 INFO L225 Difference]: With dead ends: 237 [2018-07-25 13:23:39,495 INFO L226 Difference]: Without dead ends: 235 [2018-07-25 13:23:39,496 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 115 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=231, Invalid=13341, Unknown=0, NotChecked=0, Total=13572 [2018-07-25 13:23:39,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2018-07-25 13:23:39,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2018-07-25 13:23:39,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 235 states. [2018-07-25 13:23:39,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 235 transitions. [2018-07-25 13:23:39,585 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 235 transitions. Word has length 232 [2018-07-25 13:23:39,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:39,586 INFO L472 AbstractCegarLoop]: Abstraction has 235 states and 235 transitions. [2018-07-25 13:23:39,586 INFO L473 AbstractCegarLoop]: Interpolant automaton has 117 states. [2018-07-25 13:23:39,586 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 235 transitions. [2018-07-25 13:23:39,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2018-07-25 13:23:39,586 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:39,587 INFO L354 BasicCegarLoop]: trace histogram [116, 115, 1, 1, 1] [2018-07-25 13:23:39,587 INFO L415 AbstractCegarLoop]: === Iteration 116 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:39,587 INFO L82 PathProgramCache]: Analyzing trace with hash -955850695, now seen corresponding path program 115 times [2018-07-25 13:23:39,587 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:39,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:41,044 INFO L134 CoverageAnalysis]: Checked inductivity of 13340 backedges. 0 proven. 13340 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:41,044 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:41,044 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [117] total 117 [2018-07-25 13:23:41,045 INFO L451 AbstractCegarLoop]: Interpolant automaton has 118 states [2018-07-25 13:23:41,045 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 118 interpolants. [2018-07-25 13:23:41,045 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:23:41,045 INFO L87 Difference]: Start difference. First operand 235 states and 235 transitions. Second operand 118 states. [2018-07-25 13:23:43,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:43,316 INFO L93 Difference]: Finished difference Result 239 states and 239 transitions. [2018-07-25 13:23:43,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 118 states. [2018-07-25 13:23:43,316 INFO L78 Accepts]: Start accepts. Automaton has 118 states. Word has length 234 [2018-07-25 13:23:43,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:43,317 INFO L225 Difference]: With dead ends: 239 [2018-07-25 13:23:43,317 INFO L226 Difference]: Without dead ends: 237 [2018-07-25 13:23:43,318 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=233, Invalid=13573, Unknown=0, NotChecked=0, Total=13806 [2018-07-25 13:23:43,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 237 states. [2018-07-25 13:23:43,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 237 to 237. [2018-07-25 13:23:43,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 237 states. [2018-07-25 13:23:43,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 237 states to 237 states and 237 transitions. [2018-07-25 13:23:43,408 INFO L78 Accepts]: Start accepts. Automaton has 237 states and 237 transitions. Word has length 234 [2018-07-25 13:23:43,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:43,408 INFO L472 AbstractCegarLoop]: Abstraction has 237 states and 237 transitions. [2018-07-25 13:23:43,409 INFO L473 AbstractCegarLoop]: Interpolant automaton has 118 states. [2018-07-25 13:23:43,409 INFO L276 IsEmpty]: Start isEmpty. Operand 237 states and 237 transitions. [2018-07-25 13:23:43,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2018-07-25 13:23:43,409 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:43,409 INFO L354 BasicCegarLoop]: trace histogram [117, 116, 1, 1, 1] [2018-07-25 13:23:43,409 INFO L415 AbstractCegarLoop]: === Iteration 117 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:43,410 INFO L82 PathProgramCache]: Analyzing trace with hash 550416437, now seen corresponding path program 116 times [2018-07-25 13:23:43,410 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:43,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:44,912 INFO L134 CoverageAnalysis]: Checked inductivity of 13572 backedges. 0 proven. 13572 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:44,912 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:44,912 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [118] total 118 [2018-07-25 13:23:44,912 INFO L451 AbstractCegarLoop]: Interpolant automaton has 119 states [2018-07-25 13:23:44,913 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 119 interpolants. [2018-07-25 13:23:44,913 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:23:44,913 INFO L87 Difference]: Start difference. First operand 237 states and 237 transitions. Second operand 119 states. [2018-07-25 13:23:47,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:47,149 INFO L93 Difference]: Finished difference Result 241 states and 241 transitions. [2018-07-25 13:23:47,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 119 states. [2018-07-25 13:23:47,149 INFO L78 Accepts]: Start accepts. Automaton has 119 states. Word has length 236 [2018-07-25 13:23:47,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:47,149 INFO L225 Difference]: With dead ends: 241 [2018-07-25 13:23:47,150 INFO L226 Difference]: Without dead ends: 239 [2018-07-25 13:23:47,150 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=235, Invalid=13807, Unknown=0, NotChecked=0, Total=14042 [2018-07-25 13:23:47,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2018-07-25 13:23:47,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 239. [2018-07-25 13:23:47,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 239 states. [2018-07-25 13:23:47,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 239 transitions. [2018-07-25 13:23:47,244 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 239 transitions. Word has length 236 [2018-07-25 13:23:47,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:47,244 INFO L472 AbstractCegarLoop]: Abstraction has 239 states and 239 transitions. [2018-07-25 13:23:47,244 INFO L473 AbstractCegarLoop]: Interpolant automaton has 119 states. [2018-07-25 13:23:47,244 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 239 transitions. [2018-07-25 13:23:47,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2018-07-25 13:23:47,245 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:47,245 INFO L354 BasicCegarLoop]: trace histogram [118, 117, 1, 1, 1] [2018-07-25 13:23:47,245 INFO L415 AbstractCegarLoop]: === Iteration 118 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:47,245 INFO L82 PathProgramCache]: Analyzing trace with hash 669151537, now seen corresponding path program 117 times [2018-07-25 13:23:47,245 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:47,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:48,847 INFO L134 CoverageAnalysis]: Checked inductivity of 13806 backedges. 0 proven. 13806 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:48,847 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:48,847 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [119] total 119 [2018-07-25 13:23:48,848 INFO L451 AbstractCegarLoop]: Interpolant automaton has 120 states [2018-07-25 13:23:48,848 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 120 interpolants. [2018-07-25 13:23:48,849 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:23:48,849 INFO L87 Difference]: Start difference. First operand 239 states and 239 transitions. Second operand 120 states. [2018-07-25 13:23:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:51,007 INFO L93 Difference]: Finished difference Result 243 states and 243 transitions. [2018-07-25 13:23:51,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 120 states. [2018-07-25 13:23:51,007 INFO L78 Accepts]: Start accepts. Automaton has 120 states. Word has length 238 [2018-07-25 13:23:51,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:51,008 INFO L225 Difference]: With dead ends: 243 [2018-07-25 13:23:51,008 INFO L226 Difference]: Without dead ends: 241 [2018-07-25 13:23:51,008 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 118 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=237, Invalid=14043, Unknown=0, NotChecked=0, Total=14280 [2018-07-25 13:23:51,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2018-07-25 13:23:51,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2018-07-25 13:23:51,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 241 states. [2018-07-25 13:23:51,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 241 transitions. [2018-07-25 13:23:51,102 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 241 transitions. Word has length 238 [2018-07-25 13:23:51,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:51,102 INFO L472 AbstractCegarLoop]: Abstraction has 241 states and 241 transitions. [2018-07-25 13:23:51,102 INFO L473 AbstractCegarLoop]: Interpolant automaton has 120 states. [2018-07-25 13:23:51,102 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 241 transitions. [2018-07-25 13:23:51,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 241 [2018-07-25 13:23:51,103 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:51,103 INFO L354 BasicCegarLoop]: trace histogram [119, 118, 1, 1, 1] [2018-07-25 13:23:51,103 INFO L415 AbstractCegarLoop]: === Iteration 119 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:51,103 INFO L82 PathProgramCache]: Analyzing trace with hash -1190534355, now seen corresponding path program 118 times [2018-07-25 13:23:51,103 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:51,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:52,692 INFO L134 CoverageAnalysis]: Checked inductivity of 14042 backedges. 0 proven. 14042 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:52,693 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:52,693 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [120] total 120 [2018-07-25 13:23:52,693 INFO L451 AbstractCegarLoop]: Interpolant automaton has 121 states [2018-07-25 13:23:52,694 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 121 interpolants. [2018-07-25 13:23:52,694 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:23:52,694 INFO L87 Difference]: Start difference. First operand 241 states and 241 transitions. Second operand 121 states. [2018-07-25 13:23:54,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:54,933 INFO L93 Difference]: Finished difference Result 245 states and 245 transitions. [2018-07-25 13:23:54,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 121 states. [2018-07-25 13:23:54,933 INFO L78 Accepts]: Start accepts. Automaton has 121 states. Word has length 240 [2018-07-25 13:23:54,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:54,934 INFO L225 Difference]: With dead ends: 245 [2018-07-25 13:23:54,934 INFO L226 Difference]: Without dead ends: 243 [2018-07-25 13:23:54,935 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=239, Invalid=14281, Unknown=0, NotChecked=0, Total=14520 [2018-07-25 13:23:54,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2018-07-25 13:23:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2018-07-25 13:23:55,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 243 states. [2018-07-25 13:23:55,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 243 transitions. [2018-07-25 13:23:55,031 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 243 transitions. Word has length 240 [2018-07-25 13:23:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:55,031 INFO L472 AbstractCegarLoop]: Abstraction has 243 states and 243 transitions. [2018-07-25 13:23:55,032 INFO L473 AbstractCegarLoop]: Interpolant automaton has 121 states. [2018-07-25 13:23:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 243 transitions. [2018-07-25 13:23:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2018-07-25 13:23:55,032 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:55,032 INFO L354 BasicCegarLoop]: trace histogram [120, 119, 1, 1, 1] [2018-07-25 13:23:55,033 INFO L415 AbstractCegarLoop]: === Iteration 120 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:55,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1642281431, now seen corresponding path program 119 times [2018-07-25 13:23:55,033 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:23:56,667 INFO L134 CoverageAnalysis]: Checked inductivity of 14280 backedges. 0 proven. 14280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:23:56,668 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:23:56,668 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [121] total 121 [2018-07-25 13:23:56,668 INFO L451 AbstractCegarLoop]: Interpolant automaton has 122 states [2018-07-25 13:23:56,668 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 122 interpolants. [2018-07-25 13:23:56,669 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:23:56,669 INFO L87 Difference]: Start difference. First operand 243 states and 243 transitions. Second operand 122 states. [2018-07-25 13:23:59,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:23:59,019 INFO L93 Difference]: Finished difference Result 247 states and 247 transitions. [2018-07-25 13:23:59,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2018-07-25 13:23:59,019 INFO L78 Accepts]: Start accepts. Automaton has 122 states. Word has length 242 [2018-07-25 13:23:59,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:23:59,020 INFO L225 Difference]: With dead ends: 247 [2018-07-25 13:23:59,020 INFO L226 Difference]: Without dead ends: 245 [2018-07-25 13:23:59,021 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=241, Invalid=14521, Unknown=0, NotChecked=0, Total=14762 [2018-07-25 13:23:59,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2018-07-25 13:23:59,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 245. [2018-07-25 13:23:59,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 245 states. [2018-07-25 13:23:59,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 245 states to 245 states and 245 transitions. [2018-07-25 13:23:59,117 INFO L78 Accepts]: Start accepts. Automaton has 245 states and 245 transitions. Word has length 242 [2018-07-25 13:23:59,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:23:59,117 INFO L472 AbstractCegarLoop]: Abstraction has 245 states and 245 transitions. [2018-07-25 13:23:59,117 INFO L473 AbstractCegarLoop]: Interpolant automaton has 122 states. [2018-07-25 13:23:59,117 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 245 transitions. [2018-07-25 13:23:59,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2018-07-25 13:23:59,118 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:23:59,118 INFO L354 BasicCegarLoop]: trace histogram [121, 120, 1, 1, 1] [2018-07-25 13:23:59,118 INFO L415 AbstractCegarLoop]: === Iteration 121 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:23:59,119 INFO L82 PathProgramCache]: Analyzing trace with hash -1979524571, now seen corresponding path program 120 times [2018-07-25 13:23:59,119 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:23:59,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:00,777 INFO L134 CoverageAnalysis]: Checked inductivity of 14520 backedges. 0 proven. 14520 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:00,778 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:00,778 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2018-07-25 13:24:00,778 INFO L451 AbstractCegarLoop]: Interpolant automaton has 123 states [2018-07-25 13:24:00,778 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2018-07-25 13:24:00,779 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:24:00,779 INFO L87 Difference]: Start difference. First operand 245 states and 245 transitions. Second operand 123 states. [2018-07-25 13:24:03,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:03,179 INFO L93 Difference]: Finished difference Result 249 states and 249 transitions. [2018-07-25 13:24:03,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2018-07-25 13:24:03,179 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 244 [2018-07-25 13:24:03,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:03,180 INFO L225 Difference]: With dead ends: 249 [2018-07-25 13:24:03,180 INFO L226 Difference]: Without dead ends: 247 [2018-07-25 13:24:03,181 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=243, Invalid=14763, Unknown=0, NotChecked=0, Total=15006 [2018-07-25 13:24:03,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2018-07-25 13:24:03,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 247. [2018-07-25 13:24:03,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 247 states. [2018-07-25 13:24:03,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 247 transitions. [2018-07-25 13:24:03,280 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 247 transitions. Word has length 244 [2018-07-25 13:24:03,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:03,281 INFO L472 AbstractCegarLoop]: Abstraction has 247 states and 247 transitions. [2018-07-25 13:24:03,281 INFO L473 AbstractCegarLoop]: Interpolant automaton has 123 states. [2018-07-25 13:24:03,281 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 247 transitions. [2018-07-25 13:24:03,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2018-07-25 13:24:03,281 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:03,282 INFO L354 BasicCegarLoop]: trace histogram [122, 121, 1, 1, 1] [2018-07-25 13:24:03,282 INFO L415 AbstractCegarLoop]: === Iteration 122 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:03,282 INFO L82 PathProgramCache]: Analyzing trace with hash 347332385, now seen corresponding path program 121 times [2018-07-25 13:24:03,282 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:04,926 INFO L134 CoverageAnalysis]: Checked inductivity of 14762 backedges. 0 proven. 14762 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:04,927 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:04,927 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [123] total 123 [2018-07-25 13:24:04,927 INFO L451 AbstractCegarLoop]: Interpolant automaton has 124 states [2018-07-25 13:24:04,927 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 124 interpolants. [2018-07-25 13:24:04,928 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:24:04,928 INFO L87 Difference]: Start difference. First operand 247 states and 247 transitions. Second operand 124 states. [2018-07-25 13:24:07,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:07,218 INFO L93 Difference]: Finished difference Result 251 states and 251 transitions. [2018-07-25 13:24:07,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 124 states. [2018-07-25 13:24:07,218 INFO L78 Accepts]: Start accepts. Automaton has 124 states. Word has length 246 [2018-07-25 13:24:07,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:07,219 INFO L225 Difference]: With dead ends: 251 [2018-07-25 13:24:07,219 INFO L226 Difference]: Without dead ends: 249 [2018-07-25 13:24:07,220 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 122 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=245, Invalid=15007, Unknown=0, NotChecked=0, Total=15252 [2018-07-25 13:24:07,220 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2018-07-25 13:24:07,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 249. [2018-07-25 13:24:07,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 249 states. [2018-07-25 13:24:07,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 249 transitions. [2018-07-25 13:24:07,319 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 249 transitions. Word has length 246 [2018-07-25 13:24:07,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:07,319 INFO L472 AbstractCegarLoop]: Abstraction has 249 states and 249 transitions. [2018-07-25 13:24:07,319 INFO L473 AbstractCegarLoop]: Interpolant automaton has 124 states. [2018-07-25 13:24:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 249 transitions. [2018-07-25 13:24:07,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2018-07-25 13:24:07,320 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:07,320 INFO L354 BasicCegarLoop]: trace histogram [123, 122, 1, 1, 1] [2018-07-25 13:24:07,320 INFO L415 AbstractCegarLoop]: === Iteration 123 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:07,321 INFO L82 PathProgramCache]: Analyzing trace with hash -1221094115, now seen corresponding path program 122 times [2018-07-25 13:24:07,321 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:09,068 INFO L134 CoverageAnalysis]: Checked inductivity of 15006 backedges. 0 proven. 15006 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:09,068 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:09,068 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [124] total 124 [2018-07-25 13:24:09,068 INFO L451 AbstractCegarLoop]: Interpolant automaton has 125 states [2018-07-25 13:24:09,069 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 125 interpolants. [2018-07-25 13:24:09,069 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:24:09,070 INFO L87 Difference]: Start difference. First operand 249 states and 249 transitions. Second operand 125 states. [2018-07-25 13:24:11,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:11,589 INFO L93 Difference]: Finished difference Result 253 states and 253 transitions. [2018-07-25 13:24:11,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 125 states. [2018-07-25 13:24:11,589 INFO L78 Accepts]: Start accepts. Automaton has 125 states. Word has length 248 [2018-07-25 13:24:11,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:11,590 INFO L225 Difference]: With dead ends: 253 [2018-07-25 13:24:11,590 INFO L226 Difference]: Without dead ends: 251 [2018-07-25 13:24:11,592 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 123 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=15253, Unknown=0, NotChecked=0, Total=15500 [2018-07-25 13:24:11,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2018-07-25 13:24:11,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 251. [2018-07-25 13:24:11,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 251 states. [2018-07-25 13:24:11,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 251 transitions. [2018-07-25 13:24:11,695 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 251 transitions. Word has length 248 [2018-07-25 13:24:11,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:11,696 INFO L472 AbstractCegarLoop]: Abstraction has 251 states and 251 transitions. [2018-07-25 13:24:11,696 INFO L473 AbstractCegarLoop]: Interpolant automaton has 125 states. [2018-07-25 13:24:11,696 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 251 transitions. [2018-07-25 13:24:11,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2018-07-25 13:24:11,697 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:11,697 INFO L354 BasicCegarLoop]: trace histogram [124, 123, 1, 1, 1] [2018-07-25 13:24:11,697 INFO L415 AbstractCegarLoop]: === Iteration 124 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:11,697 INFO L82 PathProgramCache]: Analyzing trace with hash -945439719, now seen corresponding path program 123 times [2018-07-25 13:24:11,697 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:13,444 INFO L134 CoverageAnalysis]: Checked inductivity of 15252 backedges. 0 proven. 15252 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:13,444 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:13,444 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [125] total 125 [2018-07-25 13:24:13,444 INFO L451 AbstractCegarLoop]: Interpolant automaton has 126 states [2018-07-25 13:24:13,445 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 126 interpolants. [2018-07-25 13:24:13,445 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:24:13,445 INFO L87 Difference]: Start difference. First operand 251 states and 251 transitions. Second operand 126 states. [2018-07-25 13:24:15,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:15,851 INFO L93 Difference]: Finished difference Result 255 states and 255 transitions. [2018-07-25 13:24:15,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 126 states. [2018-07-25 13:24:15,852 INFO L78 Accepts]: Start accepts. Automaton has 126 states. Word has length 250 [2018-07-25 13:24:15,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:15,852 INFO L225 Difference]: With dead ends: 255 [2018-07-25 13:24:15,852 INFO L226 Difference]: Without dead ends: 253 [2018-07-25 13:24:15,853 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 124 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=249, Invalid=15501, Unknown=0, NotChecked=0, Total=15750 [2018-07-25 13:24:15,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2018-07-25 13:24:15,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2018-07-25 13:24:15,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-07-25 13:24:15,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 253 transitions. [2018-07-25 13:24:15,994 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 253 transitions. Word has length 250 [2018-07-25 13:24:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:15,994 INFO L472 AbstractCegarLoop]: Abstraction has 253 states and 253 transitions. [2018-07-25 13:24:15,994 INFO L473 AbstractCegarLoop]: Interpolant automaton has 126 states. [2018-07-25 13:24:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 253 transitions. [2018-07-25 13:24:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2018-07-25 13:24:15,995 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:15,995 INFO L354 BasicCegarLoop]: trace histogram [125, 124, 1, 1, 1] [2018-07-25 13:24:15,995 INFO L415 AbstractCegarLoop]: === Iteration 125 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:15,996 INFO L82 PathProgramCache]: Analyzing trace with hash 1965429781, now seen corresponding path program 124 times [2018-07-25 13:24:15,996 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:17,755 INFO L134 CoverageAnalysis]: Checked inductivity of 15500 backedges. 0 proven. 15500 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:17,756 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:17,756 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [126] total 126 [2018-07-25 13:24:17,756 INFO L451 AbstractCegarLoop]: Interpolant automaton has 127 states [2018-07-25 13:24:17,756 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 127 interpolants. [2018-07-25 13:24:17,757 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:24:17,757 INFO L87 Difference]: Start difference. First operand 253 states and 253 transitions. Second operand 127 states. [2018-07-25 13:24:20,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:20,340 INFO L93 Difference]: Finished difference Result 257 states and 257 transitions. [2018-07-25 13:24:20,340 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 127 states. [2018-07-25 13:24:20,340 INFO L78 Accepts]: Start accepts. Automaton has 127 states. Word has length 252 [2018-07-25 13:24:20,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:20,341 INFO L225 Difference]: With dead ends: 257 [2018-07-25 13:24:20,341 INFO L226 Difference]: Without dead ends: 255 [2018-07-25 13:24:20,341 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 125 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=251, Invalid=15751, Unknown=0, NotChecked=0, Total=16002 [2018-07-25 13:24:20,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states. [2018-07-25 13:24:20,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 255. [2018-07-25 13:24:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 255 states. [2018-07-25 13:24:20,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 255 states to 255 states and 255 transitions. [2018-07-25 13:24:20,448 INFO L78 Accepts]: Start accepts. Automaton has 255 states and 255 transitions. Word has length 252 [2018-07-25 13:24:20,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:20,448 INFO L472 AbstractCegarLoop]: Abstraction has 255 states and 255 transitions. [2018-07-25 13:24:20,448 INFO L473 AbstractCegarLoop]: Interpolant automaton has 127 states. [2018-07-25 13:24:20,448 INFO L276 IsEmpty]: Start isEmpty. Operand 255 states and 255 transitions. [2018-07-25 13:24:20,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 255 [2018-07-25 13:24:20,449 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:20,449 INFO L354 BasicCegarLoop]: trace histogram [126, 125, 1, 1, 1] [2018-07-25 13:24:20,449 INFO L415 AbstractCegarLoop]: === Iteration 126 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:20,449 INFO L82 PathProgramCache]: Analyzing trace with hash -1007657711, now seen corresponding path program 125 times [2018-07-25 13:24:20,449 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:20,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:22,236 INFO L134 CoverageAnalysis]: Checked inductivity of 15750 backedges. 0 proven. 15750 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:22,237 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:22,237 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [127] total 127 [2018-07-25 13:24:22,237 INFO L451 AbstractCegarLoop]: Interpolant automaton has 128 states [2018-07-25 13:24:22,237 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 128 interpolants. [2018-07-25 13:24:22,238 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:24:22,238 INFO L87 Difference]: Start difference. First operand 255 states and 255 transitions. Second operand 128 states. [2018-07-25 13:24:24,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:24,801 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2018-07-25 13:24:24,801 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 128 states. [2018-07-25 13:24:24,801 INFO L78 Accepts]: Start accepts. Automaton has 128 states. Word has length 254 [2018-07-25 13:24:24,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:24,802 INFO L225 Difference]: With dead ends: 259 [2018-07-25 13:24:24,802 INFO L226 Difference]: Without dead ends: 257 [2018-07-25 13:24:24,803 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=253, Invalid=16003, Unknown=0, NotChecked=0, Total=16256 [2018-07-25 13:24:24,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-07-25 13:24:24,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 257. [2018-07-25 13:24:24,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 257 states. [2018-07-25 13:24:24,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 257 transitions. [2018-07-25 13:24:24,910 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 257 transitions. Word has length 254 [2018-07-25 13:24:24,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:24,910 INFO L472 AbstractCegarLoop]: Abstraction has 257 states and 257 transitions. [2018-07-25 13:24:24,910 INFO L473 AbstractCegarLoop]: Interpolant automaton has 128 states. [2018-07-25 13:24:24,910 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 257 transitions. [2018-07-25 13:24:24,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2018-07-25 13:24:24,911 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:24,911 INFO L354 BasicCegarLoop]: trace histogram [127, 126, 1, 1, 1] [2018-07-25 13:24:24,911 INFO L415 AbstractCegarLoop]: === Iteration 127 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:24,911 INFO L82 PathProgramCache]: Analyzing trace with hash -1991485683, now seen corresponding path program 126 times [2018-07-25 13:24:24,912 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:25,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:26,801 INFO L134 CoverageAnalysis]: Checked inductivity of 16002 backedges. 0 proven. 16002 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:26,801 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:26,801 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [128] total 128 [2018-07-25 13:24:26,801 INFO L451 AbstractCegarLoop]: Interpolant automaton has 129 states [2018-07-25 13:24:26,802 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 129 interpolants. [2018-07-25 13:24:26,802 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:24:26,803 INFO L87 Difference]: Start difference. First operand 257 states and 257 transitions. Second operand 129 states. [2018-07-25 13:24:29,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:29,535 INFO L93 Difference]: Finished difference Result 261 states and 261 transitions. [2018-07-25 13:24:29,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 129 states. [2018-07-25 13:24:29,535 INFO L78 Accepts]: Start accepts. Automaton has 129 states. Word has length 256 [2018-07-25 13:24:29,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:29,536 INFO L225 Difference]: With dead ends: 261 [2018-07-25 13:24:29,536 INFO L226 Difference]: Without dead ends: 259 [2018-07-25 13:24:29,537 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 127 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=255, Invalid=16257, Unknown=0, NotChecked=0, Total=16512 [2018-07-25 13:24:29,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2018-07-25 13:24:29,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 259. [2018-07-25 13:24:29,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 259 states. [2018-07-25 13:24:29,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 259 transitions. [2018-07-25 13:24:29,648 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 259 transitions. Word has length 256 [2018-07-25 13:24:29,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:29,648 INFO L472 AbstractCegarLoop]: Abstraction has 259 states and 259 transitions. [2018-07-25 13:24:29,648 INFO L473 AbstractCegarLoop]: Interpolant automaton has 129 states. [2018-07-25 13:24:29,648 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 259 transitions. [2018-07-25 13:24:29,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 259 [2018-07-25 13:24:29,649 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:29,649 INFO L354 BasicCegarLoop]: trace histogram [128, 127, 1, 1, 1] [2018-07-25 13:24:29,650 INFO L415 AbstractCegarLoop]: === Iteration 128 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:29,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1737605641, now seen corresponding path program 127 times [2018-07-25 13:24:29,650 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:30,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 16256 backedges. 0 proven. 16256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:31,522 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:31,522 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [129] total 129 [2018-07-25 13:24:31,523 INFO L451 AbstractCegarLoop]: Interpolant automaton has 130 states [2018-07-25 13:24:31,523 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 130 interpolants. [2018-07-25 13:24:31,524 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:24:31,524 INFO L87 Difference]: Start difference. First operand 259 states and 259 transitions. Second operand 130 states. [2018-07-25 13:24:34,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:34,032 INFO L93 Difference]: Finished difference Result 263 states and 263 transitions. [2018-07-25 13:24:34,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 130 states. [2018-07-25 13:24:34,033 INFO L78 Accepts]: Start accepts. Automaton has 130 states. Word has length 258 [2018-07-25 13:24:34,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:34,034 INFO L225 Difference]: With dead ends: 263 [2018-07-25 13:24:34,034 INFO L226 Difference]: Without dead ends: 261 [2018-07-25 13:24:34,035 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 128 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=16513, Unknown=0, NotChecked=0, Total=16770 [2018-07-25 13:24:34,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2018-07-25 13:24:34,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 261. [2018-07-25 13:24:34,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 261 states. [2018-07-25 13:24:34,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 261 transitions. [2018-07-25 13:24:34,147 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 261 transitions. Word has length 258 [2018-07-25 13:24:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:34,148 INFO L472 AbstractCegarLoop]: Abstraction has 261 states and 261 transitions. [2018-07-25 13:24:34,148 INFO L473 AbstractCegarLoop]: Interpolant automaton has 130 states. [2018-07-25 13:24:34,148 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 261 transitions. [2018-07-25 13:24:34,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2018-07-25 13:24:34,148 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:34,149 INFO L354 BasicCegarLoop]: trace histogram [129, 128, 1, 1, 1] [2018-07-25 13:24:34,149 INFO L415 AbstractCegarLoop]: === Iteration 129 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:34,149 INFO L82 PathProgramCache]: Analyzing trace with hash -903324155, now seen corresponding path program 128 times [2018-07-25 13:24:34,149 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:34,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:36,099 INFO L134 CoverageAnalysis]: Checked inductivity of 16512 backedges. 0 proven. 16512 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:36,099 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:36,100 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2018-07-25 13:24:36,100 INFO L451 AbstractCegarLoop]: Interpolant automaton has 131 states [2018-07-25 13:24:36,100 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2018-07-25 13:24:36,101 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:24:36,101 INFO L87 Difference]: Start difference. First operand 261 states and 261 transitions. Second operand 131 states. [2018-07-25 13:24:38,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:38,817 INFO L93 Difference]: Finished difference Result 265 states and 265 transitions. [2018-07-25 13:24:38,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2018-07-25 13:24:38,818 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 260 [2018-07-25 13:24:38,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:38,818 INFO L225 Difference]: With dead ends: 265 [2018-07-25 13:24:38,818 INFO L226 Difference]: Without dead ends: 263 [2018-07-25 13:24:38,820 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=259, Invalid=16771, Unknown=0, NotChecked=0, Total=17030 [2018-07-25 13:24:38,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2018-07-25 13:24:38,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 263. [2018-07-25 13:24:38,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 263 states. [2018-07-25 13:24:38,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 263 states to 263 states and 263 transitions. [2018-07-25 13:24:38,925 INFO L78 Accepts]: Start accepts. Automaton has 263 states and 263 transitions. Word has length 260 [2018-07-25 13:24:38,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:38,925 INFO L472 AbstractCegarLoop]: Abstraction has 263 states and 263 transitions. [2018-07-25 13:24:38,925 INFO L473 AbstractCegarLoop]: Interpolant automaton has 131 states. [2018-07-25 13:24:38,925 INFO L276 IsEmpty]: Start isEmpty. Operand 263 states and 263 transitions. [2018-07-25 13:24:38,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2018-07-25 13:24:38,926 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:38,926 INFO L354 BasicCegarLoop]: trace histogram [130, 129, 1, 1, 1] [2018-07-25 13:24:38,926 INFO L415 AbstractCegarLoop]: === Iteration 130 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:38,926 INFO L82 PathProgramCache]: Analyzing trace with hash -511186175, now seen corresponding path program 129 times [2018-07-25 13:24:38,926 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:39,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:40,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16770 backedges. 0 proven. 16770 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:40,976 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:40,976 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2018-07-25 13:24:40,976 INFO L451 AbstractCegarLoop]: Interpolant automaton has 132 states [2018-07-25 13:24:40,977 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2018-07-25 13:24:40,977 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:24:40,978 INFO L87 Difference]: Start difference. First operand 263 states and 263 transitions. Second operand 132 states. [2018-07-25 13:24:43,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:43,885 INFO L93 Difference]: Finished difference Result 267 states and 267 transitions. [2018-07-25 13:24:43,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2018-07-25 13:24:43,885 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 262 [2018-07-25 13:24:43,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:43,886 INFO L225 Difference]: With dead ends: 267 [2018-07-25 13:24:43,886 INFO L226 Difference]: Without dead ends: 265 [2018-07-25 13:24:43,887 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=261, Invalid=17031, Unknown=0, NotChecked=0, Total=17292 [2018-07-25 13:24:43,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 265 states. [2018-07-25 13:24:44,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 265 to 265. [2018-07-25 13:24:44,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 265 states. [2018-07-25 13:24:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 265 states to 265 states and 265 transitions. [2018-07-25 13:24:44,007 INFO L78 Accepts]: Start accepts. Automaton has 265 states and 265 transitions. Word has length 262 [2018-07-25 13:24:44,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:44,007 INFO L472 AbstractCegarLoop]: Abstraction has 265 states and 265 transitions. [2018-07-25 13:24:44,007 INFO L473 AbstractCegarLoop]: Interpolant automaton has 132 states. [2018-07-25 13:24:44,007 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 265 transitions. [2018-07-25 13:24:44,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2018-07-25 13:24:44,008 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:44,008 INFO L354 BasicCegarLoop]: trace histogram [131, 130, 1, 1, 1] [2018-07-25 13:24:44,008 INFO L415 AbstractCegarLoop]: === Iteration 131 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:44,009 INFO L82 PathProgramCache]: Analyzing trace with hash -1623709443, now seen corresponding path program 130 times [2018-07-25 13:24:44,009 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:46,207 INFO L134 CoverageAnalysis]: Checked inductivity of 17030 backedges. 0 proven. 17030 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:46,207 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:46,207 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [132] total 132 [2018-07-25 13:24:46,207 INFO L451 AbstractCegarLoop]: Interpolant automaton has 133 states [2018-07-25 13:24:46,208 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2018-07-25 13:24:46,209 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:24:46,209 INFO L87 Difference]: Start difference. First operand 265 states and 265 transitions. Second operand 133 states. [2018-07-25 13:24:49,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:49,155 INFO L93 Difference]: Finished difference Result 269 states and 269 transitions. [2018-07-25 13:24:49,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 133 states. [2018-07-25 13:24:49,155 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 264 [2018-07-25 13:24:49,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:49,156 INFO L225 Difference]: With dead ends: 269 [2018-07-25 13:24:49,156 INFO L226 Difference]: Without dead ends: 267 [2018-07-25 13:24:49,157 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=263, Invalid=17293, Unknown=0, NotChecked=0, Total=17556 [2018-07-25 13:24:49,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2018-07-25 13:24:49,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 267. [2018-07-25 13:24:49,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 267 states. [2018-07-25 13:24:49,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 267 transitions. [2018-07-25 13:24:49,276 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 267 transitions. Word has length 264 [2018-07-25 13:24:49,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:49,277 INFO L472 AbstractCegarLoop]: Abstraction has 267 states and 267 transitions. [2018-07-25 13:24:49,277 INFO L473 AbstractCegarLoop]: Interpolant automaton has 133 states. [2018-07-25 13:24:49,277 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 267 transitions. [2018-07-25 13:24:49,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2018-07-25 13:24:49,278 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:49,278 INFO L354 BasicCegarLoop]: trace histogram [132, 131, 1, 1, 1] [2018-07-25 13:24:49,279 INFO L415 AbstractCegarLoop]: === Iteration 132 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:49,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1311713287, now seen corresponding path program 131 times [2018-07-25 13:24:49,279 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:49,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 17292 backedges. 0 proven. 17292 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:51,471 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:51,471 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [133] total 133 [2018-07-25 13:24:51,471 INFO L451 AbstractCegarLoop]: Interpolant automaton has 134 states [2018-07-25 13:24:51,471 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 134 interpolants. [2018-07-25 13:24:51,473 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:24:51,473 INFO L87 Difference]: Start difference. First operand 267 states and 267 transitions. Second operand 134 states. [2018-07-25 13:24:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:54,450 INFO L93 Difference]: Finished difference Result 271 states and 271 transitions. [2018-07-25 13:24:54,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 134 states. [2018-07-25 13:24:54,450 INFO L78 Accepts]: Start accepts. Automaton has 134 states. Word has length 266 [2018-07-25 13:24:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:54,451 INFO L225 Difference]: With dead ends: 271 [2018-07-25 13:24:54,451 INFO L226 Difference]: Without dead ends: 269 [2018-07-25 13:24:54,452 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 132 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=265, Invalid=17557, Unknown=0, NotChecked=0, Total=17822 [2018-07-25 13:24:54,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2018-07-25 13:24:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2018-07-25 13:24:54,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 269 states. [2018-07-25 13:24:54,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 269 transitions. [2018-07-25 13:24:54,561 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 269 transitions. Word has length 266 [2018-07-25 13:24:54,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:54,561 INFO L472 AbstractCegarLoop]: Abstraction has 269 states and 269 transitions. [2018-07-25 13:24:54,561 INFO L473 AbstractCegarLoop]: Interpolant automaton has 134 states. [2018-07-25 13:24:54,561 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 269 transitions. [2018-07-25 13:24:54,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2018-07-25 13:24:54,562 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:54,562 INFO L354 BasicCegarLoop]: trace histogram [133, 132, 1, 1, 1] [2018-07-25 13:24:54,562 INFO L415 AbstractCegarLoop]: === Iteration 133 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:54,563 INFO L82 PathProgramCache]: Analyzing trace with hash -2131118091, now seen corresponding path program 132 times [2018-07-25 13:24:54,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:24:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:24:56,736 INFO L134 CoverageAnalysis]: Checked inductivity of 17556 backedges. 0 proven. 17556 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:24:56,736 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:24:56,736 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [134] total 134 [2018-07-25 13:24:56,736 INFO L451 AbstractCegarLoop]: Interpolant automaton has 135 states [2018-07-25 13:24:56,736 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 135 interpolants. [2018-07-25 13:24:56,737 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:24:56,737 INFO L87 Difference]: Start difference. First operand 269 states and 269 transitions. Second operand 135 states. [2018-07-25 13:24:59,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:24:59,830 INFO L93 Difference]: Finished difference Result 273 states and 273 transitions. [2018-07-25 13:24:59,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 135 states. [2018-07-25 13:24:59,830 INFO L78 Accepts]: Start accepts. Automaton has 135 states. Word has length 268 [2018-07-25 13:24:59,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:24:59,831 INFO L225 Difference]: With dead ends: 273 [2018-07-25 13:24:59,831 INFO L226 Difference]: Without dead ends: 271 [2018-07-25 13:24:59,832 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 134 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=267, Invalid=17823, Unknown=0, NotChecked=0, Total=18090 [2018-07-25 13:24:59,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2018-07-25 13:24:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2018-07-25 13:24:59,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 271 states. [2018-07-25 13:24:59,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 271 transitions. [2018-07-25 13:24:59,953 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 271 transitions. Word has length 268 [2018-07-25 13:24:59,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:24:59,953 INFO L472 AbstractCegarLoop]: Abstraction has 271 states and 271 transitions. [2018-07-25 13:24:59,953 INFO L473 AbstractCegarLoop]: Interpolant automaton has 135 states. [2018-07-25 13:24:59,953 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 271 transitions. [2018-07-25 13:24:59,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 271 [2018-07-25 13:24:59,954 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:24:59,954 INFO L354 BasicCegarLoop]: trace histogram [134, 133, 1, 1, 1] [2018-07-25 13:24:59,954 INFO L415 AbstractCegarLoop]: === Iteration 134 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:24:59,954 INFO L82 PathProgramCache]: Analyzing trace with hash 694847729, now seen corresponding path program 133 times [2018-07-25 13:24:59,955 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:02,040 INFO L134 CoverageAnalysis]: Checked inductivity of 17822 backedges. 0 proven. 17822 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:02,040 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:02,040 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [135] total 135 [2018-07-25 13:25:02,041 INFO L451 AbstractCegarLoop]: Interpolant automaton has 136 states [2018-07-25 13:25:02,041 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 136 interpolants. [2018-07-25 13:25:02,042 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:25:02,042 INFO L87 Difference]: Start difference. First operand 271 states and 271 transitions. Second operand 136 states. [2018-07-25 13:25:05,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:05,064 INFO L93 Difference]: Finished difference Result 275 states and 275 transitions. [2018-07-25 13:25:05,064 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 136 states. [2018-07-25 13:25:05,064 INFO L78 Accepts]: Start accepts. Automaton has 136 states. Word has length 270 [2018-07-25 13:25:05,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:05,065 INFO L225 Difference]: With dead ends: 275 [2018-07-25 13:25:05,065 INFO L226 Difference]: Without dead ends: 273 [2018-07-25 13:25:05,065 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 134 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=269, Invalid=18091, Unknown=0, NotChecked=0, Total=18360 [2018-07-25 13:25:05,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2018-07-25 13:25:05,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 273. [2018-07-25 13:25:05,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 273 states. [2018-07-25 13:25:05,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 273 transitions. [2018-07-25 13:25:05,192 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 273 transitions. Word has length 270 [2018-07-25 13:25:05,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:05,192 INFO L472 AbstractCegarLoop]: Abstraction has 273 states and 273 transitions. [2018-07-25 13:25:05,192 INFO L473 AbstractCegarLoop]: Interpolant automaton has 136 states. [2018-07-25 13:25:05,193 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 273 transitions. [2018-07-25 13:25:05,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2018-07-25 13:25:05,193 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:05,193 INFO L354 BasicCegarLoop]: trace histogram [135, 134, 1, 1, 1] [2018-07-25 13:25:05,194 INFO L415 AbstractCegarLoop]: === Iteration 135 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:05,194 INFO L82 PathProgramCache]: Analyzing trace with hash 2028669677, now seen corresponding path program 134 times [2018-07-25 13:25:05,194 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:05,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:07,516 INFO L134 CoverageAnalysis]: Checked inductivity of 18090 backedges. 0 proven. 18090 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:07,517 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:07,517 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [136] total 136 [2018-07-25 13:25:07,518 INFO L451 AbstractCegarLoop]: Interpolant automaton has 137 states [2018-07-25 13:25:07,518 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 137 interpolants. [2018-07-25 13:25:07,520 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:25:07,520 INFO L87 Difference]: Start difference. First operand 273 states and 273 transitions. Second operand 137 states. [2018-07-25 13:25:10,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:10,581 INFO L93 Difference]: Finished difference Result 277 states and 277 transitions. [2018-07-25 13:25:10,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 137 states. [2018-07-25 13:25:10,582 INFO L78 Accepts]: Start accepts. Automaton has 137 states. Word has length 272 [2018-07-25 13:25:10,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:10,582 INFO L225 Difference]: With dead ends: 277 [2018-07-25 13:25:10,583 INFO L226 Difference]: Without dead ends: 275 [2018-07-25 13:25:10,583 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 135 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=271, Invalid=18361, Unknown=0, NotChecked=0, Total=18632 [2018-07-25 13:25:10,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2018-07-25 13:25:10,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 275. [2018-07-25 13:25:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 275 states. [2018-07-25 13:25:10,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 275 states to 275 states and 275 transitions. [2018-07-25 13:25:10,776 INFO L78 Accepts]: Start accepts. Automaton has 275 states and 275 transitions. Word has length 272 [2018-07-25 13:25:10,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:10,776 INFO L472 AbstractCegarLoop]: Abstraction has 275 states and 275 transitions. [2018-07-25 13:25:10,776 INFO L473 AbstractCegarLoop]: Interpolant automaton has 137 states. [2018-07-25 13:25:10,776 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 275 transitions. [2018-07-25 13:25:10,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2018-07-25 13:25:10,777 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:10,777 INFO L354 BasicCegarLoop]: trace histogram [136, 135, 1, 1, 1] [2018-07-25 13:25:10,777 INFO L415 AbstractCegarLoop]: === Iteration 136 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:10,777 INFO L82 PathProgramCache]: Analyzing trace with hash -363659799, now seen corresponding path program 135 times [2018-07-25 13:25:10,778 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:11,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:13,223 INFO L134 CoverageAnalysis]: Checked inductivity of 18360 backedges. 0 proven. 18360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:13,223 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:13,223 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [137] total 137 [2018-07-25 13:25:13,223 INFO L451 AbstractCegarLoop]: Interpolant automaton has 138 states [2018-07-25 13:25:13,224 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 138 interpolants. [2018-07-25 13:25:13,224 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:25:13,224 INFO L87 Difference]: Start difference. First operand 275 states and 275 transitions. Second operand 138 states. [2018-07-25 13:25:16,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-07-25 13:25:16,386 INFO L93 Difference]: Finished difference Result 279 states and 279 transitions. [2018-07-25 13:25:16,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2018-07-25 13:25:16,387 INFO L78 Accepts]: Start accepts. Automaton has 138 states. Word has length 274 [2018-07-25 13:25:16,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-07-25 13:25:16,387 INFO L225 Difference]: With dead ends: 279 [2018-07-25 13:25:16,387 INFO L226 Difference]: Without dead ends: 277 [2018-07-25 13:25:16,388 INFO L574 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 136 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=273, Invalid=18633, Unknown=0, NotChecked=0, Total=18906 [2018-07-25 13:25:16,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 277 states. [2018-07-25 13:25:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 277 to 277. [2018-07-25 13:25:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 277 states. [2018-07-25 13:25:16,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 277 transitions. [2018-07-25 13:25:16,517 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 277 transitions. Word has length 274 [2018-07-25 13:25:16,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-07-25 13:25:16,517 INFO L472 AbstractCegarLoop]: Abstraction has 277 states and 277 transitions. [2018-07-25 13:25:16,517 INFO L473 AbstractCegarLoop]: Interpolant automaton has 138 states. [2018-07-25 13:25:16,517 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 277 transitions. [2018-07-25 13:25:16,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2018-07-25 13:25:16,519 INFO L346 BasicCegarLoop]: Found error trace [2018-07-25 13:25:16,519 INFO L354 BasicCegarLoop]: trace histogram [137, 136, 1, 1, 1] [2018-07-25 13:25:16,519 INFO L415 AbstractCegarLoop]: === Iteration 137 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2018-07-25 13:25:16,519 INFO L82 PathProgramCache]: Analyzing trace with hash -1584782875, now seen corresponding path program 136 times [2018-07-25 13:25:16,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2018-07-25 13:25:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-07-25 13:25:18,874 INFO L134 CoverageAnalysis]: Checked inductivity of 18632 backedges. 0 proven. 18632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-07-25 13:25:18,875 INFO L309 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2018-07-25 13:25:18,875 INFO L324 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2018-07-25 13:25:18,875 INFO L451 AbstractCegarLoop]: Interpolant automaton has 139 states [2018-07-25 13:25:18,875 INFO L132 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2018-07-25 13:25:18,876 INFO L133 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=18907, Unknown=0, NotChecked=0, Total=19182 [2018-07-25 13:25:18,877 INFO L87 Difference]: Start difference. First operand 277 states and 277 transitions. Second operand 139 states. Received shutdown request... [2018-07-25 13:25:21,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 113 states. [2018-07-25 13:25:21,719 WARN L541 AbstractCegarLoop]: Verification canceled [2018-07-25 13:25:21,726 WARN L202 ceAbstractionStarter]: Timeout [2018-07-25 13:25:21,729 INFO L202 PluginConnector]: Adding new model afnp2014.c.i_3.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.07 01:25:21 BoogieIcfgContainer [2018-07-25 13:25:21,729 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-07-25 13:25:21,734 INFO L168 Benchmark]: Toolchain (without parser) took 260118.66 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.5 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 303.8 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:21,739 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:25:21,739 INFO L168 Benchmark]: Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:25:21,740 INFO L168 Benchmark]: Boogie Preprocessor took 20.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. [2018-07-25 13:25:21,740 INFO L168 Benchmark]: RCFGBuilder took 253.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:21,741 INFO L168 Benchmark]: TraceAbstraction took 259800.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 293.2 MB. Max. memory is 7.1 GB. [2018-07-25 13:25:21,743 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.22 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 35.96 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Preprocessor took 20.27 ms. Allocated memory is still 1.5 GB. Free memory is still 1.5 GB. There was no memory consumed. Max. memory is 7.1 GB. * RCFGBuilder took 253.49 ms. Allocated memory is still 1.5 GB. Free memory was 1.5 GB in the beginning and 1.4 GB in the end (delta: 10.6 MB). Peak memory consumption was 10.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 259800.13 ms. Allocated memory was 1.5 GB in the beginning and 3.5 GB in the end (delta: 2.0 GB). Free memory was 1.4 GB in the beginning and 3.2 GB in the end (delta: -1.7 GB). Peak memory consumption was 293.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 43]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 43). Cancelled while BasicCegarLoop was constructing difference of abstraction (277states) and interpolant automaton (currently 113 states, 139 states before enhancement), while ReachableStatesComputation was computing reachable states (222 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 7 locations, 1 error locations. TIMEOUT Result, 259.7s OverallTime, 137 OverallIterations, 137 TraceHistogramMax, 150.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 542 SDtfs, 0 SDslu, 9316 SDs, 0 SdLazy, 1744373 SolverSat, 4 SolverUnsat, 26 SolverUnknown, 0 SolverNotchecked, 101.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 9594 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 9457 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 56.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=277occurred in iteration=136, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.9s AutomataMinimizationTime, 136 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 19.0s SatisfiabilityAnalysisTime, 76.7s InterpolantComputationTime, 19180 NumberOfCodeBlocks, 19180 NumberOfCodeBlocksAsserted, 137 NumberOfCheckSat, 19043 ConstructedInterpolants, 0 QuantifiedInterpolants, 24109405 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 137 InterpolantComputations, 1 PerfectInterpolantSequences, 0/857072 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-Benchmark-0-2018-07-25_13-25-21-768.csv Written .csv to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/csv/afnp2014.c.i_3.bpl_AutomizerBpl-nestedInterpolants.epf_AutomizerBplInline.xml/Csv-TraceAbstractionBenchmarks-0-2018-07-25_13-25-21-768.csv Completed graceful shutdown