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/toy/ManyInterpolants2.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:42:22,507 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:42:22,510 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:42:22,523 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:42:22,524 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:42:22,525 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:42:22,526 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:42:22,528 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:42:22,530 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:42:22,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:42:22,532 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:42:22,532 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:42:22,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:42:22,533 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:42:22,534 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:42:22,535 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:42:22,536 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:42:22,537 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:42:22,539 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:42:22,545 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:42:22,547 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:42:22,548 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:42:22,549 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:42:22,550 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:42:22,555 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:42:22,555 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:42:22,556 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:42:22,557 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:42:22,558 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:42:22,559 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:42:22,559 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:42:22,560 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:42:22,561 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:42:22,561 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:42:22,562 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:42:22,563 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:42:22,563 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:42:22,563 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:42:22,564 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:42:22,564 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:42:22,565 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:42:22,594 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:42:22,611 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:42:22,615 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:42:22,617 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:42:22,617 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:42:22,618 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyInterpolants2.bpl [2019-08-05 10:42:22,618 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/ManyInterpolants2.bpl' [2019-08-05 10:42:22,659 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:42:22,660 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:42:22,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:22,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:42:22,662 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:42:22,680 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,691 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,697 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:42:22,698 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:42:22,698 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:42:22,700 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:42:22,701 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:42:22,701 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:42:22,702 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:42:22,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,716 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,716 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,722 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,732 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/1) ... [2019-08-05 10:42:22,735 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:42:22,736 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:42:22,736 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:42:22,736 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:42:22,738 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (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 10:42:22,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure foo given in one single declaration [2019-08-05 10:42:22,808 INFO L130 BoogieDeclarations]: Found specification of procedure foo [2019-08-05 10:42:22,808 INFO L138 BoogieDeclarations]: Found implementation of procedure foo [2019-08-05 10:42:23,181 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:42:23,181 INFO L283 CfgBuilder]: Removed 9 assume(true) statements. [2019-08-05 10:42:23,183 INFO L202 PluginConnector]: Adding new model ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:23 BoogieIcfgContainer [2019-08-05 10:42:23,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:42:23,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:42:23,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:42:23,188 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:42:23,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:42:22" (1/2) ... [2019-08-05 10:42:23,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45b78df and model type ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:42:23, skipping insertion in model container [2019-08-05 10:42:23,190 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:42:23" (2/2) ... [2019-08-05 10:42:23,192 INFO L109 eAbstractionObserver]: Analyzing ICFG ManyInterpolants2.bpl [2019-08-05 10:42:23,202 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:42:23,210 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:42:23,237 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:42:23,269 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:42:23,270 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:42:23,270 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:42:23,271 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:42:23,271 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:42:23,271 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:42:23,271 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:42:23,271 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:42:23,271 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:42:23,287 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states. [2019-08-05 10:42:23,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2019-08-05 10:42:23,294 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:23,295 INFO L399 BasicCegarLoop]: trace histogram [1, 1] [2019-08-05 10:42:23,298 INFO L418 AbstractCegarLoop]: === Iteration 1 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:23,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:23,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1048, now seen corresponding path program 1 times [2019-08-05 10:42:23,356 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:23,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:23,385 WARN L254 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 5 conjunts are in the unsatisfiable core [2019-08-05 10:42:23,388 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:23,456 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 10:42:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-08-05 10:42:23,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:23,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:23,474 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:23,476 INFO L87 Difference]: Start difference. First operand 17 states. Second operand 3 states. [2019-08-05 10:42:23,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:23,632 INFO L93 Difference]: Finished difference Result 20 states and 38 transitions. [2019-08-05 10:42:23,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:23,634 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 2 [2019-08-05 10:42:23,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:23,659 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:42:23,659 INFO L226 Difference]: Without dead ends: 19 [2019-08-05 10:42:23,661 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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 10:42:23,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-08-05 10:42:23,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 17. [2019-08-05 10:42:23,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:42:23,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 32 transitions. [2019-08-05 10:42:23,696 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 32 transitions. Word has length 2 [2019-08-05 10:42:23,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:23,697 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 32 transitions. [2019-08-05 10:42:23,697 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:23,697 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 32 transitions. [2019-08-05 10:42:23,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:23,698 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:23,698 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:23,699 INFO L418 AbstractCegarLoop]: === Iteration 2 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:23,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:23,700 INFO L82 PathProgramCache]: Analyzing trace with hash -267397413, now seen corresponding path program 1 times [2019-08-05 10:42:23,701 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:23,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:23,717 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:23,719 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:23,769 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:23,769 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:23,770 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:23,772 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:23,778 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:23,779 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:23,779 INFO L87 Difference]: Start difference. First operand 17 states and 32 transitions. Second operand 3 states. [2019-08-05 10:42:23,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:23,992 INFO L93 Difference]: Finished difference Result 24 states and 41 transitions. [2019-08-05 10:42:23,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:23,993 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:23,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:23,994 INFO L225 Difference]: With dead ends: 24 [2019-08-05 10:42:23,994 INFO L226 Difference]: Without dead ends: 24 [2019-08-05 10:42:23,996 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 10:42:23,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-08-05 10:42:24,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2019-08-05 10:42:24,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-08-05 10:42:24,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 41 transitions. [2019-08-05 10:42:24,002 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 41 transitions. Word has length 8 [2019-08-05 10:42:24,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:24,003 INFO L475 AbstractCegarLoop]: Abstraction has 23 states and 41 transitions. [2019-08-05 10:42:24,003 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:24,003 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 41 transitions. [2019-08-05 10:42:24,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:24,004 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:24,004 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:24,004 INFO L418 AbstractCegarLoop]: === Iteration 3 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:24,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:24,005 INFO L82 PathProgramCache]: Analyzing trace with hash -267389477, now seen corresponding path program 1 times [2019-08-05 10:42:24,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:24,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:24,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:42:24,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,150 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:24,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:24,151 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:24,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:42:24,163 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:42:24,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:24,163 INFO L87 Difference]: Start difference. First operand 23 states and 41 transitions. Second operand 5 states. [2019-08-05 10:42:24,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:24,544 INFO L93 Difference]: Finished difference Result 33 states and 57 transitions. [2019-08-05 10:42:24,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:42:24,546 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:42:24,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:24,547 INFO L225 Difference]: With dead ends: 33 [2019-08-05 10:42:24,547 INFO L226 Difference]: Without dead ends: 33 [2019-08-05 10:42:24,548 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:24,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2019-08-05 10:42:24,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2019-08-05 10:42:24,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2019-08-05 10:42:24,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 53 transitions. [2019-08-05 10:42:24,554 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 53 transitions. Word has length 8 [2019-08-05 10:42:24,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:24,554 INFO L475 AbstractCegarLoop]: Abstraction has 30 states and 53 transitions. [2019-08-05 10:42:24,554 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:42:24,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 53 transitions. [2019-08-05 10:42:24,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:24,555 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:24,555 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:24,556 INFO L418 AbstractCegarLoop]: === Iteration 4 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:24,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:24,556 INFO L82 PathProgramCache]: Analyzing trace with hash -268005137, now seen corresponding path program 1 times [2019-08-05 10:42:24,557 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:24,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:24,566 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:42:24,567 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:24,594 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:24,594 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:24,594 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:24,595 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:24,595 INFO L87 Difference]: Start difference. First operand 30 states and 53 transitions. Second operand 3 states. [2019-08-05 10:42:24,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:24,620 INFO L93 Difference]: Finished difference Result 43 states and 74 transitions. [2019-08-05 10:42:24,621 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:24,621 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:24,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:24,622 INFO L225 Difference]: With dead ends: 43 [2019-08-05 10:42:24,622 INFO L226 Difference]: Without dead ends: 43 [2019-08-05 10:42:24,623 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 10:42:24,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2019-08-05 10:42:24,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 42. [2019-08-05 10:42:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2019-08-05 10:42:24,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2019-08-05 10:42:24,634 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 8 [2019-08-05 10:42:24,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:24,635 INFO L475 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2019-08-05 10:42:24,635 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:24,635 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2019-08-05 10:42:24,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:24,636 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:24,636 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:24,636 INFO L418 AbstractCegarLoop]: === Iteration 5 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:24,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:24,637 INFO L82 PathProgramCache]: Analyzing trace with hash -503818789, now seen corresponding path program 1 times [2019-08-05 10:42:24,638 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:24,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:24,649 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:42:24,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:24,738 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:24,739 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:24,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:24,740 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:42:24,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:42:24,741 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:24,741 INFO L87 Difference]: Start difference. First operand 42 states and 74 transitions. Second operand 5 states. [2019-08-05 10:42:24,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:24,998 INFO L93 Difference]: Finished difference Result 50 states and 89 transitions. [2019-08-05 10:42:24,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:42:24,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:42:24,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,001 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:42:25,001 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:42:25,002 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:25,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:42:25,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 48. [2019-08-05 10:42:25,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 48 states. [2019-08-05 10:42:25,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 85 transitions. [2019-08-05 10:42:25,009 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 85 transitions. Word has length 8 [2019-08-05 10:42:25,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,009 INFO L475 AbstractCegarLoop]: Abstraction has 48 states and 85 transitions. [2019-08-05 10:42:25,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:42:25,009 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 85 transitions. [2019-08-05 10:42:25,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:25,010 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,010 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:25,010 INFO L418 AbstractCegarLoop]: === Iteration 6 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,011 INFO L82 PathProgramCache]: Analyzing trace with hash -503810853, now seen corresponding path program 1 times [2019-08-05 10:42:25,012 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,020 INFO L256 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:25,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:25,036 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:25,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:25,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:25,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:25,037 INFO L87 Difference]: Start difference. First operand 48 states and 85 transitions. Second operand 3 states. [2019-08-05 10:42:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,076 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2019-08-05 10:42:25,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:25,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2019-08-05 10:42:25,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,078 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:42:25,078 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:42:25,079 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 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 10:42:25,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:42:25,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:42:25,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:42:25,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 79 transitions. [2019-08-05 10:42:25,086 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 79 transitions. Word has length 8 [2019-08-05 10:42:25,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,086 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 79 transitions. [2019-08-05 10:42:25,086 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 79 transitions. [2019-08-05 10:42:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:25,087 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,087 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:25,088 INFO L418 AbstractCegarLoop]: === Iteration 7 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,088 INFO L82 PathProgramCache]: Analyzing trace with hash 893868399, now seen corresponding path program 1 times [2019-08-05 10:42:25,089 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,098 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,099 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:25,225 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:25,225 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:25,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:42:25,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:42:25,226 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:25,227 INFO L87 Difference]: Start difference. First operand 49 states and 79 transitions. Second operand 5 states. [2019-08-05 10:42:25,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,326 INFO L93 Difference]: Finished difference Result 50 states and 79 transitions. [2019-08-05 10:42:25,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:42:25,326 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:42:25,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,327 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:42:25,327 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:42:25,327 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:25,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:42:25,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:42:25,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:42:25,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 78 transitions. [2019-08-05 10:42:25,332 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 78 transitions. Word has length 8 [2019-08-05 10:42:25,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,333 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 78 transitions. [2019-08-05 10:42:25,333 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:42:25,333 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 78 transitions. [2019-08-05 10:42:25,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:42:25,334 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,334 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:25,334 INFO L418 AbstractCegarLoop]: === Iteration 8 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,335 INFO L82 PathProgramCache]: Analyzing trace with hash 657439087, now seen corresponding path program 1 times [2019-08-05 10:42:25,335 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 13 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:42:25,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:25,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:25,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:42:25,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:42:25,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:25,652 INFO L87 Difference]: Start difference. First operand 49 states and 78 transitions. Second operand 5 states. [2019-08-05 10:42:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,782 INFO L93 Difference]: Finished difference Result 50 states and 78 transitions. [2019-08-05 10:42:25,782 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:42:25,783 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:42:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,784 INFO L225 Difference]: With dead ends: 50 [2019-08-05 10:42:25,784 INFO L226 Difference]: Without dead ends: 50 [2019-08-05 10:42:25,784 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:42:25,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2019-08-05 10:42:25,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2019-08-05 10:42:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2019-08-05 10:42:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 77 transitions. [2019-08-05 10:42:25,790 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 77 transitions. Word has length 8 [2019-08-05 10:42:25,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,790 INFO L475 AbstractCegarLoop]: Abstraction has 49 states and 77 transitions. [2019-08-05 10:42:25,790 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:42:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 77 transitions. [2019-08-05 10:42:25,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:42:25,791 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,791 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:25,792 INFO L418 AbstractCegarLoop]: === Iteration 9 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,792 INFO L82 PathProgramCache]: Analyzing trace with hash -1489130254, now seen corresponding path program 1 times [2019-08-05 10:42:25,793 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,805 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,837 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:25,837 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:25,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:25,838 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:25,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:25,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:25,838 INFO L87 Difference]: Start difference. First operand 49 states and 77 transitions. Second operand 3 states. [2019-08-05 10:42:25,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,878 INFO L93 Difference]: Finished difference Result 45 states and 67 transitions. [2019-08-05 10:42:25,879 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:25,879 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:42:25,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,879 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:42:25,879 INFO L226 Difference]: Without dead ends: 32 [2019-08-05 10:42:25,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 10:42:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2019-08-05 10:42:25,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2019-08-05 10:42:25,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2019-08-05 10:42:25,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 48 transitions. [2019-08-05 10:42:25,882 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 48 transitions. Word has length 14 [2019-08-05 10:42:25,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,883 INFO L475 AbstractCegarLoop]: Abstraction has 32 states and 48 transitions. [2019-08-05 10:42:25,883 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:25,883 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 48 transitions. [2019-08-05 10:42:25,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:42:25,883 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:42:25,883 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 10:42:25,884 INFO L418 AbstractCegarLoop]: === Iteration 10 === [fooErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:42:25,884 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:42:25,884 INFO L82 PathProgramCache]: Analyzing trace with hash 1073851890, now seen corresponding path program 2 times [2019-08-05 10:42:25,885 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:42:25,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:42:25,894 INFO L256 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:42:25,895 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:42:25,916 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:42:25,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:42:25,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 10:42:25,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:42:25,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:42:25,917 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:42:25,917 INFO L87 Difference]: Start difference. First operand 32 states and 48 transitions. Second operand 3 states. [2019-08-05 10:42:25,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:42:25,930 INFO L93 Difference]: Finished difference Result 19 states and 28 transitions. [2019-08-05 10:42:25,933 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:42:25,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2019-08-05 10:42:25,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:42:25,934 INFO L225 Difference]: With dead ends: 19 [2019-08-05 10:42:25,934 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:42:25,935 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 12 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 10:42:25,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:42:25,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:42:25,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:42:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:42:25,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2019-08-05 10:42:25,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:42:25,936 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:42:25,936 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:42:25,936 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:42:25,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:42:25,941 INFO L202 PluginConnector]: Adding new model ManyInterpolants2.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:42:25 BoogieIcfgContainer [2019-08-05 10:42:25,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:42:25,944 INFO L168 Benchmark]: Toolchain (without parser) took 3282.58 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 109.0 MB in the beginning and 78.6 MB in the end (delta: 30.4 MB). Peak memory consumption was 69.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,945 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.0 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.68 ms. Allocated memory is still 132.6 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,947 INFO L168 Benchmark]: Boogie Preprocessor took 33.77 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,948 INFO L168 Benchmark]: RCFGBuilder took 447.85 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 93.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,949 INFO L168 Benchmark]: TraceAbstraction took 2756.08 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 93.1 MB in the beginning and 78.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:42:25,953 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.20 ms. Allocated memory is still 132.6 MB. Free memory was 110.3 MB in the beginning and 110.0 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 39.68 ms. Allocated memory is still 132.6 MB. Free memory was 109.0 MB in the beginning and 107.1 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 33.77 ms. Allocated memory is still 132.6 MB. Free memory was 107.1 MB in the beginning and 105.8 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 447.85 ms. Allocated memory is still 132.6 MB. Free memory was 105.6 MB in the beginning and 93.3 MB in the end (delta: 12.3 MB). Peak memory consumption was 12.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2756.08 ms. Allocated memory was 132.6 MB in the beginning and 171.4 MB in the end (delta: 38.8 MB). Free memory was 93.1 MB in the beginning and 78.6 MB in the end (delta: 14.5 MB). Peak memory consumption was 53.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 69]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 17 locations, 1 error locations. SAFE Result, 2.6s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 1.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 270 SDtfs, 89 SDslu, 234 SDs, 0 SdLazy, 305 SolverSat, 15 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=49occurred in iteration=6, 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, 10 MinimizatonAttempts, 12 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 86 NumberOfCodeBlocks, 86 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 76 ConstructedInterpolants, 0 QuantifiedInterpolants, 2401 SizeOfPredicates, 1 NumberOfNonLiveVariables, 236 ConjunctsInSsa, 71 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 19/19 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...