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/InvariantSynthesis/InvariantSynthesis_WPHelpful02.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:43:43,793 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:43:43,795 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:43:43,814 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:43:43,814 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:43:43,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:43:43,817 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:43:43,819 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:43:43,821 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:43:43,821 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:43:43,822 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:43:43,823 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:43:43,823 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:43:43,824 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:43:43,825 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:43:43,826 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:43:43,827 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:43:43,828 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:43:43,830 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:43:43,832 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:43:43,833 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:43:43,834 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:43:43,836 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:43:43,836 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:43:43,839 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:43:43,839 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:43:43,840 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:43:43,840 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:43:43,841 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:43:43,842 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:43:43,842 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:43:43,843 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:43:43,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:43:43,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:43:43,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:43:43,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:43:43,847 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:43:43,848 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:43:43,848 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:43:43,849 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:43:43,850 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:43:43,885 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:43:43,896 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:43:43,899 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:43:43,901 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:43:43,901 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:43:43,902 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/InvariantSynthesis_WPHelpful02.bpl [2019-08-05 10:43:43,902 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/toy/InvariantSynthesis/InvariantSynthesis_WPHelpful02.bpl' [2019-08-05 10:43:43,929 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:43:43,931 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:43:43,932 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:43,932 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:43:43,932 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:43:43,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,957 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,963 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:43:43,963 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:43:43,963 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:43:43,965 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:43:43,966 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:43:43,966 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:43:43,967 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:43:43,977 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,977 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,978 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,978 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,981 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,985 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,986 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/1) ... [2019-08-05 10:43:43,987 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:43:43,988 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:43:43,988 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:43:43,988 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:43:43,989 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (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:43:44,059 INFO L124 BoogieDeclarations]: Specification and implementation of procedure main given in one single declaration [2019-08-05 10:43:44,059 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-08-05 10:43:44,059 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-08-05 10:43:44,456 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:43:44,456 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:43:44,459 INFO L202 PluginConnector]: Adding new model InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:44 BoogieIcfgContainer [2019-08-05 10:43:44,459 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:43:44,462 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:43:44,462 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:43:44,476 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:43:44,478 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:43:43" (1/2) ... [2019-08-05 10:43:44,480 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45d0aa96 and model type InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:43:44, skipping insertion in model container [2019-08-05 10:43:44,480 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:43:44" (2/2) ... [2019-08-05 10:43:44,484 INFO L109 eAbstractionObserver]: Analyzing ICFG InvariantSynthesis_WPHelpful02.bpl [2019-08-05 10:43:44,497 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:43:44,507 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:43:44,530 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:43:44,562 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:43:44,562 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:43:44,563 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:43:44,563 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:43:44,563 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:43:44,563 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:43:44,563 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:43:44,563 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:43:44,563 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:43:44,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:43:44,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:43:44,582 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,582 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:43:44,584 INFO L418 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,589 INFO L82 PathProgramCache]: Analyzing trace with hash 30368, now seen corresponding path program 1 times [2019-08-05 10:43:44,636 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 12 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,668 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,710 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:43:44,712 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:43:44,712 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:43:44,716 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:43:44,727 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:43:44,728 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:43:44,730 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:43:44,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:44,759 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:43:44,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:44,761 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:43:44,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:44,773 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:43:44,773 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:43:44,775 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 10:43:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:43:44,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:43:44,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:43:44,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:43:44,808 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:43:44,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:44,809 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:43:44,809 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:43:44,809 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:43:44,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:43:44,810 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:44,810 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:43:44,810 INFO L418 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:44,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:44,811 INFO L82 PathProgramCache]: Analyzing trace with hash 949084, now seen corresponding path program 1 times [2019-08-05 10:43:44,812 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:44,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:44,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 15 conjuncts, 6 conjunts are in the unsatisfiable core [2019-08-05 10:43:44,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:44,998 WARN L188 SmtUtils]: Spent 120.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:45,005 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,111 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 10:43:45,112 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:45,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:43:45,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:43:45,114 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:43:45,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:45,115 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:43:45,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,197 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:43:45,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:43:45,198 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:43:45,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,199 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:43:45,199 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:43:45,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:43:45,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:43:45,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:43:45,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:43:45,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:43:45,202 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:43:45,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,203 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:43:45,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:43:45,203 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:43:45,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:43:45,204 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,204 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:43:45,204 INFO L418 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,205 INFO L82 PathProgramCache]: Analyzing trace with hash 29429280, now seen corresponding path program 2 times [2019-08-05 10:43:45,206 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,228 WARN L254 TraceCheckSpWp]: Trace formula consists of 18 conjuncts, 9 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,229 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:45,281 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,282 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:45,284 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,288 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,575 WARN L188 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 13 [2019-08-05 10:43:45,579 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,638 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 10:43:45,638 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:45,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:45,639 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:43:45,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:43:45,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:45,640 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:43:45,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:45,660 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:43:45,661 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:43:45,661 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:43:45,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:45,661 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:43:45,662 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:43:45,662 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:43:45,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:43:45,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:43:45,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:43:45,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:43:45,665 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:43:45,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:45,665 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:43:45,665 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:43:45,665 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:43:45,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:43:45,666 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:45,666 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:43:45,666 INFO L418 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:45,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:45,667 INFO L82 PathProgramCache]: Analyzing trace with hash 912315356, now seen corresponding path program 3 times [2019-08-05 10:43:45,668 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:45,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:45,693 WARN L254 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 10:43:45,695 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:45,823 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:43:45,826 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,828 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:45,830 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,009 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 12 [2019-08-05 10:43:46,013 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,014 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,017 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:46,018 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,100 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,217 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 10:43:46,220 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:43:46,221 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:46,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:46,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:46,223 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:43:46,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:46,290 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:46,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:43:46,290 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:43:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:46,291 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:46,291 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:43:46,292 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:46,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:43:46,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:43:46,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:43:46,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:43:46,295 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:43:46,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:46,295 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:43:46,295 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:46,295 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:43:46,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:43:46,296 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:46,296 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:43:46,296 INFO L418 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:46,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:46,297 INFO L82 PathProgramCache]: Analyzing trace with hash -1782987360, now seen corresponding path program 4 times [2019-08-05 10:43:46,298 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:46,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:46,345 WARN L254 TraceCheckSpWp]: Trace formula consists of 24 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:43:46,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:46,397 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,398 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,400 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:46,401 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,493 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,494 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:46,495 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,497 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,596 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,597 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,599 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-08-05 10:43:46,600 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,795 WARN L188 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 31 DAG size of output: 13 [2019-08-05 10:43:46,798 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:46,994 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 10:43:46,995 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:46,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:43:46,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:43:46,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:43:46,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:46,997 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:43:47,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,024 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:43:47,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:43:47,025 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:43:47,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,025 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:43:47,026 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:43:47,026 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:47,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:43:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:43:47,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:43:47,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:43:47,029 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:43:47,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,030 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:43:47,030 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:43:47,030 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:43:47,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:43:47,030 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:43:47,030 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:43:47,031 INFO L418 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:43:47,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:43:47,031 INFO L82 PathProgramCache]: Analyzing trace with hash 561974364, now seen corresponding path program 5 times [2019-08-05 10:43:47,032 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:43:47,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:43:47,072 WARN L254 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:43:47,073 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:43:47,136 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,190 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,192 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,194 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,195 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,198 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,199 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,200 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,201 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,203 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,216 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,319 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,344 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,345 INFO L320 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-08-05 10:43:47,381 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:43:47,381 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:43:47,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:43:47,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:43:47,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:43:47,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:43:47,382 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 6 states. [2019-08-05 10:43:47,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:43:47,424 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:43:47,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:43:47,424 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 8 [2019-08-05 10:43:47,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:43:47,425 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:43:47,425 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:43:47,426 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:43:47,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:43:47,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:43:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:43:47,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:43:47,428 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 8 [2019-08-05 10:43:47,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:43:47,428 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:43:47,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:43:47,429 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:43:47,429 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:43:47,434 INFO L202 PluginConnector]: Adding new model InvariantSynthesis_WPHelpful02.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:43:47 BoogieIcfgContainer [2019-08-05 10:43:47,435 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:43:47,437 INFO L168 Benchmark]: Toolchain (without parser) took 3505.44 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 110.0 MB in the beginning and 59.1 MB in the end (delta: 50.9 MB). Peak memory consumption was 87.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:47,438 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.20 ms. Allocated memory is still 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:43:47,439 INFO L168 Benchmark]: Boogie Procedure Inliner took 33.90 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:47,439 INFO L168 Benchmark]: Boogie Preprocessor took 21.14 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 106.7 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:43:47,440 INFO L168 Benchmark]: RCFGBuilder took 471.42 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 94.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:47,442 INFO L168 Benchmark]: TraceAbstraction took 2972.98 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 94.2 MB in the beginning and 59.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:43:47,449 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 133.7 MB. Free memory is still 110.9 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 33.90 ms. Allocated memory is still 133.7 MB. Free memory was 110.0 MB in the beginning and 107.9 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 21.14 ms. Allocated memory is still 133.7 MB. Free memory was 107.9 MB in the beginning and 106.7 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 471.42 ms. Allocated memory is still 133.7 MB. Free memory was 106.7 MB in the beginning and 94.2 MB in the end (delta: 12.5 MB). Peak memory consumption was 12.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2972.98 ms. Allocated memory was 133.7 MB in the beginning and 169.9 MB in the end (delta: 36.2 MB). Free memory was 94.2 MB in the beginning and 59.1 MB in the end (delta: 35.1 MB). Peak memory consumption was 71.3 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 30]: 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, 2.8s OverallTime, 6 OverallIterations, 5 TraceHistogramMax, 0.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 17 SDtfs, 2 SDslu, 6 SDs, 0 SdLazy, 37 SolverSat, 9 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=9occurred in iteration=5, 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, 6 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 33 NumberOfCodeBlocks, 33 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 27 ConstructedInterpolants, 0 QuantifiedInterpolants, 1682 SizeOfPredicates, 6 NumberOfNonLiveVariables, 117 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 6 InterpolantComputations, 1 PerfectInterpolantSequences, 7/35 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...