java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 11:04:16,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 11:04:16,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 11:04:16,363 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 11:04:16,363 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 11:04:16,365 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 11:04:16,366 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 11:04:16,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 11:04:16,372 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 11:04:16,378 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 11:04:16,379 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 11:04:16,379 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 11:04:16,380 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 11:04:16,386 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 11:04:16,387 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 11:04:16,388 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 11:04:16,389 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 11:04:16,391 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 11:04:16,395 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 11:04:16,397 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 11:04:16,402 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 11:04:16,406 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 11:04:16,407 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 11:04:16,410 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 11:04:16,412 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 11:04:16,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 11:04:16,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 11:04:16,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 11:04:16,415 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 11:04:16,417 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 11:04:16,418 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 11:04:16,418 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 11:04:16,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 11:04:16,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 11:04:16,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 11:04:16,421 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 11:04:16,422 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 11:04:16,422 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 11:04:16,422 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 11:04:16,423 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 11:04:16,424 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 11:04:16,459 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 11:04:16,476 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 11:04:16,482 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 11:04:16,484 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 11:04:16,484 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 11:04:16,485 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl [2019-08-05 11:04:16,486 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/20181010-MemSafetyPathprograms/optional_data_creation_test04_false-valid-memtrack.i_32.bpl' [2019-08-05 11:04:16,552 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 11:04:16,554 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 11:04:16,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:16,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 11:04:16,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 11:04:16,571 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,587 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,596 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 11:04:16,597 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 11:04:16,597 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 11:04:16,597 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 11:04:16,607 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,612 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,612 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,620 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,623 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,625 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... [2019-08-05 11:04:16,628 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 11:04:16,629 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 11:04:16,629 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 11:04:16,629 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 11:04:16,630 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 11:04:16,708 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ULTIMATE.start given in one single declaration [2019-08-05 11:04:16,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 11:04:16,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 11:04:17,141 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 11:04:17,141 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 11:04:17,143 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:17 BoogieIcfgContainer [2019-08-05 11:04:17,143 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 11:04:17,145 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 11:04:17,145 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 11:04:17,148 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 11:04:17,148 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 11:04:16" (1/2) ... [2019-08-05 11:04:17,149 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@af98e3d and model type optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 11:04:17, skipping insertion in model container [2019-08-05 11:04:17,149 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 11:04:17" (2/2) ... [2019-08-05 11:04:17,151 INFO L109 eAbstractionObserver]: Analyzing ICFG optional_data_creation_test04_false-valid-memtrack.i_32.bpl [2019-08-05 11:04:17,161 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 11:04:17,169 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 11:04:17,184 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 11:04:17,210 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 11:04:17,210 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 11:04:17,211 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 11:04:17,211 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 11:04:17,211 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 11:04:17,211 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 11:04:17,211 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 11:04:17,212 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 11:04:17,212 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 11:04:17,226 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 11:04:17,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 11:04:17,234 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:17,234 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 11:04:17,237 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:17,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:17,243 INFO L82 PathProgramCache]: Analyzing trace with hash 29955, now seen corresponding path program 1 times [2019-08-05 11:04:17,288 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:17,385 INFO L256 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 11:04:17,389 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:17,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:17,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:17,438 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:04:17,443 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:04:17,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:04:17,458 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:04:17,461 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 11:04:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:17,516 INFO L93 Difference]: Finished difference Result 5 states and 5 transitions. [2019-08-05 11:04:17,517 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:04:17,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 11:04:17,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:17,529 INFO L225 Difference]: With dead ends: 5 [2019-08-05 11:04:17,529 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 11:04:17,531 INFO L628 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 [2019-08-05 11:04:17,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 11:04:17,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 11:04:17,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 11:04:17,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 11:04:17,558 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 11:04:17,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:17,558 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 11:04:17,559 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:04:17,559 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 11:04:17,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 11:04:17,560 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:17,560 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 11:04:17,560 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:17,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:17,561 INFO L82 PathProgramCache]: Analyzing trace with hash 930412, now seen corresponding path program 1 times [2019-08-05 11:04:17,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:17,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 11:04:17,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:17,766 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:17,767 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:17,767 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 11:04:17,768 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 11:04:17,769 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 11:04:17,769 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:17,769 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 11:04:17,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:17,806 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 11:04:17,806 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 11:04:17,807 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 11:04:17,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:17,807 INFO L225 Difference]: With dead ends: 6 [2019-08-05 11:04:17,807 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 11:04:17,808 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 11:04:17,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 11:04:17,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 11:04:17,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 11:04:17,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 11:04:17,810 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 11:04:17,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:17,810 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 11:04:17,810 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 11:04:17,810 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 11:04:17,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 11:04:17,811 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:17,811 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 11:04:17,811 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:17,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:17,812 INFO L82 PathProgramCache]: Analyzing trace with hash 28844579, now seen corresponding path program 2 times [2019-08-05 11:04:17,813 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:17,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:17,876 INFO L256 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 11:04:17,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:17,986 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:17,987 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:17,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 11:04:17,987 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 11:04:17,987 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 11:04:17,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:17,988 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 11:04:18,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:18,047 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 11:04:18,047 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 11:04:18,047 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 11:04:18,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:18,048 INFO L225 Difference]: With dead ends: 7 [2019-08-05 11:04:18,048 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 11:04:18,049 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 11:04:18,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 11:04:18,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 11:04:18,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 11:04:18,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 11:04:18,051 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 11:04:18,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:18,051 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 11:04:18,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 11:04:18,052 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 11:04:18,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 11:04:18,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:18,052 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 11:04:18,052 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:18,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:18,053 INFO L82 PathProgramCache]: Analyzing trace with hash 894183756, now seen corresponding path program 3 times [2019-08-05 11:04:18,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:18,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:18,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 11:04:18,131 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:18,329 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:18,329 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:18,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 11:04:18,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 11:04:18,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 11:04:18,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:18,331 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 11:04:18,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:18,394 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 11:04:18,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 11:04:18,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 11:04:18,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:18,395 INFO L225 Difference]: With dead ends: 8 [2019-08-05 11:04:18,395 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 11:04:18,395 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 11:04:18,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 11:04:18,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 11:04:18,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 11:04:18,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 11:04:18,397 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 11:04:18,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:18,398 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 11:04:18,398 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 11:04:18,398 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 11:04:18,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 11:04:18,398 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:18,398 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 11:04:18,399 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:18,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1949894467, now seen corresponding path program 4 times [2019-08-05 11:04:18,400 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:18,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:18,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 11:04:18,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:18,669 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:18,670 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:18,670 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 11:04:18,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 11:04:18,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 11:04:18,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:18,672 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 11:04:18,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:18,812 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 11:04:18,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 11:04:18,813 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 11:04:18,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:18,813 INFO L225 Difference]: With dead ends: 9 [2019-08-05 11:04:18,814 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 11:04:18,814 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 11:04:18,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 11:04:18,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 11:04:18,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 11:04:18,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 11:04:18,817 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 11:04:18,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:18,817 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 11:04:18,817 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 11:04:18,818 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 11:04:18,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 11:04:18,818 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:18,818 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 11:04:18,819 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:18,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:18,819 INFO L82 PathProgramCache]: Analyzing trace with hash 317188140, now seen corresponding path program 5 times [2019-08-05 11:04:18,820 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:18,892 INFO L256 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 7 conjunts are in the unsatisfiable core [2019-08-05 11:04:18,894 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:19,165 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:19,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:19,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 11:04:19,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 11:04:19,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 11:04:19,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:19,167 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 11:04:19,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,227 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 11:04:19,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 11:04:19,227 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 11:04:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,228 INFO L225 Difference]: With dead ends: 10 [2019-08-05 11:04:19,228 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 11:04:19,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2019-08-05 11:04:19,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 11:04:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 11:04:19,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 11:04:19,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 11:04:19,231 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 11:04:19,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,231 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 11:04:19,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 11:04:19,231 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 11:04:19,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 11:04:19,232 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,232 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 11:04:19,232 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,233 INFO L82 PathProgramCache]: Analyzing trace with hash 1242899555, now seen corresponding path program 6 times [2019-08-05 11:04:19,234 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 340 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:19,567 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:19,567 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:19,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 11:04:19,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 11:04:19,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 11:04:19,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:19,569 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 11:04:19,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:19,612 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 11:04:19,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 11:04:19,613 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 11:04:19,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:19,614 INFO L225 Difference]: With dead ends: 11 [2019-08-05 11:04:19,614 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 11:04:19,615 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2019-08-05 11:04:19,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 11:04:19,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 11:04:19,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 11:04:19,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 11:04:19,617 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 9 [2019-08-05 11:04:19,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:19,617 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 11:04:19,617 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 11:04:19,618 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 11:04:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 11:04:19,618 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:19,618 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 11:04:19,618 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:19,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:19,619 INFO L82 PathProgramCache]: Analyzing trace with hash -124817652, now seen corresponding path program 7 times [2019-08-05 11:04:19,620 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:19,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:19,689 INFO L256 TraceCheckSpWp]: Trace formula consists of 377 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 11:04:19,692 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:20,153 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:20,154 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:20,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 11:04:20,155 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 11:04:20,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 11:04:20,156 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:20,156 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 11:04:20,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:20,221 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 11:04:20,221 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 11:04:20,221 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 11:04:20,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:20,222 INFO L225 Difference]: With dead ends: 12 [2019-08-05 11:04:20,222 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 11:04:20,223 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2019-08-05 11:04:20,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 11:04:20,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 11:04:20,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 11:04:20,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 11:04:20,226 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 10 [2019-08-05 11:04:20,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:20,227 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 11:04:20,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 11:04:20,227 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 11:04:20,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 11:04:20,228 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:20,228 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 11:04:20,228 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:20,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:20,229 INFO L82 PathProgramCache]: Analyzing trace with hash 425621891, now seen corresponding path program 8 times [2019-08-05 11:04:20,229 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:20,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:20,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 414 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 11:04:20,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:20,621 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:20,621 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:20,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 11:04:20,622 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 11:04:20,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 11:04:20,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:20,624 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 11:04:20,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:20,675 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 11:04:20,675 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 11:04:20,675 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 11:04:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:20,676 INFO L225 Difference]: With dead ends: 13 [2019-08-05 11:04:20,676 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 11:04:20,677 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=55, Unknown=0, NotChecked=0, Total=110 [2019-08-05 11:04:20,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 11:04:20,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 11:04:20,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 11:04:20,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 11:04:20,680 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 11 [2019-08-05 11:04:20,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:20,680 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 11:04:20,681 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 11:04:20,681 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 11:04:20,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 11:04:20,681 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:20,681 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 11:04:20,682 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:20,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:20,682 INFO L82 PathProgramCache]: Analyzing trace with hash 309378540, now seen corresponding path program 9 times [2019-08-05 11:04:20,683 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:20,729 INFO L256 TraceCheckSpWp]: Trace formula consists of 451 conjuncts, 11 conjunts are in the unsatisfiable core [2019-08-05 11:04:20,731 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:21,435 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:21,436 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:21,436 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 11:04:21,436 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 11:04:21,437 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 11:04:21,437 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:21,437 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 11:04:21,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:21,465 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 11:04:21,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 11:04:21,466 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 11:04:21,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:21,467 INFO L225 Difference]: With dead ends: 14 [2019-08-05 11:04:21,467 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 11:04:21,468 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2019-08-05 11:04:21,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 11:04:21,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 11:04:21,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 11:04:21,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 11:04:21,471 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 12 [2019-08-05 11:04:21,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:21,471 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 11:04:21,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 11:04:21,471 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 11:04:21,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 11:04:21,472 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:21,472 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 11:04:21,472 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:21,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:21,472 INFO L82 PathProgramCache]: Analyzing trace with hash 1000801955, now seen corresponding path program 10 times [2019-08-05 11:04:21,473 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:21,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:21,515 INFO L256 TraceCheckSpWp]: Trace formula consists of 488 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 11:04:21,517 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:22,602 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,602 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 11:04:22,603 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 11:04:22,603 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 11:04:22,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:22,604 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 13 states. [2019-08-05 11:04:22,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:22,641 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 11:04:22,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 11:04:22,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 13 [2019-08-05 11:04:22,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:22,642 INFO L225 Difference]: With dead ends: 15 [2019-08-05 11:04:22,643 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 11:04:22,643 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2019-08-05 11:04:22,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 11:04:22,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 11:04:22,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 11:04:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 11:04:22,647 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 13 [2019-08-05 11:04:22,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:22,647 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 11:04:22,647 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 11:04:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 11:04:22,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 11:04:22,648 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:22,648 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 11:04:22,648 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:22,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:22,648 INFO L82 PathProgramCache]: Analyzing trace with hash 960091340, now seen corresponding path program 11 times [2019-08-05 11:04:22,649 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:22,692 INFO L256 TraceCheckSpWp]: Trace formula consists of 525 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 11:04:22,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:22,983 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:22,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:22,984 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2019-08-05 11:04:22,984 INFO L454 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-08-05 11:04:22,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-08-05 11:04:22,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:22,985 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 14 states. [2019-08-05 11:04:23,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,045 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 11:04:23,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2019-08-05 11:04:23,046 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 14 [2019-08-05 11:04:23,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,047 INFO L225 Difference]: With dead ends: 16 [2019-08-05 11:04:23,047 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 11:04:23,048 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2019-08-05 11:04:23,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 11:04:23,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 11:04:23,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 11:04:23,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 11:04:23,051 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 14 [2019-08-05 11:04:23,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,052 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 11:04:23,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-08-05 11:04:23,052 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 11:04:23,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 11:04:23,052 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,053 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 11:04:23,053 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,053 INFO L82 PathProgramCache]: Analyzing trace with hash -301937725, now seen corresponding path program 12 times [2019-08-05 11:04:23,054 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,110 INFO L256 TraceCheckSpWp]: Trace formula consists of 562 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,113 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:23,324 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:23,325 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:23,325 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14] total 14 [2019-08-05 11:04:23,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 11:04:23,326 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 11:04:23,326 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:23,326 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 15 states. [2019-08-05 11:04:23,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,361 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 11:04:23,361 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-08-05 11:04:23,361 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 15 [2019-08-05 11:04:23,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,363 INFO L225 Difference]: With dead ends: 17 [2019-08-05 11:04:23,363 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 11:04:23,364 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=105, Unknown=0, NotChecked=0, Total=210 [2019-08-05 11:04:23,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 11:04:23,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 11:04:23,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 11:04:23,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 11:04:23,366 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 15 [2019-08-05 11:04:23,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,366 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 11:04:23,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 11:04:23,367 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 11:04:23,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 11:04:23,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,367 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 11:04:23,367 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,368 INFO L82 PathProgramCache]: Analyzing trace with hash -770133076, now seen corresponding path program 13 times [2019-08-05 11:04:23,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,414 INFO L256 TraceCheckSpWp]: Trace formula consists of 599 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:23,742 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 91 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:23,742 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:23,742 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2019-08-05 11:04:23,743 INFO L454 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-08-05 11:04:23,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-08-05 11:04:23,743 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:23,744 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 16 states. [2019-08-05 11:04:23,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:23,794 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2019-08-05 11:04:23,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 11:04:23,794 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 16 [2019-08-05 11:04:23,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:23,795 INFO L225 Difference]: With dead ends: 18 [2019-08-05 11:04:23,795 INFO L226 Difference]: Without dead ends: 18 [2019-08-05 11:04:23,796 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2019-08-05 11:04:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-08-05 11:04:23,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-08-05 11:04:23,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-08-05 11:04:23,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-08-05 11:04:23,800 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 16 [2019-08-05 11:04:23,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:23,800 INFO L475 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-08-05 11:04:23,801 INFO L476 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-08-05 11:04:23,801 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-08-05 11:04:23,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-08-05 11:04:23,801 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:23,801 INFO L399 BasicCegarLoop]: trace histogram [14, 1, 1, 1] [2019-08-05 11:04:23,802 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:23,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:23,802 INFO L82 PathProgramCache]: Analyzing trace with hash 1895680227, now seen corresponding path program 14 times [2019-08-05 11:04:23,803 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:23,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:23,850 INFO L256 TraceCheckSpWp]: Trace formula consists of 636 conjuncts, 16 conjunts are in the unsatisfiable core [2019-08-05 11:04:23,852 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:24,323 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:24,323 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2019-08-05 11:04:24,324 INFO L454 AbstractCegarLoop]: Interpolant automaton has 17 states [2019-08-05 11:04:24,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2019-08-05 11:04:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:24,325 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 17 states. [2019-08-05 11:04:24,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:24,582 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-08-05 11:04:24,582 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 11:04:24,582 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 17 [2019-08-05 11:04:24,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:24,583 INFO L225 Difference]: With dead ends: 19 [2019-08-05 11:04:24,583 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 11:04:24,584 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=136, Unknown=0, NotChecked=0, Total=272 [2019-08-05 11:04:24,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 11:04:24,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-08-05 11:04:24,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-08-05 11:04:24,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2019-08-05 11:04:24,586 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 17 [2019-08-05 11:04:24,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:24,587 INFO L475 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2019-08-05 11:04:24,587 INFO L476 AbstractCegarLoop]: Interpolant automaton has 17 states. [2019-08-05 11:04:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2019-08-05 11:04:24,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-08-05 11:04:24,587 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:24,587 INFO L399 BasicCegarLoop]: trace histogram [15, 1, 1, 1] [2019-08-05 11:04:24,588 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:24,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:24,588 INFO L82 PathProgramCache]: Analyzing trace with hash -1363453300, now seen corresponding path program 15 times [2019-08-05 11:04:24,589 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:24,637 INFO L256 TraceCheckSpWp]: Trace formula consists of 673 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:04:24,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:24,860 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:24,861 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:24,861 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2019-08-05 11:04:24,862 INFO L454 AbstractCegarLoop]: Interpolant automaton has 18 states [2019-08-05 11:04:24,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2019-08-05 11:04:24,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:24,863 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 18 states. [2019-08-05 11:04:25,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,140 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 11:04:25,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-08-05 11:04:25,140 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 18 [2019-08-05 11:04:25,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,141 INFO L225 Difference]: With dead ends: 20 [2019-08-05 11:04:25,141 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 11:04:25,142 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2019-08-05 11:04:25,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 11:04:25,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 11:04:25,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 11:04:25,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 11:04:25,144 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 18 [2019-08-05 11:04:25,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,145 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 11:04:25,145 INFO L476 AbstractCegarLoop]: Interpolant automaton has 18 states. [2019-08-05 11:04:25,145 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 11:04:25,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 11:04:25,146 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,146 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 11:04:25,146 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,147 INFO L82 PathProgramCache]: Analyzing trace with hash 682622467, now seen corresponding path program 16 times [2019-08-05 11:04:25,147 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:25,226 INFO L256 TraceCheckSpWp]: Trace formula consists of 710 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 11:04:25,228 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:25,599 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:25,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:25,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 11:04:25,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 11:04:25,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 11:04:25,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:25,601 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 11:04:25,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:25,649 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 11:04:25,650 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 11:04:25,650 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 11:04:25,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:25,650 INFO L225 Difference]: With dead ends: 21 [2019-08-05 11:04:25,651 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 11:04:25,651 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=171, Invalid=171, Unknown=0, NotChecked=0, Total=342 [2019-08-05 11:04:25,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 11:04:25,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 11:04:25,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 11:04:25,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 11:04:25,654 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 19 [2019-08-05 11:04:25,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:25,654 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 11:04:25,654 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 11:04:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 11:04:25,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 11:04:25,655 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:25,655 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 11:04:25,655 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:25,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:25,656 INFO L82 PathProgramCache]: Analyzing trace with hash -313538196, now seen corresponding path program 17 times [2019-08-05 11:04:25,657 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:25,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:25,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 747 conjuncts, 19 conjunts are in the unsatisfiable core [2019-08-05 11:04:25,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,008 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:26,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 11:04:26,009 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 11:04:26,009 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 11:04:26,010 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:26,010 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 11:04:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:26,061 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:04:26,068 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 11:04:26,068 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 11:04:26,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:26,069 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:04:26,069 INFO L226 Difference]: Without dead ends: 22 [2019-08-05 11:04:26,070 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2019-08-05 11:04:26,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2019-08-05 11:04:26,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2019-08-05 11:04:26,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2019-08-05 11:04:26,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 22 transitions. [2019-08-05 11:04:26,072 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 22 transitions. Word has length 20 [2019-08-05 11:04:26,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:26,073 INFO L475 AbstractCegarLoop]: Abstraction has 22 states and 22 transitions. [2019-08-05 11:04:26,073 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 11:04:26,073 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 22 transitions. [2019-08-05 11:04:26,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-08-05 11:04:26,074 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:26,074 INFO L399 BasicCegarLoop]: trace histogram [18, 1, 1, 1] [2019-08-05 11:04:26,074 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:26,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:26,074 INFO L82 PathProgramCache]: Analyzing trace with hash -1129747677, now seen corresponding path program 18 times [2019-08-05 11:04:26,075 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,130 INFO L256 TraceCheckSpWp]: Trace formula consists of 784 conjuncts, 20 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,132 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 0 proven. 171 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:26,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,510 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2019-08-05 11:04:26,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 21 states [2019-08-05 11:04:26,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2019-08-05 11:04:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:26,511 INFO L87 Difference]: Start difference. First operand 22 states and 22 transitions. Second operand 21 states. [2019-08-05 11:04:26,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:26,548 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2019-08-05 11:04:26,548 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-08-05 11:04:26,549 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 21 [2019-08-05 11:04:26,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:26,550 INFO L225 Difference]: With dead ends: 23 [2019-08-05 11:04:26,550 INFO L226 Difference]: Without dead ends: 23 [2019-08-05 11:04:26,551 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=210, Invalid=210, Unknown=0, NotChecked=0, Total=420 [2019-08-05 11:04:26,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-08-05 11:04:26,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-08-05 11:04:26,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 11:04:26,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2019-08-05 11:04:26,555 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 21 [2019-08-05 11:04:26,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:26,555 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2019-08-05 11:04:26,555 INFO L476 AbstractCegarLoop]: Interpolant automaton has 21 states. [2019-08-05 11:04:26,555 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2019-08-05 11:04:26,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-08-05 11:04:26,556 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:26,556 INFO L399 BasicCegarLoop]: trace histogram [19, 1, 1, 1] [2019-08-05 11:04:26,556 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:26,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:26,557 INFO L82 PathProgramCache]: Analyzing trace with hash -662437812, now seen corresponding path program 19 times [2019-08-05 11:04:26,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:26,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:26,613 INFO L256 TraceCheckSpWp]: Trace formula consists of 821 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 11:04:26,615 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:26,982 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 11:04:26,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 11:04:26,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2019-08-05 11:04:26,982 INFO L454 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-08-05 11:04:26,983 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-08-05 11:04:26,983 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:26,983 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand 22 states. [2019-08-05 11:04:27,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,031 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2019-08-05 11:04:27,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-08-05 11:04:27,031 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 22 [2019-08-05 11:04:27,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,032 INFO L225 Difference]: With dead ends: 24 [2019-08-05 11:04:27,032 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 11:04:27,033 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2019-08-05 11:04:27,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 11:04:27,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2019-08-05 11:04:27,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2019-08-05 11:04:27,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2019-08-05 11:04:27,036 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 22 [2019-08-05 11:04:27,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,037 INFO L475 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2019-08-05 11:04:27,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-08-05 11:04:27,037 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2019-08-05 11:04:27,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-08-05 11:04:27,037 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 11:04:27,038 INFO L399 BasicCegarLoop]: trace histogram [20, 1, 1, 1] [2019-08-05 11:04:27,038 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 11:04:27,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 11:04:27,038 INFO L82 PathProgramCache]: Analyzing trace with hash 939266115, now seen corresponding path program 20 times [2019-08-05 11:04:27,039 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 11:04:27,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 11:04:27,162 INFO L256 TraceCheckSpWp]: Trace formula consists of 858 conjuncts, 17 conjunts are in the unsatisfiable core [2019-08-05 11:04:27,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 11:04:27,274 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2019-08-05 11:04:27,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 11:04:27,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 11:04:27,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 11:04:27,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 11:04:27,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:04:27,277 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 3 states. [2019-08-05 11:04:27,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 11:04:27,292 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-08-05 11:04:27,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 11:04:27,292 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2019-08-05 11:04:27,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 11:04:27,292 INFO L225 Difference]: With dead ends: 22 [2019-08-05 11:04:27,293 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 11:04:27,293 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 11:04:27,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 11:04:27,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 11:04:27,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 11:04:27,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 11:04:27,294 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2019-08-05 11:04:27,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 11:04:27,294 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 11:04:27,294 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 11:04:27,294 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 11:04:27,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 11:04:27,298 INFO L202 PluginConnector]: Adding new model optional_data_creation_test04_false-valid-memtrack.i_32.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 11:04:27 BoogieIcfgContainer [2019-08-05 11:04:27,298 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 11:04:27,301 INFO L168 Benchmark]: Toolchain (without parser) took 10746.44 ms. Allocated memory was 134.2 MB in the beginning and 283.6 MB in the end (delta: 149.4 MB). Free memory was 109.9 MB in the beginning and 128.5 MB in the end (delta: -18.6 MB). Peak memory consumption was 130.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,301 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,302 INFO L168 Benchmark]: Boogie Procedure Inliner took 41.56 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,303 INFO L168 Benchmark]: Boogie Preprocessor took 31.93 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,304 INFO L168 Benchmark]: RCFGBuilder took 514.33 ms. Allocated memory is still 134.2 MB. Free memory was 106.4 MB in the beginning and 86.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,305 INFO L168 Benchmark]: TraceAbstraction took 10153.81 ms. Allocated memory was 134.2 MB in the beginning and 283.6 MB in the end (delta: 149.4 MB). Free memory was 86.0 MB in the beginning and 128.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. [2019-08-05 11:04:27,309 INFO L335 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.21 ms. Allocated memory is still 134.2 MB. Free memory was 111.9 MB in the beginning and 111.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 41.56 ms. Allocated memory is still 134.2 MB. Free memory was 109.9 MB in the beginning and 108.1 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.93 ms. Allocated memory is still 134.2 MB. Free memory was 108.1 MB in the beginning and 106.6 MB in the end (delta: 1.5 MB). Peak memory consumption was 1.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 514.33 ms. Allocated memory is still 134.2 MB. Free memory was 106.4 MB in the beginning and 86.2 MB in the end (delta: 20.2 MB). Peak memory consumption was 20.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10153.81 ms. Allocated memory was 134.2 MB in the beginning and 283.6 MB in the end (delta: 149.4 MB). Free memory was 86.0 MB in the beginning and 128.5 MB in the end (delta: -42.6 MB). Peak memory consumption was 106.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 226]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 10.0s OverallTime, 21 OverallIterations, 20 TraceHistogramMax, 1.6s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 61 SDtfs, 0 SDslu, 76 SDs, 0 SdLazy, 307 SolverSat, 35 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 252 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 211 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 6.9s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 252 ConstructedInterpolants, 0 QuantifiedInterpolants, 14574 SizeOfPredicates, 32 NumberOfNonLiveVariables, 10248 ConjunctsInSsa, 247 ConjunctsInUnsatCore, 21 InterpolantComputations, 2 PerfectInterpolantSequences, 210/1540 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...